Premium
Robust boundary triangulation and delaunay triangulation of arbitrary planar domains
Author(s) -
Subramanian G.,
Raveendra V. V. S.,
Kamath M. Gopalakrishna
Publication year - 1994
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620371009
Subject(s) - delaunay triangulation , bowyer–watson algorithm , pitteway triangulation , constrained delaunay triangulation , surface triangulation , minimum weight triangulation , point set triangulation , triangulation , chew's second algorithm , regular polygon , mathematics , boundary (topology) , ruppert's algorithm , mesh generation , planar , algorithm , computer science , topology (electrical circuits) , combinatorics , geometry , mathematical analysis , finite element method , physics , computer graphics (images) , thermodynamics
A simple and robust boundary triangulation algorithm is proposed and, based on it, completely automatic Delaunay mesh generation procedures are developed. The algorithm is equally applicable to convex, non‐convex and multiply connected planar domains. In this approach, given the nodes, the number of triangles formed is precisely known and any desired control over mesh generation is possible.