Guaranteed‐quality triangular mesh generation for domains with curved boundaries

摘要: Guaranteed-quality unstructured meshing algorithms facilitate the development of automatic tools. However, these require domains discretized using a set linear segments, leading to numerical errors in with curved boundaries. We introduce an extension Ruppert's Delaunay refinement algorithm two-dimensional boundaries and prove that same quality bounds apply as straight provide implementation details for boundary patches such lines, circular arcs, cubic parametric curves, interpolated splines. present guaranteed-quality triangular meshes generated boundaries, propose solutions some problems associated use Copyright © 2002 John Wiley & Sons, Ltd.