CGAL 5.3.2 - dD Spatial Searching
|
#include <CGAL/Kd_tree_node.h>
CGAL::Kd_tree_node< TreeTraits, Splitter, UseExtendedNode >.
Types | |
typedef Kd_tree< Traits, Splitter, UseExtendedNode >::iterator | iterator |
const iterator over points. | |
Operations | |
unsigned int | size () const |
Returns the number of items stored in a leaf node. | |
iterator | begin () const |
Returns a const iterator to the first item in a leaf node. | |
iterator | end () const |
Returns the appropriate past-the-end const iterator. | |
Additional Inherited Members | |
Public Types inherited from CGAL::Kd_tree_node< TreeTraits, Splitter, UseExtendedNode > | |
typedef TreeTraits ::Point_d | Point_d |
Point class. | |
Public Member Functions inherited from CGAL::Kd_tree_node< TreeTraits, Splitter, UseExtendedNode > | |
OutputIterator | search (OutputIterator it, FuzzyQueryItem q) const |
Reports the points from the subtree of the node, that are approximately contained by q . | |
boost::optional< Point_d > | search_any_point (OutputIterator it, FuzzyQueryItem q) const |
Reports any point from the subtree of the node, that is approximately contained by q . | |
OutputIterator | tree_items (OutputIterator it) const |
Reports all the points contained by the subtree of the node. | |
bool | is_leaf () const |
Indicates whether a node is a leaf node. | |