@inproceedings{26d074c33e724c2bad7341cda718bbdb,

title = "Delaunay triangulation of imprecise points simplified and extended",

abstract = "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 by L{\"o}ffler and Snoeyink[21], 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, eg, overlapping disks of different sizes and fat regions.",

author = "K. Buchin and M. L{\"o}ffler and P. Morin and W. Mulzer",

year = "2009",

doi = "10.1007/978-3-642-03367-4_12",

language = "English",

isbn = "978-3-642-03366-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "131--143",

editor = "F. Dehne and M. Gavrilova and J.-R. Sack and C.D. T{\'o}th",

booktitle = "Algorithms and Data Structures (Proceedings 11th International Workshop, WADS 2009, Banff, Alberta, Canada, August 21-23, 2009)",

address = "Germany",

}