Boundary restore algorithm and sliver elimination of 3D constrained Delaunay triangulation

Jisuan Lixue Xuebao/Chinese Journal of Computational Mechanics

Volumn 21, Issue 2, 2004, Pages 169-176+196

  Song, Chao ^a   Guan, Zhenqun ^a   Gu, Yuanxian ^a  

^a DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

3D solid; Boundary restore; Constrained Delaunay triangulation; Mesh generation; Sliver element

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; SILVER; THREE DIMENSIONAL;

CONSTRAINED DELAUNAY TRIANGULATION; MESH GENERATION; SLIVER ELEMENT; SOLID BOUNDARY RESTORE; THREE DIMENSIONAL SOLID;

TRIANGULATION;

EID: 3042623422     PISSN: 10074708     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. Min Weidong, Tang Zesheng. The Delaunay triangulation of a point set within an arbitrary 2D domain [J]. The Chinese Journal of Computer, 1995, 18(5): 357-364. (in Chinese)
2. Min Weidong, Tang Zesheng. Algorithm for generating the Delaunay triangulation of a point set within an arbitrary 2D domain [J]. The Chinese Journal of Computer, 1995, 18(5): 365-371. (in Chinese)
3. Pan Zhigeng, Ma Xiaohu, Dong Jun, et al. A graph based algorithm for generating the Delaunay triangulation of a point set within an arbitrary 2D domain [J]. Journal of Software, 1996, 7(11): 656-661. (in Chinese)
4. Yang Qin, Xu Yongan, Chen Qiming, et al. Triangulation algorithm of scattered data on arbitrary planar domain [J]. Journal of Software, 1998, 9(4): 241-245. (in Chinese)
5. Sspidis N, Perucchio R. Delaunay triangulation of arbitrarily shaped planar domains [J]. CAGD, 1991, 8: 421-437.
6. Zhou Xiaoyun, Liu Shenquan. A robust algorithm for constrained Delaunay triangulation [J]. The Chinese Journal of Computer, 1996, 19(8): 615-624. (in Chinese)
7. Yang Qin, Xu Yongan, Chen Qiming, et al. Research on 3D constrained Delaunay triangulation [J]. Journal of CAD and CG, 2000, 12(8): 590-594. (in Chinese)
8. Xu Yongan, Yang Qin, Wu Zhuangzhi, et al. The algorithm of 3D constrained Delaunay triangulation [J]. The Chinese Journal of Software, 2001, 12(01): 103-110. (in Chinese)
9. Bowyer A. Computing Dirichlet tessellations [J]. The Comput J, 1981, 24: 162-166.
10. Watson D F. Computing the n-dimensional Delaunay tessellations with application to voronoi polytopes [J]. The Comput J, 1981, 24: 167-172.
11. Weatherill N P, Hassan O. Efficient three-dimensional Delaunay triangulation with automatic point creation and imposed boundary constrains [J]. Int J Num Methods Eng, 1994, 37: 2005-2039.
12. Joe B. Construction of three-dimensional Delaunay triangulations using local transformations [J]. Compu Aided Geo Design, 1991, 8: 123-142.
13. Baker T J. Automatic mesh generation for complex three-dimensional regions using a constrained Delaunay triangulation [J]. Eng with Computer, 1989, 5: 161-175.
14. George P L. Improvements on Delaunay-based three-dimensional automatic mesh generator [J]. Finite Elements in Analysis and Design, 1997, 25: 297-317.
15. George P L, Hecht F, Saltel E. Automatic mesh generator with specified boundary [J]. Computer Methods in Applied Mechanics and Engineering, 1991, 92: 269-288.
16. Joe B. GEOMPACK-A software package for the generation of meshes using geometric algorithms [J]. Advances in Engineering Software, 1991, 56(13): 325-331.
17. Canvendish J C, Field D A, Frey W H. An approach to automatic three-dimensional finite element mesh generation [J]. Int J Num Methods Eng, 1985, 21: 329-347.