CGAL users discussion list

[Laurent Rineau <>]

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>.

-- 
Laurent Rineau
INRIA - Sophia Antipolis
BP 93, 2004 Route des Lucioles
06902 Sophia Antipolis Cedex FRANCE
Tel: +33 4 92 38 78 62 (Fax: +33.4.97.15.53.95)