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. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Chen, R., & Gotsman, C. (2013). Localizing the delaunay triangulation and its parallel implementation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8110, pp. 39–55). Springer Verlag. https://doi.org/10.1007/978-3-642-41905-8_4
Mendeley helps you to discover research relevant for your work.