Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Connecting Red Cells in a Bicolour Voronoi Diagram

Autor
Abellanas, M.; Bajuelos, A.; Canales, S.; Claverol, M.; Hernández, G.; Pereira de, I.
Tipus d'activitat
Article en revista
Revista
Lecture notes in computer science
Data de publicació
2012-11
Número
LNCS 7579
Pàgina inicial
210
Pàgina final
219
DOI
https://doi.org/10.1007/978-3-642-34191-5 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/18614 Obrir en finestra nova
URL
http://link.springer.com/content/pdf/10.1007%2F978-3-642-34191-5_20 Obrir en finestra nova
Resum
Let S be a set of n + m sites, of which n are red and have weight wR, and m are blue and weigh wB. 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 multiplicativelyweighted Voronoi diagram in O((n+m)2 log(nm)) time and for both the additively-weighted and power Voronoi diagram in O(nmlog(nm)) time
Citació
Abellanas, M. [et al.]. Connecting Red Cells in a Bicolour Voronoi Diagram. "Lecture notes in computer science", Novembre 2012, núm. LNCS 7579, p. 210-219.
Grup de recerca
CGA -Computational Geometry and Applications
DCG - Discrete and Combinatorial Geometry

Participants

  • Abellanas, Manuel  (autor)
  • Bajuelos, Antonio L.  (autor)
  • Canales, Santiago  (autor)
  • Claverol Aguas, Merce  (autor)
  • Hernández, Gregorio  (autor)
  • Pereira de Matos, Ines  (autor)