mirror of https://github.com/CGAL/cgal
Spell check.
This commit is contained in:
parent
ca2cf8c462
commit
452629b73a
|
|
@ -20,7 +20,7 @@ Given an iterator range of points, the function \ccc{hilbert_sort} sorts them
|
|||
along the space-filling Hilbert curve.
|
||||
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
|
||||
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.
|
||||
|
||||
This an example that can considerably speed up the constructions of a Delaunay triangulation.
|
||||
|
|
|
|||
Loading…
Reference in New Issue