CGAL users discussion list

[mytien <>]

Thanks for you responsiveness, you guys are great! 
Yesterday I somehow did not see your post with your benchmark program,
Olivier. I tried it and indeed receive the results from the manual! 
But I see that you used the Random_points_in_cube_3 template, with which you
create the optimal case for triangulation, is that right?
Does that mean, your benchmarks do not show the usually achieved
performance, but the best possible?

What I actually want to do is, let the user of my application draw circles
on planes, collect the points from these drawings and then show the
resulting mesh in a 3D view in real time.
So my plan was to
1. dynamically compute several downsamplings of the drawn points depending
on a couple of zoom levels,
2. triangulate these
3. determine the facets on the surface and display them.

But maybe delaunay triangulation is too slow for this application because of
the nature of the generated data? Do you think there is a more suitable
algorithm for my purpose, maybe in your library as well?



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Performance-of-Triangulation-3-tp4658201p4658230.html
Sent from the cgal-discuss mailing list archive at Nabble.com.