CGAL 6.0.2 - Quadtrees, Octrees, and Orthtrees

Loading...
Searching...
No Matches
List of all members | Public Member Functions
CGAL::Orthtree_traits_face_graph< TriangleMesh, VertexPointMap >::Split_predicate_node_min_extent Class Reference

`#include <CGAL/Orthtree_traits_face_graph.h>`

## Definition

template<class TriangleMesh, class VertexPointMap>
class CGAL::Orthtree_traits_face_graph< TriangleMesh, VertexPointMap >::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.

## Public Member Functions
| Split_predicate_node_min_extent (const FT &me)
| constructor with `me` being the minimal value a node extent could be (same value for all dimension).
| Split_predicate_node_min_extent (const std::array< FT, 3 > &me)
| constructor with `me` being the minimal value a node extent could be (one value per dimension).
template<typename NodeIndex , typename Tree >
bool | operator() (NodeIndex ni, const Tree &tree) const
| returns `true` if `ni` should be split, `false` otherwise.