CGAL 4.4 - Spatial Sorting
|
![]() ![]() | |
![]() ![]() ![]() | 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 is a tag class |
![]() ![]() ![]() | Middle is a tag class |
![]() ![]() ![]() | 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 |
![]() ![]() ![]() | 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 |
![]() ![]() ![]() | 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 |
![]() ![]() ![]() | The class Multiscale_sort represents a sorting algorithm adaptor |
![]() ![]() ![]() | 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 |
![]() ![]() ![]() | 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 |
![]() ![]() ![]() | 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 |
![]() ![]() | 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 |
![]() ![]() | All 3D 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_3 defines the complete set of primitives required in these functions and functors |
![]() ![]() | 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 |