Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Two-site Voronoi diagrams in geographic networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
A meeting scheduling problem respecting time and space
Geoinformatica
| Hi-index | 0.00 |
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.