Delaunay Triangular Meshes in Convex Polygons
Author:
- Barry JoeBJBarry Joe
- 1 April 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 7 (2) , 514-539
Abstract
An algorithm for producing a triangular mesh in a convex polygon is presented. It is used in a method for the finite element triangulation of a complex polygonal region of the plane in which the region is decomposed into convex polygons. The interior vertices of the mesh are chosen to be on a quasi-uniform grid, different mesh spacings are specified for the edges of the polygon, and the mesh is a Delaunay triangulation. The correctness of the algorithm is proved and the expected time complexity is shown to be linear in the number of triangles in the mesh.Keywords
This publication has 9 references indexed in Scilit:
- A Two-Dimensional Mesh Verification AlgorithmSIAM Journal on Scientific and Statistical Computing, 1981
- An Optimal Algorithm for Finding the Kernel of a PolygonJournal of the ACM, 1979
- Locally equiangular triangulationsThe Computer Journal, 1978
- Modification to the Suhara‐Fukuda method of network generationInternational Journal for Numerical Methods in Engineering, 1978
- Software for C1 Surface Interpolation1977
- Automatic generation of triangular grid: I—subdivision of a general polygon into convex subregions. II—triangulation of convex polygonsInternational Journal for Numerical Methods in Engineering, 1976
- Closest-point problems1975
- Geometric complexity1975
- Automatic triangulation of arbitrary planar domains for the finite element methodInternational Journal for Numerical Methods in Engineering, 1974