Subject: CGAL users discussion list
List archive
- From: Ding <>
- To:
- Subject: Re: [cgal-discuss] performance of Delaunay Triangulation of random
- Date: Sat, 20 Dec 2008 18:13:25 +0100 (CET)
Thanks a lot for the detailed explanation.
Optimization option "-O2 -DNDEBUG" sovles the problem. Now DT of 0.125M 3D
grid
points on takes 4.93 sec, and DT of 1M 3D grid points takes 40.11 sec.
Another question is that if the 3D points are all on a smooth surface, e.g.,
vertices on a surface mesh, is there any way to accelerate DT on such points?
regards,
df
- [cgal-discuss] performance of Delaunay Triangulation of random 3D points, Ding, 12/20/2008
- Re: [cgal-discuss] performance of Delaunay Triangulation of random, Sylvain Pion, 12/20/2008
- [cgal-discuss] about using qt3 to dislay a triangulation generated, Kwok Jasper, 12/20/2008
- Re: [cgal-discuss] about using qt3 to dislay a triangulation generated, Laurent Rineau (GeometryFactory), 12/20/2008
- RE: [cgal-discuss] about using qt3 to dislay a triangulation, Kwok Jasper, 12/21/2008
- Re: [cgal-discuss] about using qt3 to dislay a triangulation, Andreas Fabri, 12/21/2008
- RE: [cgal-discuss] about using qt3 to dislay a triangulation, Kwok Jasper, 12/21/2008
- Re: [cgal-discuss] about using qt3 to dislay a triangulation generated, Laurent Rineau (GeometryFactory), 12/20/2008
- [cgal-discuss] about using qt3 to dislay a triangulation generated, Kwok Jasper, 12/20/2008
- Re: [cgal-discuss] performance of Delaunay Triangulation of random, Ben Supnik, 12/20/2008
- Re: [cgal-discuss] performance of Delaunay Triangulation of random, Sylvain Pion, 12/20/2008
- Re: [cgal-discuss] performance of Delaunay Triangulation of random, Ding, 12/20/2008
- Re: [cgal-discuss] performance of Delaunay Triangulation of random, Sylvain Pion, 12/20/2008
- Re: [cgal-discuss] performance of Delaunay Triangulation of random, Sylvain Pion, 12/20/2008
Archive powered by MHonArc 2.6.16.