CGAL 6.2 - Spatial Sorting: Class and Concept List

CGAL 6.2 - Spatial Sorting

Loading...
Searching...
No Matches
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]

▼NCGAL |
C 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
C 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` (see Section Hilbert Sorting for more information on the policies)
C 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`(see Section Hilbert Sorting for more information on the policies)
C 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`
C 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
C Median | `Median` is a tag class
C Middle | `Middle` is a tag class
C Multiscale_sort | The class `Multiscale_sort` represents a sorting algorithm adaptor
C 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
C 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
C 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
C 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
C 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
C 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