On the possibility of simple parallel computing of Voronoi diagrams and Delaunay graphs

  title={On the possibility of simple parallel computing of Voronoi diagrams and Delaunay graphs},
  author={Daniel Reem},
The Voronoi diagram is a widely used data structure. The theory of algorithms for computing Euclidean Voronoi diagrams of point sites is rich and useful, with several different and important algorithms. However, this theory has been quite steady during the last few decades in the sense that new algorithms have not entered the game. In addition, most of the known algorithms are sequential in nature and hence cast inherent difficulties on the possibility to compute the diagram in parallel. This… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 4 times over the past 90 days. VIEW TWEETS
3 Extracted Citations
34 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 34 references

and M

  • O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler, E. Pilgerstorfer
  • Rabl, Divide-and-conquer for Voronoi diagrams…
  • 2009
1 Excerpt

Convergence of the Lloyd algorithm for computing centroidal Voronoi tessellations

  • M. Emelianenko Q. Du, L. Ju
  • SIAM J . Numer . Anal .
  • 2006

Improvements of the incremental methods for the Voronoi diagram with computational comparison of various algorithms

  • M. Iri T. Ohya, K. Murota
  • J . Operations Res . Soc . Japan
  • 2005

Similar Papers

Loading similar papers…