CGAL 6.1.2 - Spatial Sorting: Concepts

CGAL 6.1.2 - Spatial Sorting

Loading...
Searching...
No Matches
Classes
Concepts
Reference Manual

##

## Concepts
concept | SpatialSortingTraits_2
| All 2D 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_2` defines the complete set of primitives required in these functions and functors. More...
concept | SpatialSortingTraits_3
| All 3D spatial sorting algorithms, including sorting on the sphere, provided in CGAL are parameterized by a traits class `Traits`, which defines the primitives (objects and predicates) that the sorting algorithms use. `SpatialSortingTraits_3` defines the complete set of primitives required in these functions and functors. More...
concept | SpatialSortingTraits_d
| 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. More...