songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Spell check.

This commit is contained in:
Sylvain Pion 2007-04-17 16:20:09 +00:00
parent ca2cf8c462
commit 452629b73a
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Spatial_sorting/doc_tex/Spatial_sorting/spatial_sorting.tex
View File

@ -20,7 +20,7 @@ Given an iterator range of points, the function \ccc{hilbert_sort} sorts them
along the space-filling Hilbert curve. along the space-filling Hilbert curve.
Combined with a \ccc{std::random_shuffle}, the function \ccc{spatial_sort} will Combined with a \ccc{std::random_shuffle}, the function \ccc{spatial_sort} will
sort points in a way keeping enough randomness to retain theoretical optimality sort points in a way keeping enough randomness to retain theoretical optimality
for some algorithms\footnote{in fact, this has only been proven for Delaunay triangulation}, for some algorithms\footnote{in fact, this has only been proved for Delaunay triangulation},
and close enough to a space-filling curve to speed-up algorithms. and close enough to a space-filling curve to speed-up algorithms.
This an example that can considerably speed up the constructions of a Delaunay triangulation. This an example that can considerably speed up the constructions of a Delaunay triangulation.