@inproceedings{1bea2633850a4adc99355a4579e9618e,

title = "Localizing the Delaunay triangulation and its parallel implementation",

abstract = "We show how to localize the Delaunay triangulation of a given planar point set, namely, bound the set of points which are possible Delaunay neighbors of a given point. We then exploit this observation in an algorithm for constructing the Delaunay triangulation (and its dual Voronoi diagram) by computing the Delaunay neighbors (and Voronoi cell) of each point independently. While this does not lead to the fastest serial algorithm possible for Delaunay triangulation, it does lead to an efficient parallelization strategy which achieves almost perfect speedups on multicore machines.",

author = "Renjie Chen and Craig Gotsman",

year = "2012",

doi = "10.1109/ISVD.2012.9",

language = "English (US)",

isbn = "9780769547244",

series = "Proceedings of the 2012 9th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2012",

pages = "24--31",

booktitle = "Proceedings of the 2012 9th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2012",

note = "2012 9th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2012 ; Conference date: 27-06-2012 Through 29-06-2012",

}