On 9/20/19 3:15 PM, gregthom992 wrote:

> Hi Rahulverm88

>

> Thanks for you idea. That crossed my mind earlier but I put it off as I

> thought this sort of thing is already done. What I gather from reading the

> posts is that booleans in CGAL is kind of a problem and slow ? One post was

> talking of the order of 10s for union of two meshes ?

I don't know what post you read but it was probably about the Nef_3

package. If you use corefinement from Polygon Mesh Processing package

the runtime is pretty decent AFAIK:

https://doc.cgal.org/latest/Polygon_mesh_processing/index.html#Coref_sectionNote that the runtime will always depends on the number of input

simplices + the size of the intersection. So 10s might be what you will

have for a single Boolean if the input are large and you have many

intersections.

For example computing the union of 2 meshes with 350,000 vertices each

takes 3.8s if they intersect heavily and 2.18s if the intersection

region is small.

About python bindings, some functions from PMP has already been wrapped

but obviously not all of them.

Extending the file CGAL_Polygon_mesh_processing.i is quite straight

forward. If you are missing a function, PRs are welcome.

Look at test_pmp.py for how to load a mesh from an array of points

and polygons.

Sebastien.

> I am not sure I want to use CGAL then, unless someone has some other

> information ? I am just looking to check if they intersect of not intersect

> and then get some sort of distance between the two meshes.

>

> Thanks

>

> GT

>

>

>

> --

> Sent from:

http://cgal-discuss.949826.n4.nabble.com/>

--

You are currently subscribed to cgal-discuss.

To unsubscribe or access the archives, go to

https://sympa.inria.fr/sympa/info/cgal-discuss