\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.11.2 - dD Spatial Searching
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Splitter Concept Reference

Definition

Types

The parameters aspect_ratio and bucket_size define the way in which \(k\) - \(d\) tree is constructed.

typedef unspecified_type FT
 Number type.
 
typedef unspecified_type Separator
 Separator.
 
typedef unspecified_type Container
 Typedef to an instantiation of CGAL::Point_container<Traits>.
 

Operations

FT aspect_ratio () const
 Returns the maximal ratio between the largest and smallest side of a cell allowed for fair splitting.
 
unsigned int bucket_size () const
 Returns the bucket size of the leaf nodes.
 
void operator() (Separator &sep, Container &c0, Container &c1) const
 Sets up sep and splits points of c0 into c0 and c1 using sep. More...
 

Member Function Documentation

void Splitter::operator() ( 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.