The weighted farthest color Voronoi diagram on trees and graphs
- 31 January 2004
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 27 (1) , 13-26
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The graph Voronoi diagram with applicationsNetworks, 2000
- The upper envelope of voronoi surfaces and its applicationsDiscrete & Computational Geometry, 1993
- The Voronoi Partition of a Network and Its Implications in Location TheoryINFORMS Journal on Computing, 1992
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- A faster approximation algorithm for the Steiner problem in graphsInformation Processing Letters, 1988
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- An optimal algorithm for constructing the weighted voronoi diagram in the planePattern Recognition, 1984