[1]Shewchuk J R. What Is a Good Linear Element? Interpolation, Conditioning, and Quality Measures[C]//Proc. of the 11th International Meshing Roundtable. New York, USA: [s. n.], 2002: 115-126. [2]Krizek M. On the Maximum Angle Condition for Linear Tetrahedral Elements[J]. SIAM Journal on Numerical Analysis, 1992, 29(2): 513-520. [3]Joe B. Construction of Three-dimensional Improved——Quality Triangulations Using Local Transformations[J]. SIAM Journal on Scientific Computing, 1995, 16(6): 1292-1307. [4]Edelsbrunner H, Guoy D. An Experimental Study of Sliver Exudation[J]. Engineering with Computers, 2002, 18(3): 229-240. [5]Freitag L, Ollivier-Gooch C. Tetrahedral Mesh Improvement Using Swapping and Smoothing[J]. International Journal for Numerical Methods in Engineering, 1997, 40(21): 3979-4002. [6]陈立潮, 夏少芳, 戚洪静, 等. 基于PM算法的网格简化改进算法[J]. 计算机工程, 2008, 34(20): 238-240. [7]Wojtan C, Thurey N, Gross M, et al. Deforming Meshes that Split and Merge[J]. ACM Transactions on Graphics, 2009, 28(3). [8]Shewchuk J, Miller G, David R. Delaunay Refinement Mesh Generation[R]. Pittsburgh, USA: School of Computer Science, Carnegie Mellon University, Tech. Rep.: CMU-CS-97-137, 1997. [9]Aurenhammer F. Voronoi Diagrams—A Survey of a Fundamental Geometric Data Structure[J]. ACM Computing Surveys, 1991, 23(3): 345-405. [10]李海生, 杨 钦, 陈其明. 约束Delaunay三角化的研究与实 现[J]. 计算机工程, 2003, 29(3): 33-34. [11]Amenta N, Bern M, Kamvysselis M. A New Voronoi-based Surface Reconstruction Algorithm[C]//Proc. of the 25th Annual Conference on Computer Graphics and Interactive Techniques. [S. l.]: ACM Press, 1998: 415-421. [12]Boissonnat J D, Oudot S. Provably Good Sampling and Meshing of Surfaces[J]. Graphical Models, 2005, 67(5): 405-451.
|