摘要
主要针对具有凸包特征的细分曲面提出了一种有效的求交的方法,该方法适用于任意具有凸包特征的细分曲面中。该方法主要是利用二部图跟踪两个细分曲面中可能相交的面。在应用二部图的基础上,选择半边数据结构,应用轴向包围盒法进行相交检测,使得具有凸包特征的细分曲面的求交得以实现。
A efficient intersection method is presented to subdivide surfaces with convex hull. Consequently, the method can be used with any subdivision scheme that has the strong convex hull property. In this method, a bipartite graph structure is used to track potentially intersecting faces. Based on the bipartite graph structure, the convex hull property of subdivision surface intersections are successfully implemented by using axis-aligned bounding boxes and selecting half edge data structure.
出处
《计算机工程与设计》
CSCD
北大核心
2008年第1期102-104,242,共4页
Computer Engineering and Design
关键词
细分曲面
细分曲面求交
二部图
轴向包围盒法
半边数据结构
subdivision surfaces
subdivision surfaceintersections
bipartite graphstructure
axis-aligned bounding boxes
half edge data structure
