To access the full text documents, please follow this link: http://hdl.handle.net/2117/18614

Connecting Red Cells in a Bicolour Voronoi Diagram
Abellanas, Manuel; Bajuelos, Antonio L.; Canales, Santiago; Claverol Aguas, Mercè; Hernández, Gregorio; Pereira de Matos, Inés
Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV; Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II; Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
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
Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria computacional
Voronoi polygons
Geometry --Data processing
Voronoi, Polígons de
Geometria computacional
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
info:eu-repo/semantics/publishedVersion
Article
         

Show full item record

Related documents

Other documents of the same author

Abellanas, Manuel; Bajuelos, Antonio L.; Pereira de Matos, Inés
Abellanas, Manuel; Hernández, Gregorio; Moreno, José Luis; Ordóñez, Sergio; Sacristán Adinolfi, Vera
Abellanas, Manuel; Hernández, Gregorio; Sacristán Adinolfi, Vera
Abellanas, Manuel; Claverol Aguas, Mercè; Hernández-Peñalver, Gregorio; Hurtado Díaz, Fernando Alfredo; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio
Claverol Aguas, Mercè; Garijo, Delia; Grima, Clara; Márquez, Alberto; Seara Ojea, Carlos
 

Coordination

 

Supporters