CGAL 4.7 - Spatial Sorting: Class and Concept List

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

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 12]

CGAL |
Hilbert_policy | `Hilbert_policy` is a policy class which can be used to parameterize a strategy policy in order to specify the strategy for spatial sorting
Median | `Median` is a tag class
Middle | `Middle` is a tag class
Hilbert_sort_2 | The function object `Hilbert_sort_2` sorts iterator ranges of `Traits::Point_2` along a Hilbert curve by recursively subdividing at the median or the middle depending on the `PolicyTag`
Hilbert_sort_3 | The function object `Hilbert_sort_3` sorts iterator ranges of `Traits::Point_3` along a Hilbert curve by recursively subdividing at the median or the middle depending on the `PolicyTag`
Hilbert_sort_d | The function object `Hilbert_sort_d` sorts iterator ranges of `Traits::Point_d` along a Hilbert curve by recursively subdividing at the median or the middle depending on the `PolicyTag`
Hilbert_sort_on_sphere_3 | The function object `Hilbert_sort_on_sphere_3` sorts iterator ranges of `Traits::Point_3` along a Hilbert curve on a given sphere
Multiscale_sort | The class `Multiscale_sort` represents a sorting algorithm adaptor
Spatial_sort_traits_adapter_2 | Given a property map associating a key to a point, the class `Spatial_sort_traits_adapter_2` induces a spatial reorder of the keys instead of the points, the comparisons being done on the associated points
Spatial_sort_traits_adapter_3 | Given a property map associating a key to a point, the class `Spatial_sort_traits_adapter_3` induces a spatial reorder of the keys instead of the points, the comparisons being done on the associated points
Spatial_sort_traits_adapter_d | Given a property map associating a key to a point, the class `Spatial_sort_traits_adapter_d` induces a spatial reorder of the keys instead of the points, the comparisons being done on the associated points
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
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
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