| 基于八叉树的隐式曲面与隐式曲面求交 |
| |
| 引用本文： | 余正生,吴启迪,李启炎.基于八叉树的隐式曲面与隐式曲面求交[J].同济大学学报(自然科学版),2001,29(5):567-570. |
| |
| 作者姓名： | 余正生 吴启迪 李启炎 |
| |
| 作者单位： | 1. 同济大学CAD研究中心,
2. 同济大学CIMS研究中心, |
| |
| 基金项目： | 国家科技部"九五”重大攻关项目(96-A01-02-01) |
| |
| 摘 要： | 先将隐式曲面进行多边形化,两隐式曲面的求交,采用八叉树来搜索它们相应的两组多边形面片的交线,这一方法既避免了解析法对所给定隐式曲面要有特殊的局限性,又有克服数值法遇到初始点选取和迭代收敛性问题,算法准确可靠。
|
| 关 键 词： | 隐式曲面 多边形化 求交 八叉树 |
| 文章编号： | 0253-374(2001)05-0567-04 |
| 修稿时间： | 2000年3月10日 |
Intersection between Implicit Surfaces Based on Oct-tree |
| |
| YU Zheng sheng ,WU Qi di ,LI Qi yan.Intersection between Implicit Surfaces Based on Oct-tree[J].Journal of Tongji University(Natural Science),2001,29(5):567-570. |
| |
| Authors: | YU Zheng sheng WU Qi di LI Qi yan |
| |
| Institution: | YU Zheng sheng 1,WU Qi di 2,LI Qi yan 1 |
| |
| Abstract: | The paper proposes the algorithm for intersection between two implicit surfaces when the surfaces are polygonized.We do appropriate octree partition in 3D space and check whether there are polygons of two implicit surfaces in the octree nodes and the numbers of two polygons in the nodes.Then we trace the intersection curves of the two implicit surfaces using octree.The algorithm presented by the paper doesn't need any special demands for implicit surface like analytic method,and avoids these problems such as the choice of initial value and iterative convergent which take in digital method. |
| |
| Keywords: | implicit surface polygonization intersection octree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
