CGAL users discussion list

[Christian Walder <>]

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());