songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

added missing include 

adding image to doc
This commit is contained in:
Sven Oesau 2024-02-02 13:55:37 +01:00
parent f78101222e
commit d9756dd971
3 changed files with 8 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
Orthtree/doc/Orthtree/Orthtree.txt
View File

@ -26,10 +26,9 @@ with custom contents and split predicates, and iterated on with
various traversal methods. Orthants can be orthotopes and not only hypercubes.
\cgalFigureBegin{Orthtree_fig, orthtree.png}
Building an %orthtree in 3D (%octree) from a point cloud.
Building an %orthtree in 3D (%octree) from a point cloud (top) and a mesh (bottom).
\cgalFigureEnd
\section Section_Orthtree_Building Building
A common purpose for an orthtree is to subdivide a collection of points,
@ -119,6 +118,11 @@ set as the orthtree's map type, so a map does not need to be provided.
\cgalExample{Orthtree/orthtree_build.cpp}
\section Section_Orthtree_Properties Properties
The Orthtree uses a mechanism to attach properties to nodes at run-time which follows \ref sectionSurfaceMesh_properties "Surface mesh properties". Each property is identified by a string and its key type and stored in a consecutive block of memory. Contrary to surface mesh the removal of properties is not supported.
Several properties are provided by default and used to maintain the data structure. The property \c "contents" keeps the data for each node. "parents" and "children" maintain the relation between nodes. "coordinates" and "depth" contain absolute positions of nodes.
\section Section_Orthtree_Traversal Traversal
\note For simplicity, the rest of the user manual will only use

2
Orthtree/include/CGAL/Orthtree.h
View File

@ -311,7 +311,7 @@ public:
than `bucket_size`, it is not split.
\warning This convenience method is only appropriate for trees with traits classes where
`Node_data` is a model of `RandomAccessRange`.
`Node_data` is a model of `Range`. `RandomAccessRange` is suggested for performance.
\param max_depth deepest a tree is allowed to be (nodes at this depth will not be split).
\param bucket_size maximum number of items a node is allowed to contain.

1
Orthtree/include/CGAL/Orthtree/Traversals.h
View File

@ -14,6 +14,7 @@
#include <CGAL/license/Orthtree.h>
#include <CGAL/Orthtree.h>
#include <iostream>
#include <boost/range/iterator_range.hpp>
#include <CGAL/Orthtree/Traversal_iterator.h>