\( \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.8 - Spatial Sorting

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Classes
Concepts
Spatial Sorting Reference

##

## 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...