#include <CGAL/kdtree_d.h>
| |
represents an axis-parallel box in -dimensions. The
box might be unbounded.
|
|
|
|
| ||
|
| |
construct an empty KD-tree of dimension dim.
|
|
| |||
perform internal consistency checks to verify the correctness of the KD-tree | ||||
|
| |||
construct the KD-tree from the points stored in l.
Precondition: all the points in l are of dimension no smaller than the dimension of kd_treeitself. | ||||
|
| |||
return into result all the points of the KD-tree that lie inside query_box |