## A decentralized spatial partitioning algorithm based on the minimum control effort metric

- Efstathios Bakolas
- 2014 American Control Conference
- 2014

@article{Reem2012OnTP, title={On the possibility of simple parallel computing of Voronoi diagrams and Delaunay graphs}, author={Daniel Reem}, journal={CoRR}, year={2012}, volume={abs/1212.1095} }

- Published 2012 in ArXiv

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