All higher dimensional spatial sorting algorithms provided in Cgal are parameterized by a traits class Traits, which defines the primitives (objects and predicates) that the sorting algorithms use. SpatialSortingTraits_d defines the complete set of primitives required in these functions and functors.
| |
The point type on which the sorting algorithms operate.
| |
| |
Functor object type returning the dimension of a Point_d.
Must provide
int operator()(Point_d p) returning the dimension of p.
| |
| |
Functor object type returning the coordinates of a Point_d.
Must provide
FT operator()(Point_d p, int i) returning the ith
coordinate of p. FT is a type that can be used as
argument of CGAL::to_double.
| |
| |
Binary predicate object type comparing Point_ds
along some coordinate.
Must provide
bool operator()(Point_d p, Point_d q, int i) where true
is returned iff pi < qi,
where pi and qi denote ith coordinate of point p and q,
respectively.
|
Only a copy constructor is required.
|
The following member functions to create instances of the above predicate object types must exist.
|
| |
|
| |
|
|
Any Cgal d dimensional kernel.
CGAL::Spatial_sort_traits_adapter_d<Base_traits,PointPropertyMap>.