CGAL users discussion list

[nsoonhui <>]

For Point set simplification, two methods are available, 
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Point_set_processing_3_ref/Function_random_simplify_point_set.html#Cross_link_anchor_1598
random_simplify_point_set  and 
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Point_set_processing_3_ref/Function_grid_simplify_point_set.html#Cross_link_anchor_1593
grid set simplification .

Neither which, I think, can maintain the shape, volume and boundaries as
well as the 
http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Surface_mesh_simplification/Chapter_main.html
surface mesh simplification . 

Is there an algorithm to process the point set simplification such that the
delaunay triangulation formed from the simplified point set is the most
accurate with relative to the actual surface? I don't want to first
construct delaunay triangulation first, and only then applying the surface
mesh simplification because I afraid that triangulating a lot of points is
going to cost me a large amount of processing time. 

-- 
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Point-Set-Process-Simplification-but-maintain-the-shape-volume-and-boundaries-tp3322273p3322273.html
Sent from the cgal-discuss mailing list archive at Nabble.com.