两个三角形网格的交集 [英] intersection of two triangle meshes

问题描述

目前我正在寻找一种有效的算法来计算两个三角形网格的交集。我在互联网上搜索过，但还没有找到有价值的材料。本书<实时碰撞检测是一本有用的书，但对我的任务来说太复杂。我也发现了这篇文章：三角形到三角形的碰撞检测。但是我希望能够找到关于算法的详细描述。

问候
慢跑

解决方案

这取决于网格的大小，每个网格中的每个三角形相对于另一个网格的测试仅在小网格中有效，因为它具有n ^ 2复杂性。


工作大多数算法首先使用
空间分区
将空间细分为然后分别对每一个进行处理。


对于空间分割，大多数算法使用
OcTrees
或BSPTrees，但是如果您不需要将事物复杂化您可以将空间细分为n个盒子，然后检查每个盒子中的三角形三角形交点

Currently I am looking for an efficient algorithm to compute the intersection of two triangle meshes. I have searched over the internet, but haven't found valuable materials. The book Real-Time Collision Detection is a helpful book but is too complex for my task. I also found the post:Triangle to triangle collision detection in 3D. However I hope to find a detailed description about the algorithm.

Regards Jogging

解决方案

Well it depends on meshes size, testing each triangle in each mesh against the other is only valid in small meshes since it has n^2 complexity.

To work around that most algorithms use Spatial portioning first to subdivide the space into smaller ones and then tackles each one separately.

For spatial portioning most algorithms use OcTrees or BSPTrees however if you don't need to complicate things you can just subdivide the space into n boxes then check triangle triangle intersection in each box

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