|
The concept Splitter defines the requirements for a function object class implementing a splitting rule.
CGAL::Fair<Traits, SpatialSeparator>,
CGAL::Median_of_rectangle<Traits, SpatialSeparator>,
CGAL::Median_of_max_spread<Traits, SpatialSeparator>,
CGAL::Midpoint_of_rectangle<Traits, SpatialSeparator>,
CGAL::Midpoint_of_max_spread<Traits, SpatialSeparator>,
CGAL::Sliding_fair<Traits, SpatialSeparator>,
CGAL::Sliding_midpoint<Traits, SpatialSeparator>.
| Splitter::FT | |
|
Number type.
| |
| Splitter::Separator | |
|
Separator.
| |
| Splitter::Container | |
|
Typedef to an instantiation of CGAL::Point_container<Traits>.
| |
The parameters aspect_ratio and bucket_size define the way in which k-d tree is constructed.
| FT | s.aspect_ratio () const | Returns the maximal ratio between the largest and smallest side of a cell allowed for fair splitting. |
| unsigned int | s.bucket_size () const | Returns the bucket size of the leaf nodes. |
| void | s ( Separator& sep , Container& c0 , Container& c1 ) const | |
| Sets up sep and splits points of c0 into c0 and c1 using sep. Container c0 should contain at least two points and c1 must be empty. | ||