Abstract
Let S be a set of n + m sites, of which n are red and have weight w R , and m are blue and weigh w B . The objective of this paper is to calculate the minimum value of the red sites’ weight such that the union of the red Voronoi cells in the weighted Voronoi diagram of S is a connected region. This problem is solved for the multiplicatively-weighted Voronoi diagram in \(\mathcal{O}((n+m)^2 \log (nm))\) time and for both the additively-weighted and power Voronoi diagram in \(\mathcal{O}(nm \log (nm))\) time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aichholzer, O., Fabila-Monroy, R., Hackl, T., van Kreveld, M., Pilz, A., Ramos, P., Vogtenhuber, B.: Blocking delaunay triangulations. In: 22nd Canadian Conference on Computational Geometry, pp. 21–24 (2010)
Aurenhammer, F.: Voronoi diagrams a survey. Tech. rep., Institute for Information Processing Technical University of Graz (1988)
Aurenhammer, F., Edelsbrunner, H.: An optimal algorithm for constructing the weighted voronoi diagram in the plane. Pattern Recognition 17(2), 251–257 (1984)
Aurenhammer, F., Klein, R.: Voronoi diagrams. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 201–290. North-Holland, Amsterdam (2000)
Balaban, I.J.: An optimal algorithm for finding segments intersections. In: 11th Annual Symposium on Computational Geometry, SCG 1995, pp. 211–219. ACM, New York (1995)
de Berg, M., Gerrits, D., Khosravi, A., Rutter, I., Tsirogiannis, C., Wolff, A.: How alexander the great brought the greeks together while inflicting minimal damage to the barbarians. In: 26th European Workshop on Computational Geometry, pp. 73–77 (2010)
Golomb, S., Baumert, L.: Backtrack programming. Journal of ACM 12(4), 516–524 (1965)
Kaneko, A., Kano, M.: Discrete geometry on red and blue points in the plane – a survey. In: Discrete and Computational Geometry, The Goodman - Pollack Festschrift, pp. 551–570. Springer (2003)
Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations - Concepts and Applications of Voronoi Diagrams, 2nd edn. Series in Probability and Statistics. John Wiley & Sons, Inc., New York (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Abellanas, M., Bajuelos, A.L., Canales, S., Claverol, M., Hernández, G., Matos, I. (2012). Connecting Red Cells in a Bicolour Voronoi Diagram. In: Márquez, A., Ramos, P., Urrutia, J. (eds) Computational Geometry. EGC 2011. Lecture Notes in Computer Science, vol 7579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34191-5_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-34191-5_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34190-8
Online ISBN: 978-3-642-34191-5
eBook Packages: Computer ScienceComputer Science (R0)