mirror of https://github.com/CGAL/cgal
Polish documentation
This commit is contained in:
parent
914981fca6
commit
dea6d34167
|
|
@ -208,6 +208,11 @@ In this example program, the sorted sequence of points is retrieved
|
|||
using the indices of the points in a vector of pairs of points and integers.
|
||||
\cgalExample{Spatial_sorting/sp_sort_using_property_map_d.cpp}
|
||||
|
||||
\section Spatial_sortingParallel Spatial Sorting in Parallel
|
||||
|
||||
The Hilbert sort and spatial sort functions when using the median policy and with TBB
|
||||
enabled, are parallized and use up to four/eight threads for 2D/3D.
|
||||
|
||||
\section Spatial_sortingDesign Design and Implementation History
|
||||
|
||||
The first implementation of Hilbert and spatial sorting (2D and 3D) in CGAL was done by Cristophe Delage. Then, Olivier Devillers improved its design,
|
||||
|
|
|
|||
|
|
@ -1,4 +1,3 @@
|
|||
# Created by the script cgal_create_cmake_script
|
||||
# This is the CMake script for compiling a CGAL application.
|
||||
|
||||
|
||||
|
|
|
|||
Loading…
Reference in New Issue