CGAL users discussion list

[Dominik Szczerba <>]

http://www.vtk.org/doc/release/5.4/html/a00988.html

On Fri, 2009-07-17 at 11:18 +0200, Christian Walder wrote:
> I see, thanks. Can anyone recommend a good c++ implementation of the
> marching cubes algorithm? I am quite surprised that this is not easier
> to find...
> 
> On Fri, Jul 17, 2009 at 11:09 AM, Mariette Yvinec
> <>
>  wrote:
>         CGAL Surface mesher is not a marching cube.
>         It builds  iteratively a sampling adapted to the surface
>         geometry
>         so that the restricted triangulation  of this sampling is
>         an accurate approximation of the surface and a nice
>         surface mesh formed with well shaped triangles.
>         
>         
>         
>         Christian Walder wrote:
>                 Dear All,
>                 
>                 I have used the CGAL library to perform marching cubes
>                 on an implicit surface. Unfortunately it is extremely
>                 slow - previously I have used a different
>                 implementation from an unknown author, and it is
>                 orders of magnitude faster for roughly the same
>                 resolution. I am wondering if I have called the
>                 functions correctly, and whether there are any easy
>                 ways attempt to speed it up.
>                 
>                 Best Regards,
>                 
>                 Christian
>                 
>                 ps.
>                 
>                 The key snippet of code is the following:
>                 
>                  Tr tr;            // 3D-Delaunay triangulation
>                 
>                  C2t3 c2t3 (tr);   // 2D-complex in 3D-Delaunay
>                 triangulation
>                      Surface_3 surface(implicit_function,
>                 Sphere_3(Point_3(center[0],center[1],center[2]),
>                 radius));
>                  // defining meshing criteria
>                                                                     
>                  CGAL::Surface_mesh_default_criteria_3<Tr>
>                 criteria(30.,  // angular bound
>                 radius_bound,  // radius bound
>                 distance_bound); // distance bound
>                  CGAL::make_surface_mesh(c2t3, surface, criteria,
>                 CGAL::Non_manifold_tag());
>                  
>         
>         
>         -- 
>         Mariette Yvinec
>         Geometrica project team
>         INRIA  Sophia-Antipolis  
>         
>         
>         -- 
>         You are currently subscribed to cgal-discuss.
>         To unsubscribe or access the archives, go to
>         https://lists-sop.inria.fr/wws/info/cgal-discuss
>