网格到网格的相交 [英] Mesh to mesh intersections

问题描述

我正在寻找描述如何确定一个三角形网格是否与另一个三角形网格相交的库或论文.

I'm looking for a library or a paper that describes how to determine if one triangular mesh intersects another.

有趣的是我要空了.如果CGAL中有某种方法可以做到这一点，那就让我望而却步.

Interestingly I am coming up empty. If there is some way to do it in CGAL, it is eluding me.

由于三角形相交是可能的，并且每个网格都包含有限数量的三角形，因此似乎显然应该可行.但是我认为必须有比明显的O(n * m)方法更好的方法，在O(n * m)方法中，一个网格具有n个三角形，另一个网格具有m个三角形.

It seems like it clearly should be possible, because triangle intersection is possible and because each mesh contains a finite number of triangles. But I assume there must be a better way to do it than the obvious O(n*m) approach where one mesh has n triangles and the other has m triangles.

推荐答案

我们通常使用CGAL的方法是

The way we usually do it using CGAL is with CGAL::box_intersection_d.

您可以通过混合使用示例，其中包含一个.

You can make it by mixing this example with this one.

从CGAL 4.12开始，现在有函数 CGAL::Polygon_mesh_processing::do_intersect()

Since CGAL 4.12 there is now the function CGAL::Polygon_mesh_processing::do_intersect().

这篇关于网格到网格的相交的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！