GetFEM  5.4.2
bgeot_kdtree.h File Reference

Simple implementation of a KD-tree. More...

Go to the source code of this file.

Classes

struct  bgeot::index_node_pair
 store a point and the associated index for the kdtree. More...
 
class  bgeot::kdtree
 Balanced tree over a set of points. More...
 

Namespaces

 bgeot
 Basic Geometric Tools.
 

Typedefs

typedef std::vector< index_node_pair > bgeot::kdtree_tab_type
 store a set of points with associated indexes.
 

Detailed Description

Simple implementation of a KD-tree.

Author
Julien Pommier Julie.nosp@m.n.Po.nosp@m.mmier.nosp@m.@ins.nosp@m.a-tou.nosp@m.lous.nosp@m.e.fr
Date
January 2004. Basically, a KD-tree is a balanced N-dimensional tree.

Definition in file bgeot_kdtree.h.

Rabisu Mirror Service We provide mirrors to support Open source communities. Our mirror server is located in Istanbul/Turkey region.

Please do not hesitate to contact mirror@rabisu.com for new open source mirror submissions.