Published in

Elsevier, Computational Geometry, 1(27), p. 13-26, 2004

DOI: 10.1016/j.comgeo.2003.07.003

Links

Tools

Export citation

Search in Google Scholar

The weighted farthest color Voronoi diagram on trees and graphs

Journal article published in 2004 by Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera Sacristán ORCID
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

Let n point sites be situated on the vertices or edges of a geometric graph G over e edges. Each site can be assigned a multiplicative weight and a color. We discuss the complexity and provide efficient algorithms for the construction of the Voronoi diagram in which each point of G belongs to the region of that site which is the closest of the furthest color. Special algorithms are presented for the cases when all colors are identical, when all weights are identical, or when G is a tree.