摘要
主要针对三角网格的细分曲面求交提出了一种有效的交线计算的方法,该方法适用于任意三角网格的细分曲面中。在利用AABB和二部图进行初始控制网格相交性检测后,利用该方法快速有效地求出细分曲面的交线。
It shows how to lead to a method for efficiently computing intersections at high resolutions.Consequently,the method can be used with any subdivision scheme based on triangular mesh.After based on the bipartite graph structure and axis-aligned bounding boxes（AABB） surface intersections tests are implemented,intersection is successfully computed by using this mothod.
出处
《微计算机应用》
2008年第1期78-81,共4页
Microcomputer Applications
关键词
三角网格
细分曲面
细分曲面求交
交线
triangular mesh,subdivision surfaces,subdivision surface intersections,bipartite graph structure,half edge data structure
