CGAL Namespace Reference

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

Typedefs
typedef Hilbert_policy< Median >	Hilbert_sort_median_policy
	A typedef to Hilbert_policy<Median>.
typedef Hilbert_policy< Middle >	Hilbert_sort_middle_policy
	A typedef to Hilbert_policy<Middle>.

Functions
template<class ConcurrencyTag = Sequential_tag, class InputPointIterator , class Traits , class PolicyTag >
void	hilbert_sort (InputPointIterator begin, InputPointIterator end, const Traits &traits=Default_traits, PolicyTag policy=Default_policy)
	The function hilbert_sort() sorts an iterator range of points along a Hilbert curve.
template<class InputPointIterator , class Traits , class PolicyTag >
void	hilbert_sort_on_sphere (InputPointIterator begin, InputPointIterator end, const Traits &traits=Default_traits, PolicyTag policy=Default_policy, double sqr_radius=1.0, const Traits::Point_3 &center=Default_center)
	The function hilbert_sort_on_sphere() sorts an iterator range of points that are supposed to be close to a given sphere along a Hilbert curve on that same sphere.
template<class ConcurrencyTag = Sequential_tag, class InputPointIterator , class Traits , class PolicyTag >
void	spatial_sort (InputPointIterator begin, InputPointIterator end, const Traits &traits=Default_traits, PolicyTag policy=Default_policy, std::ptrdiff_t threshold_hilbert=default, std::ptrdiff_t threshold_multiscale=default, double ratio=default)
	The function spatial_sort() sorts an iterator range of points in a way that improves space locality.
template<class InputPointIterator , class Traits , class PolicyTag >
void	spatial_sort_on_sphere (InputPointIterator begin, InputPointIterator end, const Traits &traits=Default_traits, PolicyTag policy=Default_policy, double sqr_radius=1.0, const Traits::Point_3 &center=Default_center, std::ptrdiff_t threshold_hilbert=default, std::ptrdiff_t threshold_multiscale=default, double ratio=default)
	The function spatial_sort_on_sphere() sorts an iterator range of points in a way that improves space locality with respect to the intrinsic metric on the sphere given as input.