CGAL users discussion list

[Andreas Fabri <>]

Hello,

We do not have a 3D Constrained Triangulation in CGAL.
You might have a look at tetgen.

Best,

Andreas

On 5/6/2022 3:14 PM, Bob Bill ( via cgal-discuss Mailing List) wrote:

I'm still trying to solve this, sorry again. I've seen the make_mesh_3 function (https://doc.cgal.org/latest/Mesh_3/group__PkgMesh3Functions.html#ga1ee73dc372985c6aeef85f2415fac0ba) but my initial domain is a triangle Surface_mesh, not a Polyhedron as in the example, so I am still stuck and I need a help or a hint.

Just to make things clearer, my goal is to create a 3D triangulation from the Surface_mesh `mesh2` of this basic example program in the documentation : https://doc.cgal.org/latest/Polygon_mesh_processing/Polygon_mesh_processing_2corefinement_consecutive_bool_op_8cpp-example.html#a5

Best

Il venerdì 6 maggio 2022, 01:15:25 CEST, Bob Bill ha scritto:

Dear all,

I have a triangulated Surface_mesh (which is the output of a boolean operation), and now I need to get a 3D triangulation from it, i.e. to fill it with tetrahedra. I don't see a direct way to do this, so I'd like to hear from you what your approach would be.

My first guess was to do just: 

// CGAL::Surface_mesh<K> sm 

Triangulation tr(s.points().begin(),sm.points().end());

but I don't know honestly if that's the preferred way. Any hint or comment is highly appreciated!

Best regards,

Bob

        -- 
        You are currently subscribed to cgal-discuss.
        To unsubscribe or access the archives, go to
        https://sympa.inria.fr/sympa/info/cgal-discuss
        
      
    
-- 
Andreas Fabri, PhD
Chief Officer, GeometryFactory
Editor, The CGAL Project