Delaunay triangulation of non‐convex planar domains

International Journal for Numerical Methods in Engineering

Volumn 28, Issue 11, 1989, Pages 2695-2707

  Lo, S H ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES--FORTRAN; COMPUTER PROGRAMMING--ALGORITHMS;

DELAUNAY TRIANGULATION; MESH GENERATION TECHNIQUES; PLANAR DOMAINS;

MATHEMATICAL TECHNIQUES;

EID: 0024767430     PISSN: 00295981     EISSN: 10970207     Source Type: Journal    
DOI: 10.1002/nme.1620281113     Document Type: Article

References (37)

1. A brief review of techniques for generating irregular computational grids
2. A new mesh generation scheme for arbitrary planar domains
3. Automatic mesh generation for finite element analysis
4. Automatic triangulation of arbitrary planar domains for the finite element method
5. An approach to automatic three‐dimensional finite element mesh generation
6. Modification to the Suhara–Fukuda method of network generation
7. A scheme for the automatic generation of triangular finite elements
8. Automatic mesh generation scheme for a two or three dimensional triangular curved surface
9. Laplacian–isoparametric grid generation scheme
10. Grid generation tools for the finite element analysis
11. A versatile two‐dimensional mesh generator with automatic bandwidth reduction
12. An automatic mesh generation scheme for plane and curved surfaces by isoparametric coordinate
13. A general two‐dimensional, graphical finite element preprocessor utilizing discrete transfinite mappings
14. Body oriented (natural) coordinates for generating three‐dimensional meshes
15. Construction of curvilinear coordinates systems and application to mesh generation
16. Smooth interpolation in triangles
17. Automatic three‐dimensional mesh generation by the modified octree technique
18. Automatic mesh generation for three‐dimensional solids
19. Robust, geometrically based, automatic two‐dimensional mesh generation
20. Drag method as a finite element mesh generation scheme
21. Automatic generation of finite element meshes
22. A generalised automatic mesh generation scheme for finite element method
23. Kubik: An automatic three‐dimensional finite element mesh generator
24. Automatic mesh generation with tetrahedron elements
25. AGTHOM—Automatic generation of triangular and higher order meshes
26. Design of a recursive, shape controlling mesh generator
27. Triangular meshes for regions of complicated shape
28. Locally equiangular triangulations
29. Construction of Voronoi polyhedra
30. A procedure for the construction of Voronoi polyhedra
31. Computing Dirichlet tessellations
32. Computing th.n‐dimensional Delaunay tessellation with application to Voronoi polytopes
33. Selective refinement: A new strategy for automatic node placement in graded triangular meshes