CGAL 6.1 - Quadtrees, Octrees, and Orthtrees
|
#include <CGAL/Orthtree_traits_face_graph.h>
Traits class for the Orthtree
class to be used to construct a 3D octree around a triangulated surface mesh.
Each node of the octree will store all the faces of the mesh intersected by its bounding box. The subdivision of the octree is controlled by the nested class Orthtree_traits_face_graph::Split_predicate_node_min_extent
to which the minimal extent of a node should be provided.
TriangleMesh | a model of FaceListGraph with all faces being triangles |
VertexPointMap | a property map associating points to the vertices of TriangleMesh |
OrthtreeTraitsWithData
Classes | |
class | Split_predicate_node_min_extent |
Recommended split predicate to pass to Orthtree::refine() function so that the octree is refined until a node is either empty or has an extent that would be smaller after split than the corresponding value provided to the constructor. More... | |
Additional Inherited Members | |
![]() | |
using | Adjacency = int |
Adjacency type. | |
![]() |