Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and ExtendedReportar como inadecuado




Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Algorithmica

, Volume 61, Issue 3, pp 674–693

First Online: 28 July 2010Received: 02 September 2009Accepted: 05 July 2010

Abstract

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.

KeywordsDelaunay triangulation Data imprecision Quadtree This research was partially supported by the Netherlands Organisation for Scientific Research NWO through the project GOGO, the BRICKS-FOCUS project no. 642.065.503, and project no. 639.022.707. P. Morin was supported by NSERC, CFI, and the Ontario Ministry of Research and Innovation. W. Mulzer was supported in part by a Wallace Memorial Fellowship in Engineering and NSF grant CCF-0634958 and NSF CCF 0832797.

Download to read the full article text



Autor: Kevin Buchin - Maarten Löffler - Pat Morin - Wolfgang Mulzer

Fuente: https://link.springer.com/







Documentos relacionados