Subject: CGAL users discussion list
List archive
- From:
- To:
- Subject: Re: [cgal-discuss] Delaunay_triangulation_3 benchmarking
- Date: Thu, 22 Nov 2007 10:23:45 +0100
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
- Delaunay_triangulation_3 benchmarking, Ashwin Nanjappa, 11/22/2007
- Re: [cgal-discuss] Delaunay_triangulation_3 benchmarking, Monique . Teillaud, 11/22/2007
- Re: [cgal-discuss] Delaunay_triangulation_3 benchmarking, Laurent Rineau, 11/22/2007
- Re: [cgal-discuss] Delaunay_triangulation_3 benchmarking, Andreas Fabri, 11/22/2007
- Re: [cgal-discuss] Delaunay_triangulation_3 benchmarking, Laurent Rineau, 11/22/2007
- Re: [cgal-discuss] Delaunay_triangulation_3 benchmarking, Andreas Fabri, 11/22/2007
- Re: [cgal-discuss] Delaunay_triangulation_3 benchmarking, Ashwin Nanjappa, 11/22/2007
- Re: [cgal-discuss] Delaunay_triangulation_3 benchmarking, Monique . Teillaud, 11/22/2007
- Re: [cgal-discuss] Delaunay_triangulation_3 benchmarking, Laurent Rineau, 11/22/2007
- Re: [cgal-discuss] Delaunay_triangulation_3 benchmarking, Monique . Teillaud, 11/22/2007
Archive powered by MHonArc 2.6.16.