Subject: CGAL users discussion list
List archive
- From: kyewong <>
- To:
- Subject: [cgal-discuss] Algorithm of CGAL::make_surface_mesh
- Date: Wed, 10 Aug 2011 00:12:55 -0700 (PDT)
Hi, I'm gonna use CGAL::make_surface_mesh to mesh an implicit surface,
extract the isosurface and convert it to Polyhedron_3 using
CGAL::output_surface_facets_to_polyhedron.
I noticed that the algorithm for extracting the isosurface from a given
implicit surface is the paper <Provably good sampling and meshing of
surfaces>.
However, I'm just wondering how about the result and stability of this
algorithm, comparing to the famous marching cube method used by Jules
Bloomenthal ? Is it fit for any type of implicit function?
Thanks!
--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Algorithm-of-CGAL-make-surface-mesh-tp3732231p3732231.html
Sent from the cgal-discuss mailing list archive at Nabble.com.
- [cgal-discuss] Algorithm of CGAL::make_surface_mesh, kyewong, 08/10/2011
- Re: [cgal-discuss] Algorithm of CGAL::make_surface_mesh, Laurent Rineau (GeometryFactory), 08/19/2011
Archive powered by MHonArc 2.6.16.