An improved algorithm for constructing kth-order voronoi diagrams
IEEE Transactions on Computers
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)
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Quickest paths, straight skeletons, and the city Voronoi diagram
Proceedings of the eighteenth annual symposium on Computational geometry
Introduction to Algorithms
Discrete Applied Mathematics
Voronoi Diagram for services neighboring a highway
Information Processing Letters
The weighted farthest color Voronoi diagram on trees and graphs
Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
Proceedings of the 2006 ACM symposium on Applied computing
K nearest neighbor search in navigation systems
Mobile Information Systems
On k-Nearest Neighbor Voronoi Diagrams in the Plane
IEEE Transactions on Computers
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Approximate order-k Voronoi cells over positional streams
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Algorithm Design: Foundations, Analysis and Internet Examples
Algorithm Design: Foundations, Analysis and Internet Examples
Shortest paths and voronoi diagrams with transportation networks under general distances
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Voronoi diagrams with a transportation network on the euclidean plane
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On the triangle-perimeter two-site Voronoi diagram
Transactions on computational science IX
On the triangle-perimeter two-site Voronoi diagram
Transactions on computational science IX
Round-trip voronoi diagrams and doubling density in geographic networks
Transactions on Computational Science XIV
On the expected complexity of voronoi diagrams on terrains
Proceedings of the twenty-eighth annual symposium on Computational geometry
| Hi-index | 0.00 |
We provide an efficient algorithm for two-site Voronoi diagrams in geographic networks. A two-site Voronoi diagram labels each vertex in a geographic network with their two nearest neighbors, which is useful in many contexts.