CGAL users discussion list

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.

If you also need point location later, then you should use both the 
hierarchy and this type of insertion.

Best
        Monique Teillaud

Ashwin Nanjappa wrote:
> Hi,
>
> For an experiment, I'm looking at how fast CGAL performs 3D Delaunay 
> triangulation. I have a vector of 10^6 points which I want to 
> triangulate. At first I was naively using dt.insert(Point) [1].
>
> Later when I used dt.insert(InputIterator first, InputIterator last) I 
> saw that it speeded up by more than 3 times. Is this the most efficient 
> method to Delaunay-triangulate points or are there faster methods?
>
> [1] <http://tinyurl.com/2tlkzb>
>
> Thanks,
> ~ash