The concept SpatialTree defines the requirements for a tree supporting both neighbor searching and approximate range searching.
SpatialTree::SearchTraits | |
Search traits.
| |
SpatialTree::Point_d | |
Point type.
| |
SpatialTree::iterator | |
Bidirectional const iterator with value type Point_d that allows
to enumerate all points in the tree.
| |
SpatialTree::Node_handle | |
Node handle.
| |
SpatialTree::Node_const_handle | |
const node handle.
| |
SpatialTree::Point_d_iterator | |
const iterator with value type const Point_d*.
| |
SpatialTree::Splitter | |
Splitter.
| |
SpatialTree::Distance | |
Distance.
|
template <class InputIterator> | |
SpatialTree tree ( InputIterator first, InputIterator beyond, SearchTraits t); | |
Constructs a tree on the elements from the sequence
[first,beyond).
|
template <class OutputIterator, class FuzzyQueryItem> | ||
OutputIterator | tree.search ( OutputIterator it, FuzzyQueryItem q) | |
Reports the points that are approximately contained by q. The value type of OutputIterator must be Point_d. | ||
iterator | tree.begin () const | Returns a const iterator to the first point in the tree. |
iterator | tree.end () const | Returns the appropriate past-the-end const iterator. |
Node_handle | tree.root () | Returns a handle to the root node of the tree. |
Node_const_handle | tree.root () const | Returns a const handle to the root node of the tree. |
Kd_tree_rectangle<SearchTraits::FT> | ||
tree.bounding_box () const | returns a const reference to the bounding box of the root node of the tree. | |
unsigned int | tree.size () const | Returns the number of items that are stored in the tree. |
CGAL::Kd_tree<Traits,Splitter,UseExtendedNode>.