基于八叉树的隐式曲面与隐式曲面求交

Intersection between Implicit Surfaces Based on Oct-tree

先将隐式曲面进行多边形化 ,两隐式曲面的求交 ,采用八叉树来搜索它们相应的两组多边形面片的交线 .这一方法既避免了解析法对所给定隐式曲面要有特殊要求的局限性 ,又能克服数值法遇到初始点选取和迭代收敛性问题 。

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.