| 摘要: |
| 讨论了一个三维表面模型的快速切割算法.由改进的MC(marching cubes)方法抽取、构成了连续曲面的分组信息以及构成曲面的三角面片的层次包围盒信息，并利用记录了上述信息的B+树模型,完成了三维表面模型的快速切割算法.讨论的算法通过充分发掘和利用MC算法中所隐含的三角面片的包围盒信息和物体各部分间的三维相关信息，在对三维表面模型进行切割计算时,可以快速定位交点，并且根据交点信息，不必遍历模型的所有三角面片，而直接完成对整个被切割模型的分割.研究背景是髋关节整型手术中平面手术刀及球面手术刀对髋关节的切 |
| 关键词: 三维表面模型，层次包围盒，三维相关性，快速切割，B+树. |
| DOI： |
| 分类号: |
| 基金项目:本文研究得到国家863高科技项目基金资助. |
|
| Fast-Cutting Algorithm for 3D Surface Model |
|
CHEN Mao,TANG Ze-sheng,TANG Long
|
| Abstract: |
| In this paper, the authors discuss the algorithms for fast-cutting on 3D surface model. Using a 3D reconstruction algorithm based on MC(marching cubes) method, information about grouping and hierarchical bounding boxes are extracted in the generation of 3D surface model. With a B+ tree data structure recording all information, cutting on 3D surface model can be accomplished without tracking all triangular patches. The key point of the algorithms lies in sufficiently employing the information according bounding boxes and 3D (three-dimensional) coherence inherent in MC. It provides a way to fast locate the intersection points and accomplish dividing. The result of this paper can be applied to simulate cutting operation using plane and sphere knife in coxae orthopedics. |
| Key words: 3D surface model, hierarchical bounding boxes, 3D coherence, fast cutting, B+ tree. |
