Department of Mechanical Engineering, College of Engineering and Applied Science, University of Rochester, Rochester, NY 14627, USA
Abstract:
An algorithm is presented for constructing a Domain Delaunay triangulation (DDT) of an arbitrarily shaped, multiply-connected (manifold or nonmanifold), planar domain. DDT preserves the boundary of the given region and has properties identical to those of the standard Delaunay triangulation. Construction of this triangulation involves operations (node refinement, triangulation extraction) that are based solely on properties of the standard Delaunay diagram. Examples are included that demonstrate the validity of the algorithm.