CGAL users discussion list

[SirM2X <>]

I'm very new to CGAL and I need to use some of its functionalities in my
project. Currently, I need to write a C# wrapper around CGAL in order to be
able to perform Boolean operations (intersection, union, etc.) on 3D
triangular meshes. The meshes are created (or read) by my high-level C#
program and are stored in a format similar to OpenGL's vertex buffer objects
(i.e. every mesh has a set of vertices and triangle indices).

I've read some of CGAL's manuals regarding CSG operation and I know that I
have to use Nef polyhedra to achieve what I need (based on
http://doc.cgal.org/latest/Nef_3/index.html). I'm thinking about doing the
following steps:

1) Send the meshes to my wrapper.
2) Convert the meshes to Polyhedron_3 instances.
3) Convert Polyhedron_3 instances to Nef_polyhedron_3 instances.
4) Perform Boolean operations on the Nef polyhedra instances.
5) Convert Nef polyhedra back to Polyhedron_3.
6) Convert Polyhedron_3 to my C# mesh format.

My first question is regarding step 2 above: how can I convert
vertices/faces to a Polyhedron_3 instance? I saw this other post
(http://cgal-discuss.949826.n4.nabble.com/Create-Polyhedron-from-given-Planes-td4568074.html#a4570518)
but I'm still clueless.

My second question is, how robust is CGAL towards imperfect meshes? The
meshes that I deal with have lots of wholes/imperfections in them (the Carve
CSG library (https://code.google.com/p/carve/) fails to perform CSG
operations on these meshes). Will CGAL handle these bad meshes?

Finally, my meshes have floating point vertices. Will that be a problem with
Nef_polyhedron_3?

Thanks in advance :)



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Boolean-operations-on-triangular-meshes-tp4661345.html
Sent from the cgal-discuss mailing list archive at Nabble.com.