Constructive Solid Geometry for Triangulated Polyhedra
Constructive Solid Geometry for Triangulated Polyhedra
复制标题
三角多面体的构造立体几何
DOI：
--
复制
发表时间：
1990
期刊：
影响因子：
--
通讯作者：
Philip M. Hubbard
中科院分区：
文献类型：
--
作者：
Philip M. Hubbard
对于许多图形操作，三角化多面体比任意多面体更容易处理。然而，如果模型涉及三角化的多面体图元，则计算构造性实体几何（CSG）模型的边界表示的算法可能执行得很差。提出了一种新的CSG算法，专门针对三角形图元。该算法的主要特点是它的整体处理多面体之间的交叉和避免光线投射分类时，对另一个多面体。新的算法被证明比一个已发布的算法执行得更好，并提出参数，建议在交互式建模环境的上下文中的几个其他的好处。关键词：构造立体几何，布尔集合运算，实体造型，多面体，三角剖分。
Triangulated polyhedra are simpler to process than arbitrary polyhedra for many graphics operations. Algorithms that compute the boundary representation of a constructive solid geometry (CSG) model, however, may perform poorly if the model involves triangulated polyhedral primitives. A new CSG algorithm specifically tailored to triangulated primitives is presented. The key features of this algorithm are its global processing of intersections between polyhedra and its avoidance of ray-casting when classifying polyhedra against one another. The new algorithm is shown to perform substantially better than one published algorithm, and arguments are presented suggesting its benefits over several others in the context of an interactive modeling environment. Keywords: constructive solid geometry, Boolean set operations, solid modeling, polyhedra, triangulation.