An Upper Bound for Conforming Delaunary Triangulations

Download PDF
Open Webpage

Herbert Edelsbrunner, Tiow Seng Tan

Published: 01 Jan 1993, Last Modified: 15 May 2024Discret. Comput. Geom. 1993EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: A plane geometric graphC in ℝ2 conforms to another such graphG if each edge ofG is the union of some edges ofC. It is proved that, for everyG withn vertices andm edges, there is a completion of a Delaunay triangulation ofO(m>2 n) points that conforms toG. The algorithm that constructs the points is also described.