'Ultimate' robustness in meshing an arbitrary polyhedron

International Journal for Numerical Methods in Engineering

Volumn 58, Issue 7, 2003, Pages 1061-1089

  George, P L ^a   Borouchaki, H ^a,b   Saltel, E ^a  

^a INRIA   (France)

^b UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

Delaunay triangulation; Facet partitioning; Mesh of a polyhedron; Robust mesh generation; Triangulation

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ROBUSTNESS (CONTROL SYSTEMS);

BOUNDARY SURFACE MESH;

PROCESS ENGINEERING;

MATHEMATICAL METHOD;

EID: 0142057096     PISSN: 00295981     EISSN: None     Source Type: Journal    
DOI: 10.1002/nme.808     Document Type: Article

References (24)

1. Preparata FP, Shamos MI. Computational Geometry, An Introduction. Springer: Berlin, 1985.
2. Boissonnat JD, Yvinec M. Algorithmic Geometry. Cambridge University Press: Cambridge, 1997.
3. Chazelle B. Triangulating a simple polygon in linear time. Discrete and Computational Geometry 1991; 6:485-524.
4. Cook WA. Body oriented coordinates for generating 3-dimensional meshes. International Journal for Numerical Methods in Engineering 1974; 8:27-43.
5. George A. Computer implementation of the finite element method. Ph.D. Thesis, Department of Computer Science, Stanford University, 1971.
6. Yerry MA, Shephard MS. A modified quadtree approach to finite element mesh generation. IEEE Computer Graphics and Applications 1983; 3(1):39-46.
7. Frey PJ, George PL. Mesh Generation. Hermes: Paris, 2000.
8. Ruppert J, Seidel R. On the difficulty of triangulating three-dimensional nonconvex polyhedra. Discrete and Computational Geometry 1992; 7:227-253.
9. Chazelle B, Palios L. Triangulating a nonconvex polytope. Discrete and Computational Geometry 1990; 5:505-526.
10. George PL, Hecht F, Saltel E. Automatic mesh generator with specified boundary. Computer Methods in Applied Mechanics and Engineering 1991; 92:269-288.
11. Liu A, Baida M. How far flipping can go towards 3D conforming/constrained triangulation. In Proceedings of the 9th International Meshing Roundtable, New Orleans, 2000; 307-315.
12. Weatherill NP, Hassan O. Efficient three-dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints. International Journal for Numerical Methods in Engineering 1994; 37: 2005-2039.
13. Murphy M, Mount DM, Gable CW. A point-placement strategy for conforming Delaunay tetrahedralization. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, 2000; 67-74.
14. Hazlewood C. Approximating constrained tetrahedrizations. Computer Aided Geometric Design 1993; 10:67-87.
15. Pebay Ph P. Delaunay-admissibilité a priori en dimensions 2 et 3. Thèse de l'Université Pierre et Marie Curie, Paris, 2000.
16. Löhner R, Parikh P. Three-dimensional grid generation by the advancing front method. International Journal for Numerical Methods in Fluids 1988; 8:1135-1149.
17. Shephard MS, Georges MK. Automatic three-dimensional mesh generation by the finite octree technique. International Journal for Numerical Methods in Engineering 1991; 32:709-749.
18. Schönhardt E. Über die Zerlegung von Dreieckspolyedern. Mathematish Annalen, 1928; 98:309-312.
19. Chazelle B. Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm. SIAM Journal on Computing 1984; 13(3):488-507.
20. Borouchaki H, George PL, Lo SH. Boundary enforcement by facet splits in Delaunay based mesh generation. in 7th International Conference on Numerical Grid Generation in Computational Field Simulations. Whistler, BC, Canada, September 2000, 203-221.
21. George PL. Improvement on Delaunay based 3D automatic mesh generator. Finite Elements in Analysis and Design 1997; 25(3-4):297-317.
22. Coupez Th. Grandes transformations et remaillage automatique, Thèse ENSMP, CEMEF, Sophia Antipolis, 1991.
23. George PL, Borouchaki H. Maillage simplicial d'un polyèdre arbitraire. Partie 1: Existence et coût. RR INRIA, No. 4397, 2002.
24. George PL, Burouchaki H, Saltel E. Maillage simplicial d'un polyèdre arbitraire. Partie 2: Construction et exemples. RR INRIA, No. 4398, 2002.