|
|||||
|
|
| 基于凸包特征的细分曲面求交研究 | |
| 引用本文： | 郑立垠,张丽. 基于凸包特征的细分曲面求交研究[J]. 计算机工程与设计, 2008, 29(1): 102-104,242 |
| 作者姓名： | 郑立垠 张丽 |
| 作者单位： | 中国石油大学(华东)计算机与通信工程学院,山东,东营,257061 |
| 摘 要： | 主要针对具有凸包特征的细分曲面提出了一种有效的求交的方法,该方法适用于任意具有凸包特征的细分曲面中.该方法主要是利用二部图跟踪两个细分曲面中可能相交的面.在应用二部图的基础上,选择半边数据结构,应用轴向包围盒法进行相交检测,使得具有凸包特征的细分曲面的求交得以实现. |
| 关 键 词： | 细分曲面 细分曲面求交 二部图 轴向包围盒法 半边数据结构 |
| 文章编号： | 1000-7024（2008）01-0102-03 |
| 收稿时间： | 2007-01-15 |
| 修稿时间： | 2007-01-15 |
Study of intersections for subdivision surface with convex hull |
|
| ZHENG Li-yin,ZHANG Li. Study of intersections for subdivision surface with convex hull[J]. Computer Engineering and Design, 2008, 29(1): 102-104,242 | |
| Authors: | ZHENG Li-yin ZHANG Li |
| Abstract: | 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. |
| Keywords: | subdivision surfaces subdivision surfaceintersections bipartite graphstructure axis-aligned bounding boxes half edge data structure |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |