CGAL users discussion list

Ashwin Nanjappa wrote:
>  wrote:
>
> > Hi,
> >
> > I you only want to compute the triangulation and if you have a 
> > container for the whole set of points, then
> > dt.insert(InputIterator first, InputIterator last)
> > should indeed be the fastest way. It uses spatial sorting.
>
>
> Is there any paper/reference I can study to understand spatial sort? I 
> couldn't find any in the CGAL manual's bibliography section.
>
> Thanks,
> ~ash

wikipedia gives some references
http://en.wikipedia.org/wiki/Space-filling_curve
http://en.wikipedia.org/wiki/Hilbert_curve