Subject: CGAL users discussion list
List archive
- From: Ashwin Nanjappa <>
- To: CGAL Discuss <>
- Subject: Delaunay_triangulation_3 benchmarking
- Date: Thu, 22 Nov 2007 09:21:46 +0800
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.