The weighted farthest color Voronoi diagram on trees and graphs.

DOI10.1016/j.comgeo.2003.07.003zbMath1040.65018OpenAlexW2156562541MaRDI QIDQ1421027

Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera Sacristán

Publication date: 23 January 2004

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2003.07.003

zbMATH Keywords

complexityalgorithmsVoronoi diagramsclosest sitefarthest colorfarthest sitegeometric trees and graphslocational planning

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)

Related Items

Proximity graphs inside large weighted graphs, Balancing graph Voronoi diagrams with one more vertex

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• The upper envelope of Voronoi surfaces and its applications
• The Voronoi Partition of a Network and Its Implications in Location Theory
• Fibonacci heaps and their uses in improved network optimization algorithms
• A faster approximation algorithm for the Steiner problem in graphs