Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended
Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer · Algorithmica · 2010
Suppose we want to compute the Delaunay triangulation of a set P whose points are restricted to a collection ℛ of input regions known in advance. Building on recent work by Löffler and Snoeyink, we show how to leverage our knowledge of ℛ 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.