|
CGAL 5.1 - Octree
|
#include <Concepts/Traversal.h>
A Traversal provides the functions needed to traverse the nodes of an octree using a Traversal_iterator.
A traversal is used to define a specific walk of the tree (e.g. Preorder, Postorder) iteratively rather than recursively.
CGAL::Octree::Traversal_iterator<Value> Methods | |
| template<class Point_index > | |
| const Node< Point_index > * | first (const Node< Point_index > *root) const |
| uses a reference to the root of the tree to determine the first node of the sequence More... | |
| template<class Point_index > | |
| const Node< Point_index > * | next (const Node< Point_index > *n) const |
| uses a reference to the current node to determine the next node of the sequence More... | |
| const Node<Point_index>* Traversal::first | ( | const Node< Point_index > * | root | ) | const |
uses a reference to the root of the tree to determine the first node of the sequence
| Point_index |
| root | a const pointer to the root node |
| const Node<Point_index>* Traversal::next | ( | const Node< Point_index > * | n | ) | const |
uses a reference to the current node to determine the next node of the sequence
| Point_index |
| n | a const pointer to the current node |