Delaunay Triangulation of Imprecise Points Simplified and Extended

Suppose we want to compute the Delaunay triangulation of a set P whose points are restricted to a collection R of input regions known in advance. Building on recent work, we show how to leverage our knowledge of R for faster Delaunay computation. Our approach needs no fancy machinery and optimally handles a wide variety of inputs, e.g., overlapping disks of different sizes and fat regions.

Journal Article (peer-reviewed)

Conference Proceedings (peer-reviewed)

back to list