Robust boundary triangulation and delaunay triangulation of arbitrary planar domains
Gandhimathi Alias Usha Subramanian, V.V.S. Raveendra, Mahesh Kamath · International Journal for Numerical Methods in Engineering · 1994
Abstract 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.