Adaptive medial-axis approximation for sphere-tree construction
Adaptive medial-axis approximation for sphere-tree construction
复制标题
DOI：
10.1145/966131.966132
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
G. Bradshaw;C. O'Sullivan
中科院分区：
文献类型：
--
作者：
G. Bradshaw;C. O'Sullivan
分层对象表示在执行高效的碰撞处理中起着重要作用。许多不同的几何基元已被用于构建这些表示，这使得交互区域能够快速定位。对于时间关键型算法，使用球体的层次结构（称为球体树）来表示对象具有明显的优势。本文提出了一种构建球体树的新算法。所提出的算法对凸形和非凸形对象进行近似，其拟合程度比现有算法更高。在表示的较低层级中，以给定精度表示对象所需的球体数量几乎减少了一个数量级。
Hierarchical object representations play an important role in performing efficient collision handling. Many different geometric primitives have been used to construct these representations, which allow areas of interaction to be localized quickly. For time-critical algorithms, there are distinct advantages to using hierarchies of spheres, known as sphere-trees, for object representation. This article presents a novel algorithm for the construction of sphere-trees. The algorithm presented approximates objects, both convex and non-convex, with a higher degree of fit than existing algorithms. In the lower levels of the representations, there is almost an order of magnitude decrease in the number of spheres required to represent the objects to a given accuracy.