CGAL 5.6.1  dD Spatial Searching

#include <CGAL/Splitters.h>
Implements the fair splitting rule.
This splitting rule is a compromise between the median of rectangle splitting rule and the midpoint of rectangle splitting rule. This splitting rule maintains an upper bound on the maximal allowed ratio of the longest and shortest side of a rectangle (the value of this upper bound is set in the constructor of the fair splitting rule). Among the splits that satisfy this bound, it selects the one in which the points have the largest spread. It then splits the points in the most even manner possible, subject to maintaining the bound on the ratio of the resulting rectangles.
Traits  must be a model of the concept SearchTraits , for example CGAL::Search_traits_2 . 
SpatialSeparator  must be a model of the concept SpatialSeparator . It has as default value the type Plane_separator<Traits::FT> . 
Splitter
SpatialSeparator
Types  
typedef Traits::FT  FT 
Number type.  
Creation  
Fair ()  
Default constructor.  
Fair (unsigned int bucket_size, FT aspect_ratio=FT(3))  
Constructor.  