|
The class Kd_tree_node<Traits, Splitter, UseExtendedNode> implements a node class for a k-d tree. A node is either a leaf node, an internal node or an extended internal node. A leaf node contains one or more points. An internal node contains a pointer to its lower child, a pointer to its upper child, and a pointer to its separator. An extended internal node is an internal node containing the lower and upper limit of an extended node's rectangle along the node's cutting dimension.
#include <CGAL/Kd_tree_node.h>
Expects for the template argument a model of the concept SearchTraits, for example CGAL::Search_traits_2<CGAL::Cartesian<double> >, or CGAL::Cartesian_d<double>.
|
| |
|
Denotes type of node.
| |
|
|
| Number type. |
|
|
| Point type. |
|
|
| Separator type. |
|
| ||
|
| Iterator over points. | |
|
| ||
|
| Node handle. | |
|
| ||
|
|
| |
| Reports the points from the subtree of the node, that are approximately contained by q. | ||
|
| ||
|
|
| |
| Reports all the points contained by the subtree of the node. | ||
|
|
| Indicates whether a node is a leaf node. |
|
|
| Returns the number of items stored in a leaf node. |
|
|
| Returns the iterator to the first item in a leaf node. |
|
|
| Returns the past-the-end iterator in a leaf node. |
|
|
| Returns a handle to the lower child of an internal node. |
|
|
| Returns a handle to the upper child of an internal node. |
|
|
| Returns a reference to the separator. |
|
|
| Returns the lower limit of an extended node's rectangle along the node's cutting dimension. |
|
|
| Returns the upper limit of an extended node's rectangle along the node's cutting dimension. |