Fast-Cutting Algorithm for 3D Surface Model
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

陈 矛,唐泽圣,唐 龙.三维表面模型的快速切割算法.软件学报,1998,9(9):661-664

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:February 28,1998
  • Revised:April 20,1998
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063