CGAL users discussion list

[Andreas Fabri <>]

Laurent Rineau wrote:
> On Thursday 22 November 2007 10:23:45 
>
>  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.
>
> Actually, it should be documented that InputIterator needs to be a random 
> access iterator. That method uses std::random_shuffle, which requires that.
>
> It means that the container can be a std::vector<Point_3> but not a 
> std::list<Point_3>.

You are wrong Laurent, as it copies the points in a std::vector
and applies random_shuffle on this vector

andreas