Delaunay triangulation of non‐convex planar domains
- 1 November 1989
- journal article
- research article
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 28 (11), 2695-2707
- https://doi.org/10.1002/nme.1620281113
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Robust, geometrically based, automatic two‐dimensional mesh generationInternational Journal for Numerical Methods in Engineering, 1987
- Automatic mesh generation scheme for a two- or three-dimensional triangular curved surfaceComputers & Structures, 1982
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- A brief review of techniques for generating irregular computational gridsInternational Journal for Numerical Methods in Engineering, 1980
- A versatile two-dimensional mesh generator with automatic bandwidth reductionComputers & Structures, 1979
- Drag method as a finite element mesh generation schemeComputers & Structures, 1979
- Automatic generation of finite element meshesComputers & Structures, 1978
- Locally equiangular triangulationsThe Computer Journal, 1978
- Modification to the Suhara‐Fukuda method of network generationInternational Journal for Numerical Methods in Engineering, 1978
- Automatic triangulation of arbitrary planar domains for the finite element methodInternational Journal for Numerical Methods in Engineering, 1974