口腔修复曲面设计系统关键技术研究与实现
|
摘要
随着三维测量、离散曲面造型、高硬度材料快速加工等方面技术的进步,口腔修复体CAD/CAM医疗装备在近十多年里得到了飞速的发展,正推动着新时期的“牙科技术革命”。本文结合口腔临床医学应用实际,以口腔修复曲面设计技术为研究对象,系统研究了口腔修复曲面设计系统的相关基础理论、方法及关键技术。本文主要研究内容和创新成果如下:
(1)研究了修复体三角网格模型的快速拓扑重建技术,提出了采用顶点一环邻域的拓扑结构对三角网格模型进行快速重建,并对基于Hash和二叉树的冗余点滤除算法进行了分析研究,设计了相关的数据结构,可以快速高效的完成三角网格模型的拓扑重建。
(2)提出基于顶点法矢的等距和基于隐式曲面的等距的两种算法。采用了八叉树空间分块进行数据点采样,以及顶点映射结合原始模型拓扑关系来生成网格化隐式等距曲面,并通过实例分析了两种等距算法的优缺点以及适用范围。
(3)提出了口腔牙齿预备体颈缘线半自动自适应提取算法,口腔医生仅需要利用自己的医学经验在颈缘附近顺序交互拾取有限关键特征点,就可以半自动、可靠地完成颈缘线的准确提取。
(4)研究了修复体三角网格裁剪技术,提出一种新的面向口腔修复设计的颈缘线裁减算法,通过粗裁减-精裁减-边界优化三个步骤,可靠、高效地完成了三角网格曲面裁减过程,并已经在临床开展应用试验,取得了满意的效果。
(5)研究了修复体三角网格孔洞修补和缝合技术,提出了网格孔洞修补与缝合按统一思想处理的算法。该算法对网格模型进行孔洞修补、缝合可以得到与原始网格模型密度相近,且边界光滑连续的投影网格。
(6)针对口腔修复临床工作的实际需要,采用UML技术对口腔修复曲面设计系统进行建模,在此基础上,开发了面向口腔修复曲面设计系统软件原型系统--DentalCAD,并将其应用到临床口腔修复体设计中,验证了系统的实用性和有效性。
With advances in measurement technology, discrete surface modeling and efficient processing technology of high hardness materials, both the software and hardware of the dental CAD/CAM system and equipment have achieved rapid development in the past 20-odd years. The dental CAD/CAM system and equipment are pushing forward a new era of dental restoration. Based on clinical science of stomatology, the research of this dissertation mainly focus on areas of the relevant basic theories, methodologies and key technologies of dental surface design and its extended applications in the dental CAD/CAM.
The main innovative contributions of this dissertation are as follows:
Firstly, to reconstruct the topology relation of the discrete surface model efficiently and completely, this dissertation has designed a new type of data structure used for the discrete surface model based on vertex’one ring neighborhoods. This dissertation has analyzed the performance and efficiency of the redundant points filtering algorithms used in the process of the topology reconstruction based on hash table and RB binary tree data structure comparatively, and has also designed the node structs stored in hash table and RB binary tree respectively. The experimental results show whichever filtering algorithm chosen: the time complexity of the surface reconstruction is less than O(NlogN), where N is the vertices total number of the discrete surface model.
Secondly, this dissertation presents two kinds of surface offsetting method for the discrete surface model based on vertex normal vector and implicit surface respectively. In the process of surface offsetting based implicit surface method, the spatial data block sampling technique using octree data structure, vertices mapping technique based on Newton’iteration method and the original topology relation of the discrete model are used. Which offsetting method is more suitable when offsetting different discrete models is analyzed through lots of experiments.
Thirdly, this dissertation presents a semiautomatic & Adaptive Algorithm for the preparation line extraction. The dentists only need to pick up some limited points in order near the real preparation line of the discrete model interactively, according to their clinical experiences. After that, the system can complete the preparation line extraction automatically.
Fourthly, the trimming technique for discrete models is researched, and presents a newly trimming algorithm specifically for dental restorations. The presented trimming algorithm is composed of three steps including coarse trimming, fair trimming and boundary optimization, and has been applied in clinical trials proved efficiently and achieving satisfactory results.
Fifthly, this paper presents a uniform processing method for triangular mesh’s hole filling and stitching. The mesh patch obtained after hole filling or stitching using the presented method can fit across the boundary (boundaries) smoothly and continuously. the uniform processing method is proved efficiently and robust in many experiments of different kinds of boundary conditions including filling and stitching.
Sixthly, the general model for dental restorations is given using UML according to the practical demands in clinical prosthodontics. Based on that, the dental restoration-oriented modeling software prototype system (DentalCAD system) is developed. Practicability and validity of the system are proved in clinical applications
(1)研究了修复体三角网格模型的快速拓扑重建技术,提出了采用顶点一环邻域的拓扑结构对三角网格模型进行快速重建,并对基于Hash和二叉树的冗余点滤除算法进行了分析研究,设计了相关的数据结构,可以快速高效的完成三角网格模型的拓扑重建。
(2)提出基于顶点法矢的等距和基于隐式曲面的等距的两种算法。采用了八叉树空间分块进行数据点采样,以及顶点映射结合原始模型拓扑关系来生成网格化隐式等距曲面,并通过实例分析了两种等距算法的优缺点以及适用范围。
(3)提出了口腔牙齿预备体颈缘线半自动自适应提取算法,口腔医生仅需要利用自己的医学经验在颈缘附近顺序交互拾取有限关键特征点,就可以半自动、可靠地完成颈缘线的准确提取。
(4)研究了修复体三角网格裁剪技术,提出一种新的面向口腔修复设计的颈缘线裁减算法,通过粗裁减-精裁减-边界优化三个步骤,可靠、高效地完成了三角网格曲面裁减过程,并已经在临床开展应用试验,取得了满意的效果。
(5)研究了修复体三角网格孔洞修补和缝合技术,提出了网格孔洞修补与缝合按统一思想处理的算法。该算法对网格模型进行孔洞修补、缝合可以得到与原始网格模型密度相近,且边界光滑连续的投影网格。
(6)针对口腔修复临床工作的实际需要,采用UML技术对口腔修复曲面设计系统进行建模,在此基础上,开发了面向口腔修复曲面设计系统软件原型系统--DentalCAD,并将其应用到临床口腔修复体设计中,验证了系统的实用性和有效性。
With advances in measurement technology, discrete surface modeling and efficient processing technology of high hardness materials, both the software and hardware of the dental CAD/CAM system and equipment have achieved rapid development in the past 20-odd years. The dental CAD/CAM system and equipment are pushing forward a new era of dental restoration. Based on clinical science of stomatology, the research of this dissertation mainly focus on areas of the relevant basic theories, methodologies and key technologies of dental surface design and its extended applications in the dental CAD/CAM.
The main innovative contributions of this dissertation are as follows:
Firstly, to reconstruct the topology relation of the discrete surface model efficiently and completely, this dissertation has designed a new type of data structure used for the discrete surface model based on vertex’one ring neighborhoods. This dissertation has analyzed the performance and efficiency of the redundant points filtering algorithms used in the process of the topology reconstruction based on hash table and RB binary tree data structure comparatively, and has also designed the node structs stored in hash table and RB binary tree respectively. The experimental results show whichever filtering algorithm chosen: the time complexity of the surface reconstruction is less than O(NlogN), where N is the vertices total number of the discrete surface model.
Secondly, this dissertation presents two kinds of surface offsetting method for the discrete surface model based on vertex normal vector and implicit surface respectively. In the process of surface offsetting based implicit surface method, the spatial data block sampling technique using octree data structure, vertices mapping technique based on Newton’iteration method and the original topology relation of the discrete model are used. Which offsetting method is more suitable when offsetting different discrete models is analyzed through lots of experiments.
Thirdly, this dissertation presents a semiautomatic & Adaptive Algorithm for the preparation line extraction. The dentists only need to pick up some limited points in order near the real preparation line of the discrete model interactively, according to their clinical experiences. After that, the system can complete the preparation line extraction automatically.
Fourthly, the trimming technique for discrete models is researched, and presents a newly trimming algorithm specifically for dental restorations. The presented trimming algorithm is composed of three steps including coarse trimming, fair trimming and boundary optimization, and has been applied in clinical trials proved efficiently and achieving satisfactory results.
Fifthly, this paper presents a uniform processing method for triangular mesh’s hole filling and stitching. The mesh patch obtained after hole filling or stitching using the presented method can fit across the boundary (boundaries) smoothly and continuously. the uniform processing method is proved efficiently and robust in many experiments of different kinds of boundary conditions including filling and stitching.
Sixthly, the general model for dental restorations is given using UML according to the practical demands in clinical prosthodontics. Based on that, the dental restoration-oriented modeling software prototype system (DentalCAD system) is developed. Practicability and validity of the system are proved in clinical applications
引文
[1]马轩祥,赵铱民.口腔修复学第五版[M].北京:人民卫生出版社,2005
[2] Vosniakos G C,Giannakakis T.Reverse engineering of simple surfaces of unknown shape with touch probes:Scanning and compensation issues.Proceedings of the Institution of Mechanical Engineers,2003,217(4):563-568
[3]孙晨光.数字相移相位测量技术及其应用[硕士学位论文].天津大学,2003
[4]郝煜栋,赵洋,李达成.光学投影式三维轮廓测量技术综述.光学技术,1998,5:57-64
[5] Giovanna Sannsoni,Alessandro Patrioli and Franco Docchio.OPL-3DA Novel,portable optical digitizer for fast acquisition of free-form surfaces.Review of Scientific Instruments,2003,74(4):2593-2603
[6] http://www.kavo-everest.com/En/zahntechniker/ids2005/scanpro.asp?navid= 550861&lan=En
[7] http://www.cynovad.com/html/produits/Pro50/pro50.htm
[8] Keferstein C P,Marxer M. Testing bench for laser triangulation sensors,Sens Rev,1998,18(3):183-187
[9] Idesawa M. High-precision image position sensing methods suitable for 3-D measurement,Opt Lasers Eng,1989,10: 3-4
[10] http://www.3shape.com/x_scanners/html/r_3shape_d200.html
[11] The DENTFORM Software. http://www.dcs-dental.com/eng/cadcam.htm
[12]付强,赵云凤,李勇等.两种牙科切削陶瓷材料可切削性的比较[J].中华口腔医学杂志,2002,37(6):438-441
[13]李石保,陈朝辉,王忠义等.牙科可切削陶瓷研究进展.第四军医大学学报[J],2000,21 (Suppl):95-96
[14]李石保,陈朝辉,王忠义等.制备高性能氧化锆陶瓷牙科修复体的初步研究[J]. 2004, 20(3):267-269
[15] Lawson C L. Generation of a triangular grid with application to contourplotting. California Institute of Technology Jet Propulsion Laboratory, TechnicalMemorandum 299,1972
[16] Green P J, Sibson R. Computing Dirichlet tessellations in the plane. The Computer Journal, 1978,21(2): 168-173
[17] Bowyer A. Computing Dirichlet tessellations. The Computer Journal, 1981, 24(2): 162-166
[18] Dey T K, Sugihara K, Bajaj C L. Delaunay triangulations in three dimensions with finite precision arithmetic. Computer Aided Geometric Design,1992,9(5): 457- 470
[19] Hoff K E, Culver T, Keyser J et al. Fast computation of generalized Voronoi Diagrams Using Graphics hardware.In: Cook R ed. Proceeding of SIGGRAPH 99. Danvers:Assison-Wssley Publishing Company, 1992,277-286
[20] H. Edelsbrunner and E. Mucke, 3D Alpha Shapes, ACM Trans. on Graphics, 13(1), pp. 43-- 72 (1994)
[21] C. L. Bajaj Reconstructing Surfaces and Functions on Surfaces from Unorganized Three-Dimensional Data. In Proceedings of the Fourth SIAM Conference on Geometric Design, Nashville, TN, November 1995
[22] C. Bajaj, F. Bernardini, and G. Xu. Automatic Reconstruction of Surfaces and Scalar Fields from3D Scans. SIGGRAPH’95 Proceedings, pages 109–118, July 1995
[23] Nina Amenta and Marshall Bern. Surface reconstruction by Voronoi filtering. To appear in 14th ACM symposium on Computation Geometry, June 1998
[24] Nina Amenta, Marshall Bern and Manolis Kamvysselis. A New Voronoi-Based Surface Reconstruction Algorithm. To appear in SIGGRAPH’98 Proceedings, pages 415-421
[25] Nina Amenta, Sunghee Choi. A simple algorithm for homeomorphic surface reconstruction. Proc. 16th Symp. Computational Geometry, ACM, Jun 2000, pp.213, 222
[26] Tamal K. Dey Detecting Undersampling in Surface Reconstruction. Proc. 17th Ann.Sympos.Comput. Geom., (2001), 257--263
[27] Tamal K. Dey Detecting boundaries for surface reconstruction using co-cones.Proc. ACM Sympos. Solid Modeling and Applications 99 1999, 322-323
[28] Tamal K. Dey Delaunay Based Shape Reconstruction from Large Data. IEEE Symposium in Parallel and Large Data Visualization and Graphics, (2001), 19--27
[29] Nick Roussopoulos Nearest Neighbour Queries , SIGMOD 1995
[30] M. Gopiy Surface Reconstruction based on Lower Dimensional Localized Delaunay Triangulation. Computer Graphics Forum Volume 19, Issue 3 (August 2000)
[31]王青,王融清散乱数据点的增量快速曲面重建算法软件学报, 11(9), 2000:1221-1227
[32] R?ssl C,Kobbelt L,Seidel H-P. Extraction of feature lines on triangulated surfaces using morphological operators [C]. Smart Graphics Proceedings of the 2000 AAAI Symposium,2000:71-75
[33] Guy G,Medioni G. Inference of Surfaces, 3D Curves, and Junctions From Sparse,Noisy,3D Data[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,1997,19(11):1265-1277
[34]刘胜兰,周儒荣,张丽艳.三角网格模型的特征提取[J].计算机辅助设计与图形学学报,2003,15(4):444-453
[35] Yang M,Lee E. Segmentation of measured data using a parametric quadric surface approximation [J]. Computer-Aided Design,1999,31(7):449-457
[36] http://www.chinadentist.com/xiufu/cad-cam/dux.htm
[37] Forsyth M. Shelling and offsetting bodies[C].Proceedings of Third Symposium on Solid Modeling and Applications,Salt Lake City,Utah,USA.1995:373-381
[38] Kim SJ, Lee DY, Yang MY, Offset triangular mesh using the multiple normal vectors of a vertex. CAD’04 conference, Thailand; 2004
[39] T. Sederberg. Piecewise algebraic surface patch, Computer-Aided Geometric Design, 1985, 2(1): 53~59
[40] Bloomenthal J, Bajaj C, Blinn J, Wyvill B, Wyvill G. Introduction to Implicit Surfaces. San Francisco: Morgan Kaufman Publishers, Inc.,1997
[41] G. Turk, J. F. O’Brien. Variational Implicit Surfaces [R]. Technical Report GIT-GVU-99-15, Georgia. Georgia Institute of Technology.1999
[42] V. V. Savchenko, A. A. Pasko, O. G .Okunev,and and T. L.Kunni,“Function representation of solids reconstructed from scattered surface points and contours”[J], Computer Graphics Forum, 1995,14(4):181-188
[43] J. C. Carr, R. K. Beatson, J. B. Cherrie, etal. Reconstruction and Representation of 3D Objects with Radial BasisFunctions[C].Proceedings of the 28th annual conference on Computer graphics and interactive techniques, NewYork. 2001 Pages: 67-76
[44] Ireneusz Tobor, Patrick Reuter, Christophe Schlick. Efficient Reconstruction of Large Scattered Geometric Datasets using the Partition of Unity and Radial Basis Functions[R].Technical report, RR-1301-03, LaBRI, UniversitéBordeaux 1, 2003
[45] D G Jang,H Park,K Kim.Surface offsetting using distance volumes[J].The International Journal of Advanced Manufacturing Technology,2005,26:102-108
[46] H. Hoppe, T.DeRose, T.Duchamp. Surface reconstruction from unorganized points [J]. Computer Graphics(SIGGRAPH’92 Proceedings) .1992,26 (2):71-78
[47] Jules Bloomenthal. Polygonization of Implicit Surfaces [J]. Computer Aided Geometric Design. 1988,5 (4):341-355
[48] Mark Hall, Joe Warren. Adaptive Polygonalization of Implicitly Defined Surfaces [J]. IEEE Computer Graphics and Applications. 1990,10 (6):33-42
[49] G.M.Treece, R.W.Prager, A.H.Gee. Regularised marching tetrahedral: improved iso-surface extraction [J]. Computers and Graphics.1999, 23 (12):583-598
[50] S.L.Chan, E.O.Purisima. A new tetrahedral tesselation scheme for isosurface generation [J]. Computers and Graphics. 1998, 22 (1):83-90
[51] Jin X G, Sun H Q, Peng Q S. Subdivision interpolating implicit surfaces [J].Computers & Graphics, 2003, 27(5): 763-772
[52] Leong K F, Chua C K, Ng Y M. A study of stereolithography files errors and repair. Part 2: special cases [J]. International Journal of Advanced Manufacturing Technology, 1996, 12 (6): 415-422
[53] Pfeifle R, Seidel H P. Triangular B-Splines for Blending and Filling of Polygonal Holes [A]. Proceedings of Graphics Interface[C].Toronto: Canadian Information Processing Society press, 1996: 186-193
[54] Zhang Liyan, Pan Xiaolin, An Luling. A smooth hole filling algorithm for triangle mesh surfaces[J].Journal of Engineering Graphics, 2002,22 (4):113-119
[55] Curless B., and Levoy M.“A volumetric method for building complex models from range images”[C]. In: Processing of SIGGRAPH’96, 1996:303–12
[56] Davis J., Marschner S.R., Garr M., Levoy M.“Filling holes in complex surface using volumetric diffusion”[C]. In: Processing of the first international symposium on 3D data, visualization and transmission; 2002
[57] Nooruddin F.S., and G. Turk“Simplification and repair of polygonal models using volumetric techniques”[J]. IEEE Transactions on Visualization and Computer Graphics, 2003, 9(2):191–205
[58] Verdera J., Caselles V., Bertalmio M., Sapiro G.“Inpainting surface holes”[C]. In: International conference on image processing (ICIP), 2003
[59] Clarenz U., Diewald U., Dziuk G., Rumpf M., and Rusu R.“A finite element method for surface restoration with smooth boundary conditions”[J]. Computer Aided Geometric Design 2004, 21(5):427–45
[60] Liepa P.“Filling holes in meshes”[C]. In: Proceedings of the 2003 eurographics/ACM SIGGRAPH symposium on geometry processing (SGP’03), 2003: 200–5
[61] Barequet G., and Sharir M.“Filling gaps in the boundary of a polyhedron”[J]. Computer Aided Geometric Design 1995, 12(2):207–29
[62] Chun-Yen Chen, Kuo-Young Cheng, and H. Y. Mark Liao.“A Sharpness Dependent Approach to 3D Polygon Mesh Hole Filling”[J]. In: Proceedings of EUROGRAPHICS 2005
[63] Jean-Philippe Pernot, George Moraru, Philippe and Ve′ron.“Filling holes in meshes using a mechanical model to simulate the curvature variation minimization”[J]. Computers & Graphics 2006, 30(6): 892–902
[64] Anderi sharf, Marc Alexa, and Daniel Cohen-Or.“context-based surface completion”[J]. ACM. Transactions on Graphics, 2004, 23(3):878–887
[65] Cerec3D Operator’s Manual. http://www. sirona.com/ecomaXL/index.php?site =SIRONA_COM_cerec
[66] The Procera AllCeram System Introduce. http://www.ddsltdlab.com/procera.htm
[67]张富强,张保卫,张建中.口腔修复基础与临床[M].上海:上海科学技术文献出版社,2003
[68] A study of stereolithography files errors and repair. Part 1: Generic solution[J].International Journal of Advanced Manufacturing Technology, 1996, 12: 407~414
[69] Bruce G.Baumgart.A Polyhedron Representation for Computer Vision[C]. In: National Computer Conference,Anaheim,CA,1975:589-596
[70] Martti M?ntyl?.An Introduction to Solid Modeling [M]. Computer Science Press,Rockville,Maryland,1995
[71] Leonidas Guibas,Jorge Sto?.Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams[J].ACM Transaction on Graphics,1985,4(3):74-123
[72] Bjarne Stroustrup. The C++ Programming Language[M].北京:高等教育出版社,2001.429-579
[73] Matthew H Austern.侯捷.泛型编程与STL[M].北京:中国电力出版色,2003.81-166
[74] http://www.sgi.com/tech/stl/
[75] Jan Hrádek,Martin Kuchaǐ,Václav Skala. Hash functions and triangular mesh reconstruction [J]. Computers & Geosciences,2003,29:741-751
[76]赵歆波,张定华,熊光彩等.基于散列的STL拓扑信息重建方法.机械科学与技术,2002,21(5):827-828,832
[77]崔树标,张宜生,梁书云等. STL面片中冗余顶点的快速滤除算法及其应用.中国机械工程,2001,12(2):173-175
[78]张必强,邢渊,阮雪榆.面向网格简化的STL拓扑信息快速重建算法.上海交通大学学报,2004,38(1):39-42
[79]戴宁,廖文和,陈春美. STL数据快速拓扑重建关键算法.计算机辅助设计与图形学学报,2005,11(17):2447-2452
[80] D G Jang,H Park,K Kim.Surface offsetting using distance volumes[J].The International Journal of Advanced Manufacturing Technology,2005,26:102-108
[81] J Wallner, T Sakkalis, T Maekawa etc. Self-intersections of offset curves and surfaces[J].international J.of Shape Modeling.2001,1:1-22
[82] Elvins TT. A survey of algorithms for volume visualization [J]. Computer Graphics,1992,26 (3):194-201
[83]韩景芸,费仁元,李彦生等.基于逆向工程技术的后牙嵌体的数字化个性设计[J].机械科学与技术,2005,24(3):315-318
[84]王克强,杨钦,陈建治,徐永安.基于逆向工程的口腔修复体CAD研究[J].系统仿真学学报.2001,13增刊:580-581,585
[85] Pal Benko, Ralph R.Martin, Tamas Varady. Algorithms for reverse engineeringboundary representation models [J]. Computer Aided Design, 2001,33:839-851
[86]王洵,许胤龙,陈国良.改进的八叉树数据结构[J].计算机科学.2000,27(6):99-10
[87] J. C. Carr, R. K. Beatson, J. B. Cherrie, etal. Reconstruction and Representation of 3D Objects with Radial BasisFunctions[C].Proceedings of the 28th annual conference on Computer graphics and interactive techniques, NewYork. 2001 Pages: 67-76
[88] Ireneusz Tobor, Patrick Reuter, Christophe Schlick. Efficient Reconstruction of Large Scattered Geometric Datasets using the Partition of Unity and Radial Basis Functions[R].Technical report, RR-1301-03, LaBRI, UniversitéBordeaux 1, 2003
[89] H. Hoppe, T.DeRose, T.Duchamp. Surface reconstruction from unorganized points [J]. Computer Graphics(SIGGRAPH’92 Proceedings) .1992,26 (2):71-78
[90] Jules Bloomenthal. Polygonization of Implicit Surfaces [J]. Computer Aided Geometric Design. 1988,5 (4):341-355
[91] Mark Hall, Joe Warren. Adaptive Polygonalization of Implicitly Defined Surfaces [J]. IEEE Computer Graphics and Applications. 1990,10 (6):33-42
[92] G.M.Treece, R.W.Prager, A.H.Gee. Regularised marching tetrahedral: improved iso-surface extraction [J]. Computers and Graphics.1999, 23 (12):583-598
[93] S.L.Chan, E.O.Purisima. A new tetrahedral tesselation scheme for isosurface generation [J]. Computers and Graphics. 1998, 22 (1):83-90
[94] Jin X G, Sun H Q, Peng Q S. Subdivision interpolating implicit surfaces [J]. Computers & Graphics, 2003, 27(5): 763-772
[95] Wong KC, Sin TY, Heng P. Interactive volume cutting.http://www.dgp.toronto.edu/gi/gi98 /papers/136/136.html
[96]金树人,姚月玲,高勃,王忠义.应用快速成型法制作磨牙树脂全冠[J].第四军医大大学学报,2003,24(8):700-702
[97] Guo Yanwen, Peng Qunsheng,Hu Guofei, ect..Smooth feature line detection for meshes[J]. Joural of Zhejiang University Science, 2005,6A(5):460-468
[98] Volker Ahlers,Paul Weigl,Hartmut Schachtzabel. Combining contour detection algorithms for the automatic extraction of the preparation line from a dental 3D measurement[C], Medical Imaging 2005: Image Processing,2005,Vol.5747:274-282
[99] Yang M,Lee E. Segmentation of measured data using a parametric quadric surface approximation [J]. Computer-Aided Design,1999,31(7):449-457
[100] Moonryul Jung, Haengkang Kim. Snaking across 3D meshes[C].Processings of the 12th Pacific Conference on Computer Graphics and Applications, 2004,87-93
[101] Stephan Bischo, Tobias Weyand, Leif Kobbelt. Snake on triangle meshes,Bildverarbeitung für die Medizin 2005[M],Springer Berlin Heidelberg:208-212
[102] KaVo Everest System. http://www. kavo-everest.com/en/system/1,07,1001,01. asp
[103] Hamann B. Curvature approximation for triangulated surfaces[C]. Geometric Modelling, Springer Verlag, 1993:139-153
[104] Welch W, Witkin A. Free-form shape design using triangulated surfaces[C]. SIGGRAPH 94 Conference Proceedings, Orlando Florida, 1994:247-256
[105]吕培军,邹波等.标准牙冠数据的获取.实用口腔医学杂志, 2002, 18(6): 550-552
[106] Delingette H, Cotin S, Ayache N. A hybrid elastic model allowing real-time cutting, deformations and force-feedback for surgery training and simulation[C]. In Proceeding computer animation 1999, pp70-81
[107] C.Forest, H.Delingette, N.Ayache. Removing tetrahedral form manifold tetrahedralisation: application to realtime surgical simulation. Medical Image Analysis[J],2005,Vol.9(2):113 -122
[108] Nienhuys HW, Frank van der Stappen A. A surgery simulation supporting cuts and finite element deformation[C]. In: Proceedings of MICCAI,2001:145-152
[109] Huynh Quang Huy Viet, Takahiro Kamada, Hiromi T.Tanaka. An algorithm for cutting 3D surface Meshes[C]. The 18th International Conference on Pattern Recognition,2006: 762-765
[110] Cynthia D.Bruyns, Steven Senger. Interactive cutting of 3D surface meshes[J],Computers & Graphics, 2001,25: 635-642
[111] C.D.Bruyns, S.Senger. Interactive cutting of 3d surface meshes[J]. Computers & Graphics,2001,25:635-642
[112] Kup-Sze Choi. Interactive cutting of deformable objects using force propagation approach and digital design analogy [J]. Computers & Graphics, 2006,30:233-243
[113] KaVo Everest System. http://www. kavo-everest.com/en/system/1,07, 1001,01.asp
[114] Yunjin Lee, Seungyong Lee,etc.. Mesh scissoring with minima rule and part salience [J], Computer Aided Geometric Design, 2005, 22(5):444-465
[115] Nienhuys HW, Frank van der Stappen A. A Delaunay approach to interactive cutting in triangulated surfaces[C], In: Proc. of the 5th Int’l. Workshop Algorithmic Foundations of Robotics (WAFR 2002). Springer-Verlag, 2002. 113–130
[116] Duchon J.“Spline minimizing rotation-invariant semi-norms in Sobolev spaces”[M]. In Constructive Theory of Functions of Several Variables, Schempp W.,Zeller K., (Eds.), no. 571 in Lecture Notes in Mathematics.Springer Verlag, 1977:85–100
[117] G. Turk, and James F.O’Brien.“Modelling with implicit surfaces that interpolate”[J]. ACM Transactions on Graphics, 2002,21(4):855–873
[118] Reuter P., Tobor I., Schlick C., and Dedieu S.“Point-based modelling and rendering using radial basis functions”[C]. In :Proceedings of GRAPHITE’03 , 2003: 111–118
[119] Kojekine N., Savchenko V., et al.“Real-time 3D deformations by means of compactly supported radial basis functions”[C].In: Short paper proceedings of Eurographics`02, Sarrbrucken, Germany,. 2002.9:35-43
[120] Mario Botsch ,and Leif Kobbelt,“Real-Time Shape Editing using Radial Basis Functions”[J], Computer Graphics Forum, 2005,24(3) : 611 - 621
[121] Carr J., Fright W., and Beatson R.“Surface interpolation with radial basis functions for medical imaging”[J]. IEEE Transactions on Medical Imaging, 1997, 16(1): 96-107
[122] Bohn J. H., and Wozny M. J.“Automatic CAD-model repair: Shell-closure”[C]. In: proceedings of symposium on Solid Freeform Fabrication ,University of Texas,Austin,1992:86-94
[123] M?kel? I., and Dolenc A.“Some efficient procedures for correcting triangulated models”[C]. In: proceedings of symposium on Solid Freeform Fabrication ,University of Texas, Austin, 1993: 86-94
[124]吕培军,李彦生,王勇等.国产口腔修复CAD-CAM系统的研究与开发[J].中华口腔医学杂志,2002,37(5):367-371
[125]《计算几何导论》(美)F.P普雷帕拉塔M.I.沙莫斯科学出版社1990庄心谷译P250-258
[126] JLawson C L Generation of a triangular grid with application to contour plotting. California Institute of Technology Jet Propulsion Laboratory, Technical Memorandum 299,1972
[127] Sibson R. Locally equiangular triangulations. The ComputerJourna1,21(3): 243-245
[128] Green P J, Sibson R. Computing Dirichlet tessellations in the plane. The Computer Journal,1978,21(2): 168-173
[129] Bowyer A. Computing Dirichlet tessellations. The Computer Journal, 1981,24(2): 162-166
[130] Watson D.F Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes. The ComputerJournal 1981,24(2): 167-172
[131] C. Lawson. Generation a triangular grid with application of contour plotting. Technical Memo. 299. Jet Propulation Laboratory, Pasadena, California. 1972
[132] P. Green and R. Silbson. Computing Dirichlet tesellation in the plane. The Jounal. 1978, 2(2): 168-173
[133] R. Silbson. Locally equiangular timagulations. The Computer Journal. 1978 21(3): 243-245
[134] A. Bowyer. Computing Dirichlet tessellations. The Computer Journal. 1981,24(2): 162-166
[135] D. Watson. Computing the n-dimensional Delaunay tessellation with application to Vornoi poltopes. The Computer Journal. 1981,24(2): 167-172
[136] M. Yerry and M. Shephard. A Modified quadtree aproach to finite element meshes generation. IEEE Computer Graphics&Applications. 1983, 2 :39-46
[137] M. Yerry and M. Shephard. Automatic three-dimensional mesh generation by the modified-octree technique. International Jounal of Numerical Methods in Enginering. 1984, 20: 1965-1990
[138] Y. Jung and K. Lee. Tetrahedron-based octree endoding for automatic mesh generation. Computer Aided Design. 1993, 25(3): 141-153
[139] T. Fang and L. Piegl. Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix. Computer Aided Design. 1989, 21(4): 248-253
[140] T. Fang and L. Piegl. Delaunay Triangulation in Thee Dimensions. IEEE mputer Graphics & Applications. 1995, 9: 62-69
[141] S.Lo. A new mesh generation scheme for arbitrary donains. International Journal of Numerical Methods in Engineering. 1985, 21 1403-1426
[142] B. Joe.Construction of three-dimensional Delaunay triangulations using local transformations. Computer Aided Geometric Design, 1991,8: 123-142
[143] B. Choi, Y Shin etc. Triangulation of scattered data in 3D space. Computer-Aided Desing. 1988, 20(5): 239-248
[144] C. Hazlewood. Approximating constrained tetrahedrizations. Computer-Aided Geometric Design. 1993, 10: 67-87
[145] G. Subramanian, V Raveendra and M. Kamath. Robust boundary triangulation and Delaunay triangulation of arbitrary planar Domains. International Journal of Numerical Methods in Engineering. 1994, 37: 1779-1789
[2] Vosniakos G C,Giannakakis T.Reverse engineering of simple surfaces of unknown shape with touch probes:Scanning and compensation issues.Proceedings of the Institution of Mechanical Engineers,2003,217(4):563-568
[3]孙晨光.数字相移相位测量技术及其应用[硕士学位论文].天津大学,2003
[4]郝煜栋,赵洋,李达成.光学投影式三维轮廓测量技术综述.光学技术,1998,5:57-64
[5] Giovanna Sannsoni,Alessandro Patrioli and Franco Docchio.OPL-3DA Novel,portable optical digitizer for fast acquisition of free-form surfaces.Review of Scientific Instruments,2003,74(4):2593-2603
[6] http://www.kavo-everest.com/En/zahntechniker/ids2005/scanpro.asp?navid= 550861&lan=En
[7] http://www.cynovad.com/html/produits/Pro50/pro50.htm
[8] Keferstein C P,Marxer M. Testing bench for laser triangulation sensors,Sens Rev,1998,18(3):183-187
[9] Idesawa M. High-precision image position sensing methods suitable for 3-D measurement,Opt Lasers Eng,1989,10: 3-4
[10] http://www.3shape.com/x_scanners/html/r_3shape_d200.html
[11] The DENTFORM Software. http://www.dcs-dental.com/eng/cadcam.htm
[12]付强,赵云凤,李勇等.两种牙科切削陶瓷材料可切削性的比较[J].中华口腔医学杂志,2002,37(6):438-441
[13]李石保,陈朝辉,王忠义等.牙科可切削陶瓷研究进展.第四军医大学学报[J],2000,21 (Suppl):95-96
[14]李石保,陈朝辉,王忠义等.制备高性能氧化锆陶瓷牙科修复体的初步研究[J]. 2004, 20(3):267-269
[15] Lawson C L. Generation of a triangular grid with application to contourplotting. California Institute of Technology Jet Propulsion Laboratory, TechnicalMemorandum 299,1972
[16] Green P J, Sibson R. Computing Dirichlet tessellations in the plane. The Computer Journal, 1978,21(2): 168-173
[17] Bowyer A. Computing Dirichlet tessellations. The Computer Journal, 1981, 24(2): 162-166
[18] Dey T K, Sugihara K, Bajaj C L. Delaunay triangulations in three dimensions with finite precision arithmetic. Computer Aided Geometric Design,1992,9(5): 457- 470
[19] Hoff K E, Culver T, Keyser J et al. Fast computation of generalized Voronoi Diagrams Using Graphics hardware.In: Cook R ed. Proceeding of SIGGRAPH 99. Danvers:Assison-Wssley Publishing Company, 1992,277-286
[20] H. Edelsbrunner and E. Mucke, 3D Alpha Shapes, ACM Trans. on Graphics, 13(1), pp. 43-- 72 (1994)
[21] C. L. Bajaj Reconstructing Surfaces and Functions on Surfaces from Unorganized Three-Dimensional Data. In Proceedings of the Fourth SIAM Conference on Geometric Design, Nashville, TN, November 1995
[22] C. Bajaj, F. Bernardini, and G. Xu. Automatic Reconstruction of Surfaces and Scalar Fields from3D Scans. SIGGRAPH’95 Proceedings, pages 109–118, July 1995
[23] Nina Amenta and Marshall Bern. Surface reconstruction by Voronoi filtering. To appear in 14th ACM symposium on Computation Geometry, June 1998
[24] Nina Amenta, Marshall Bern and Manolis Kamvysselis. A New Voronoi-Based Surface Reconstruction Algorithm. To appear in SIGGRAPH’98 Proceedings, pages 415-421
[25] Nina Amenta, Sunghee Choi. A simple algorithm for homeomorphic surface reconstruction. Proc. 16th Symp. Computational Geometry, ACM, Jun 2000, pp.213, 222
[26] Tamal K. Dey Detecting Undersampling in Surface Reconstruction. Proc. 17th Ann.Sympos.Comput. Geom., (2001), 257--263
[27] Tamal K. Dey Detecting boundaries for surface reconstruction using co-cones.Proc. ACM Sympos. Solid Modeling and Applications 99 1999, 322-323
[28] Tamal K. Dey Delaunay Based Shape Reconstruction from Large Data. IEEE Symposium in Parallel and Large Data Visualization and Graphics, (2001), 19--27
[29] Nick Roussopoulos Nearest Neighbour Queries , SIGMOD 1995
[30] M. Gopiy Surface Reconstruction based on Lower Dimensional Localized Delaunay Triangulation. Computer Graphics Forum Volume 19, Issue 3 (August 2000)
[31]王青,王融清散乱数据点的增量快速曲面重建算法软件学报, 11(9), 2000:1221-1227
[32] R?ssl C,Kobbelt L,Seidel H-P. Extraction of feature lines on triangulated surfaces using morphological operators [C]. Smart Graphics Proceedings of the 2000 AAAI Symposium,2000:71-75
[33] Guy G,Medioni G. Inference of Surfaces, 3D Curves, and Junctions From Sparse,Noisy,3D Data[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,1997,19(11):1265-1277
[34]刘胜兰,周儒荣,张丽艳.三角网格模型的特征提取[J].计算机辅助设计与图形学学报,2003,15(4):444-453
[35] Yang M,Lee E. Segmentation of measured data using a parametric quadric surface approximation [J]. Computer-Aided Design,1999,31(7):449-457
[36] http://www.chinadentist.com/xiufu/cad-cam/dux.htm
[37] Forsyth M. Shelling and offsetting bodies[C].Proceedings of Third Symposium on Solid Modeling and Applications,Salt Lake City,Utah,USA.1995:373-381
[38] Kim SJ, Lee DY, Yang MY, Offset triangular mesh using the multiple normal vectors of a vertex. CAD’04 conference, Thailand; 2004
[39] T. Sederberg. Piecewise algebraic surface patch, Computer-Aided Geometric Design, 1985, 2(1): 53~59
[40] Bloomenthal J, Bajaj C, Blinn J, Wyvill B, Wyvill G. Introduction to Implicit Surfaces. San Francisco: Morgan Kaufman Publishers, Inc.,1997
[41] G. Turk, J. F. O’Brien. Variational Implicit Surfaces [R]. Technical Report GIT-GVU-99-15, Georgia. Georgia Institute of Technology.1999
[42] V. V. Savchenko, A. A. Pasko, O. G .Okunev,and and T. L.Kunni,“Function representation of solids reconstructed from scattered surface points and contours”[J], Computer Graphics Forum, 1995,14(4):181-188
[43] J. C. Carr, R. K. Beatson, J. B. Cherrie, etal. Reconstruction and Representation of 3D Objects with Radial BasisFunctions[C].Proceedings of the 28th annual conference on Computer graphics and interactive techniques, NewYork. 2001 Pages: 67-76
[44] Ireneusz Tobor, Patrick Reuter, Christophe Schlick. Efficient Reconstruction of Large Scattered Geometric Datasets using the Partition of Unity and Radial Basis Functions[R].Technical report, RR-1301-03, LaBRI, UniversitéBordeaux 1, 2003
[45] D G Jang,H Park,K Kim.Surface offsetting using distance volumes[J].The International Journal of Advanced Manufacturing Technology,2005,26:102-108
[46] H. Hoppe, T.DeRose, T.Duchamp. Surface reconstruction from unorganized points [J]. Computer Graphics(SIGGRAPH’92 Proceedings) .1992,26 (2):71-78
[47] Jules Bloomenthal. Polygonization of Implicit Surfaces [J]. Computer Aided Geometric Design. 1988,5 (4):341-355
[48] Mark Hall, Joe Warren. Adaptive Polygonalization of Implicitly Defined Surfaces [J]. IEEE Computer Graphics and Applications. 1990,10 (6):33-42
[49] G.M.Treece, R.W.Prager, A.H.Gee. Regularised marching tetrahedral: improved iso-surface extraction [J]. Computers and Graphics.1999, 23 (12):583-598
[50] S.L.Chan, E.O.Purisima. A new tetrahedral tesselation scheme for isosurface generation [J]. Computers and Graphics. 1998, 22 (1):83-90
[51] Jin X G, Sun H Q, Peng Q S. Subdivision interpolating implicit surfaces [J].Computers & Graphics, 2003, 27(5): 763-772
[52] Leong K F, Chua C K, Ng Y M. A study of stereolithography files errors and repair. Part 2: special cases [J]. International Journal of Advanced Manufacturing Technology, 1996, 12 (6): 415-422
[53] Pfeifle R, Seidel H P. Triangular B-Splines for Blending and Filling of Polygonal Holes [A]. Proceedings of Graphics Interface[C].Toronto: Canadian Information Processing Society press, 1996: 186-193
[54] Zhang Liyan, Pan Xiaolin, An Luling. A smooth hole filling algorithm for triangle mesh surfaces[J].Journal of Engineering Graphics, 2002,22 (4):113-119
[55] Curless B., and Levoy M.“A volumetric method for building complex models from range images”[C]. In: Processing of SIGGRAPH’96, 1996:303–12
[56] Davis J., Marschner S.R., Garr M., Levoy M.“Filling holes in complex surface using volumetric diffusion”[C]. In: Processing of the first international symposium on 3D data, visualization and transmission; 2002
[57] Nooruddin F.S., and G. Turk“Simplification and repair of polygonal models using volumetric techniques”[J]. IEEE Transactions on Visualization and Computer Graphics, 2003, 9(2):191–205
[58] Verdera J., Caselles V., Bertalmio M., Sapiro G.“Inpainting surface holes”[C]. In: International conference on image processing (ICIP), 2003
[59] Clarenz U., Diewald U., Dziuk G., Rumpf M., and Rusu R.“A finite element method for surface restoration with smooth boundary conditions”[J]. Computer Aided Geometric Design 2004, 21(5):427–45
[60] Liepa P.“Filling holes in meshes”[C]. In: Proceedings of the 2003 eurographics/ACM SIGGRAPH symposium on geometry processing (SGP’03), 2003: 200–5
[61] Barequet G., and Sharir M.“Filling gaps in the boundary of a polyhedron”[J]. Computer Aided Geometric Design 1995, 12(2):207–29
[62] Chun-Yen Chen, Kuo-Young Cheng, and H. Y. Mark Liao.“A Sharpness Dependent Approach to 3D Polygon Mesh Hole Filling”[J]. In: Proceedings of EUROGRAPHICS 2005
[63] Jean-Philippe Pernot, George Moraru, Philippe and Ve′ron.“Filling holes in meshes using a mechanical model to simulate the curvature variation minimization”[J]. Computers & Graphics 2006, 30(6): 892–902
[64] Anderi sharf, Marc Alexa, and Daniel Cohen-Or.“context-based surface completion”[J]. ACM. Transactions on Graphics, 2004, 23(3):878–887
[65] Cerec3D Operator’s Manual. http://www. sirona.com/ecomaXL/index.php?site =SIRONA_COM_cerec
[66] The Procera AllCeram System Introduce. http://www.ddsltdlab.com/procera.htm
[67]张富强,张保卫,张建中.口腔修复基础与临床[M].上海:上海科学技术文献出版社,2003
[68] A study of stereolithography files errors and repair. Part 1: Generic solution[J].International Journal of Advanced Manufacturing Technology, 1996, 12: 407~414
[69] Bruce G.Baumgart.A Polyhedron Representation for Computer Vision[C]. In: National Computer Conference,Anaheim,CA,1975:589-596
[70] Martti M?ntyl?.An Introduction to Solid Modeling [M]. Computer Science Press,Rockville,Maryland,1995
[71] Leonidas Guibas,Jorge Sto?.Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams[J].ACM Transaction on Graphics,1985,4(3):74-123
[72] Bjarne Stroustrup. The C++ Programming Language[M].北京:高等教育出版社,2001.429-579
[73] Matthew H Austern.侯捷.泛型编程与STL[M].北京:中国电力出版色,2003.81-166
[74] http://www.sgi.com/tech/stl/
[75] Jan Hrádek,Martin Kuchaǐ,Václav Skala. Hash functions and triangular mesh reconstruction [J]. Computers & Geosciences,2003,29:741-751
[76]赵歆波,张定华,熊光彩等.基于散列的STL拓扑信息重建方法.机械科学与技术,2002,21(5):827-828,832
[77]崔树标,张宜生,梁书云等. STL面片中冗余顶点的快速滤除算法及其应用.中国机械工程,2001,12(2):173-175
[78]张必强,邢渊,阮雪榆.面向网格简化的STL拓扑信息快速重建算法.上海交通大学学报,2004,38(1):39-42
[79]戴宁,廖文和,陈春美. STL数据快速拓扑重建关键算法.计算机辅助设计与图形学学报,2005,11(17):2447-2452
[80] D G Jang,H Park,K Kim.Surface offsetting using distance volumes[J].The International Journal of Advanced Manufacturing Technology,2005,26:102-108
[81] J Wallner, T Sakkalis, T Maekawa etc. Self-intersections of offset curves and surfaces[J].international J.of Shape Modeling.2001,1:1-22
[82] Elvins TT. A survey of algorithms for volume visualization [J]. Computer Graphics,1992,26 (3):194-201
[83]韩景芸,费仁元,李彦生等.基于逆向工程技术的后牙嵌体的数字化个性设计[J].机械科学与技术,2005,24(3):315-318
[84]王克强,杨钦,陈建治,徐永安.基于逆向工程的口腔修复体CAD研究[J].系统仿真学学报.2001,13增刊:580-581,585
[85] Pal Benko, Ralph R.Martin, Tamas Varady. Algorithms for reverse engineeringboundary representation models [J]. Computer Aided Design, 2001,33:839-851
[86]王洵,许胤龙,陈国良.改进的八叉树数据结构[J].计算机科学.2000,27(6):99-10
[87] J. C. Carr, R. K. Beatson, J. B. Cherrie, etal. Reconstruction and Representation of 3D Objects with Radial BasisFunctions[C].Proceedings of the 28th annual conference on Computer graphics and interactive techniques, NewYork. 2001 Pages: 67-76
[88] Ireneusz Tobor, Patrick Reuter, Christophe Schlick. Efficient Reconstruction of Large Scattered Geometric Datasets using the Partition of Unity and Radial Basis Functions[R].Technical report, RR-1301-03, LaBRI, UniversitéBordeaux 1, 2003
[89] H. Hoppe, T.DeRose, T.Duchamp. Surface reconstruction from unorganized points [J]. Computer Graphics(SIGGRAPH’92 Proceedings) .1992,26 (2):71-78
[90] Jules Bloomenthal. Polygonization of Implicit Surfaces [J]. Computer Aided Geometric Design. 1988,5 (4):341-355
[91] Mark Hall, Joe Warren. Adaptive Polygonalization of Implicitly Defined Surfaces [J]. IEEE Computer Graphics and Applications. 1990,10 (6):33-42
[92] G.M.Treece, R.W.Prager, A.H.Gee. Regularised marching tetrahedral: improved iso-surface extraction [J]. Computers and Graphics.1999, 23 (12):583-598
[93] S.L.Chan, E.O.Purisima. A new tetrahedral tesselation scheme for isosurface generation [J]. Computers and Graphics. 1998, 22 (1):83-90
[94] Jin X G, Sun H Q, Peng Q S. Subdivision interpolating implicit surfaces [J]. Computers & Graphics, 2003, 27(5): 763-772
[95] Wong KC, Sin TY, Heng P. Interactive volume cutting.http://www.dgp.toronto.edu/gi/gi98 /papers/136/136.html
[96]金树人,姚月玲,高勃,王忠义.应用快速成型法制作磨牙树脂全冠[J].第四军医大大学学报,2003,24(8):700-702
[97] Guo Yanwen, Peng Qunsheng,Hu Guofei, ect..Smooth feature line detection for meshes[J]. Joural of Zhejiang University Science, 2005,6A(5):460-468
[98] Volker Ahlers,Paul Weigl,Hartmut Schachtzabel. Combining contour detection algorithms for the automatic extraction of the preparation line from a dental 3D measurement[C], Medical Imaging 2005: Image Processing,2005,Vol.5747:274-282
[99] Yang M,Lee E. Segmentation of measured data using a parametric quadric surface approximation [J]. Computer-Aided Design,1999,31(7):449-457
[100] Moonryul Jung, Haengkang Kim. Snaking across 3D meshes[C].Processings of the 12th Pacific Conference on Computer Graphics and Applications, 2004,87-93
[101] Stephan Bischo, Tobias Weyand, Leif Kobbelt. Snake on triangle meshes,Bildverarbeitung für die Medizin 2005[M],Springer Berlin Heidelberg:208-212
[102] KaVo Everest System. http://www. kavo-everest.com/en/system/1,07,1001,01. asp
[103] Hamann B. Curvature approximation for triangulated surfaces[C]. Geometric Modelling, Springer Verlag, 1993:139-153
[104] Welch W, Witkin A. Free-form shape design using triangulated surfaces[C]. SIGGRAPH 94 Conference Proceedings, Orlando Florida, 1994:247-256
[105]吕培军,邹波等.标准牙冠数据的获取.实用口腔医学杂志, 2002, 18(6): 550-552
[106] Delingette H, Cotin S, Ayache N. A hybrid elastic model allowing real-time cutting, deformations and force-feedback for surgery training and simulation[C]. In Proceeding computer animation 1999, pp70-81
[107] C.Forest, H.Delingette, N.Ayache. Removing tetrahedral form manifold tetrahedralisation: application to realtime surgical simulation. Medical Image Analysis[J],2005,Vol.9(2):113 -122
[108] Nienhuys HW, Frank van der Stappen A. A surgery simulation supporting cuts and finite element deformation[C]. In: Proceedings of MICCAI,2001:145-152
[109] Huynh Quang Huy Viet, Takahiro Kamada, Hiromi T.Tanaka. An algorithm for cutting 3D surface Meshes[C]. The 18th International Conference on Pattern Recognition,2006: 762-765
[110] Cynthia D.Bruyns, Steven Senger. Interactive cutting of 3D surface meshes[J],Computers & Graphics, 2001,25: 635-642
[111] C.D.Bruyns, S.Senger. Interactive cutting of 3d surface meshes[J]. Computers & Graphics,2001,25:635-642
[112] Kup-Sze Choi. Interactive cutting of deformable objects using force propagation approach and digital design analogy [J]. Computers & Graphics, 2006,30:233-243
[113] KaVo Everest System. http://www. kavo-everest.com/en/system/1,07, 1001,01.asp
[114] Yunjin Lee, Seungyong Lee,etc.. Mesh scissoring with minima rule and part salience [J], Computer Aided Geometric Design, 2005, 22(5):444-465
[115] Nienhuys HW, Frank van der Stappen A. A Delaunay approach to interactive cutting in triangulated surfaces[C], In: Proc. of the 5th Int’l. Workshop Algorithmic Foundations of Robotics (WAFR 2002). Springer-Verlag, 2002. 113–130
[116] Duchon J.“Spline minimizing rotation-invariant semi-norms in Sobolev spaces”[M]. In Constructive Theory of Functions of Several Variables, Schempp W.,Zeller K., (Eds.), no. 571 in Lecture Notes in Mathematics.Springer Verlag, 1977:85–100
[117] G. Turk, and James F.O’Brien.“Modelling with implicit surfaces that interpolate”[J]. ACM Transactions on Graphics, 2002,21(4):855–873
[118] Reuter P., Tobor I., Schlick C., and Dedieu S.“Point-based modelling and rendering using radial basis functions”[C]. In :Proceedings of GRAPHITE’03 , 2003: 111–118
[119] Kojekine N., Savchenko V., et al.“Real-time 3D deformations by means of compactly supported radial basis functions”[C].In: Short paper proceedings of Eurographics`02, Sarrbrucken, Germany,. 2002.9:35-43
[120] Mario Botsch ,and Leif Kobbelt,“Real-Time Shape Editing using Radial Basis Functions”[J], Computer Graphics Forum, 2005,24(3) : 611 - 621
[121] Carr J., Fright W., and Beatson R.“Surface interpolation with radial basis functions for medical imaging”[J]. IEEE Transactions on Medical Imaging, 1997, 16(1): 96-107
[122] Bohn J. H., and Wozny M. J.“Automatic CAD-model repair: Shell-closure”[C]. In: proceedings of symposium on Solid Freeform Fabrication ,University of Texas,Austin,1992:86-94
[123] M?kel? I., and Dolenc A.“Some efficient procedures for correcting triangulated models”[C]. In: proceedings of symposium on Solid Freeform Fabrication ,University of Texas, Austin, 1993: 86-94
[124]吕培军,李彦生,王勇等.国产口腔修复CAD-CAM系统的研究与开发[J].中华口腔医学杂志,2002,37(5):367-371
[125]《计算几何导论》(美)F.P普雷帕拉塔M.I.沙莫斯科学出版社1990庄心谷译P250-258
[126] JLawson C L Generation of a triangular grid with application to contour plotting. California Institute of Technology Jet Propulsion Laboratory, Technical Memorandum 299,1972
[127] Sibson R. Locally equiangular triangulations. The ComputerJourna1,21(3): 243-245
[128] Green P J, Sibson R. Computing Dirichlet tessellations in the plane. The Computer Journal,1978,21(2): 168-173
[129] Bowyer A. Computing Dirichlet tessellations. The Computer Journal, 1981,24(2): 162-166
[130] Watson D.F Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes. The ComputerJournal 1981,24(2): 167-172
[131] C. Lawson. Generation a triangular grid with application of contour plotting. Technical Memo. 299. Jet Propulation Laboratory, Pasadena, California. 1972
[132] P. Green and R. Silbson. Computing Dirichlet tesellation in the plane. The Jounal. 1978, 2(2): 168-173
[133] R. Silbson. Locally equiangular timagulations. The Computer Journal. 1978 21(3): 243-245
[134] A. Bowyer. Computing Dirichlet tessellations. The Computer Journal. 1981,24(2): 162-166
[135] D. Watson. Computing the n-dimensional Delaunay tessellation with application to Vornoi poltopes. The Computer Journal. 1981,24(2): 167-172
[136] M. Yerry and M. Shephard. A Modified quadtree aproach to finite element meshes generation. IEEE Computer Graphics&Applications. 1983, 2 :39-46
[137] M. Yerry and M. Shephard. Automatic three-dimensional mesh generation by the modified-octree technique. International Jounal of Numerical Methods in Enginering. 1984, 20: 1965-1990
[138] Y. Jung and K. Lee. Tetrahedron-based octree endoding for automatic mesh generation. Computer Aided Design. 1993, 25(3): 141-153
[139] T. Fang and L. Piegl. Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix. Computer Aided Design. 1989, 21(4): 248-253
[140] T. Fang and L. Piegl. Delaunay Triangulation in Thee Dimensions. IEEE mputer Graphics & Applications. 1995, 9: 62-69
[141] S.Lo. A new mesh generation scheme for arbitrary donains. International Journal of Numerical Methods in Engineering. 1985, 21 1403-1426
[142] B. Joe.Construction of three-dimensional Delaunay triangulations using local transformations. Computer Aided Geometric Design, 1991,8: 123-142
[143] B. Choi, Y Shin etc. Triangulation of scattered data in 3D space. Computer-Aided Desing. 1988, 20(5): 239-248
[144] C. Hazlewood. Approximating constrained tetrahedrizations. Computer-Aided Geometric Design. 1993, 10: 67-87
[145] G. Subramanian, V Raveendra and M. Kamath. Robust boundary triangulation and Delaunay triangulation of arbitrary planar Domains. International Journal of Numerical Methods in Engineering. 1994, 37: 1779-1789