CGAL 6.0.1 - Quadtrees, Octrees, and Orthtrees
Loading...
Searching...
No Matches
CGAL::Orthtrees::Maximum_contained_elements Class Reference

#include <CGAL/Orthtree/Split_predicates.h>

Definition

A class used to choose when a node should be split depending on the number of contained elements.

This is a bucket size predicate that considers a node should be split if it contains more than a certain number of items.

Warning
This split predicate is only appropriate for trees with traits classes which are models of OrthtreeTraitsWithData and where Node_data is a model of Range. RandomAccessRange is suggested for performance.
Examples
Orthtree/octree_build_from_point_set.cpp.

Public Member Functions

 Maximum_contained_elements (std::size_t bucket_size)
 creates a predicate based on the number of contained elements.
 
template<typename GeomTraits >
bool operator() (typename Orthtree< GeomTraits >::Node_index i, const Orthtree< GeomTraits > &tree) const
 returns true if the node with index i should be split, false otherwise.