Redesign of a conformal boundary recovery algorithm for 3D Delaunay triangulation

Journal of Zhejiang University: Science

Volumn 7, Issue 12, 2006, Pages 2031-2042

  Chen, Jian Jun ^a   Zheng, Yao ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Boundary recovery; Data structure; Delaunay triangulation; Mesh generation

Indexed keywords

BOUNDARY CONDITIONS; CONVERGENCE OF NUMERICAL METHODS; DATA STRUCTURES; THREE DIMENSIONAL;

BOUNDARY CONSTRAINTS; BOUNDARY RECOVERY; DELAUNAY CRITERION; DELAUNAY TRIANGULATION; INTERSECTION POSITIONS; MESH GENERATION; NEIGHBORING RELATIONS; NUMERICAL RESULTS; STEINER POINTS;

TRIANGULATION;

EID: 33845887737     PISSN: 10093095     EISSN: None     Source Type: Journal    
DOI: 10.1631/jzus.2006.A2031     Document Type: Article

References (9)

1. Chen, J.J., 2006. Unstructured Mesh Generation and Its Parallelization. Ph.D Thesis, College of Computer Science, Zhejiang University (in Chinese).
2. Du, Q., Wang, D.S., 2004. Constrained boundary recovery for three dimensional Delaunay triangulations. International Journal for Numerical Methods in Engineering, 61(9):1471-1500. [doi:10.1002/nme.1120]
3. George, P.L., Hecht, F., Saltel, E., 1991. Automatic mesh generator with specified boundary. Computer Methods in Applied Mechanics and Engineering, 92(3):269-288. [doi:10.1016/0045-7825(91)90017-Z]
4. George, P.L., Borouchaki, H., Saltel, E., 2003. 'Ultimate' robustness in meshing an arbitrary polyhedron. International Journal for Numerical Methods in Engineering, 58(7):1061-1089. [doi:10.1002/nme.808]
5. Lewis, R.W., Zheng, Y., Gethin, D.T., 1996. Three-dimensional unstructured mesh generation: part 3. volume meshes. Computer Methods in Applied Mechanics and Engineering, 134(3-4):285-310. [doi:10.1016/0045-7825(95)00918-3]
6. Liu, A., Baida, M., 2000. How Far Flipping Can Go towards 3D Conforming/Constrained Triangulations. Proceedings of the 11th International Meshing Roundtable, New Orleans, Louisiana, USA, p.307-315.
7. Ruppert, J., Seidel, R., 1992. On the difficulty of triangulating three-dimensional non-convex polyhedra. Discrete and Computational Geometry, 7(3):227-254.
8. Song, C., Guan, Z.Q., Gu, Y.X., 2004. Boundary restore algorithm and sliver elimination of 3D constrained Delaunay triangulation. Chinese Journal of Computational Mechanics, 21(2):169-176 (in Chinese).
9. Weatherill, N.P., Hassan, O., 1994. Efficient three-dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints. International Journal for Numerical Methods in Engineering, 37(12):2005-2039. [doi:10.1002/nme.1620371203]