Shortest paths and voronoi diagrams with transportation networks under general distances

Authors:
Sang Won Bae;Kyung-Yong Chwa
Affiliations:
Division of Computer Science, Department of EECS, Korea Advanced Institute of Science and Technology, Daejeon, Korea;Division of Computer Science, Department of EECS, Korea Advanced Institute of Science and Technology, Daejeon, Korea
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 6
Cited 9

Roads, rivers, and obstacles: optimal two-dimensional path planning around linear features for a mobile agent

International Journal of Robotics Research
On the construction of abstract Voronoi diagrams

Discrete & Computational Geometry
Randomized incremental construction of abstract Voronoi diagrams

Computational Geometry: Theory and Applications
Quickest paths, straight skeletons, and the city Voronoi diagram

Proceedings of the eighteenth annual symposium on Computational geometry
Voronoi Diagrams Based on General Metrics in the Plane

STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
Voronoi Diagram for services neighboring a highway

Information Processing Letters

Constructing optimal highways

CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Optimal Insertion of a Segment Highway in a City Metric

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Two-site Voronoi diagrams in geographic networks

Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Highway hull revisited

Computational Geometry: Theory and Applications
Round-trip voronoi diagrams and doubling density in geographic networks

Transactions on Computational Science XIV
Optimal construction of the city voronoi diagram

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Farthest voronoi diagrams under travel time metrics

WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Higher order city voronoi diagrams

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Quickest path queries on transportation network

CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128

Quantified Score

Hi-index	0.00

Visualization

Abstract

Transportation networks model facilities for fast movement on the plane. A transportation network, together with its underlying distance, induces a new distance. Previously, only the Euclidean and the L1 distances have been considered as such underlying distances. However, this paper first considers distances induced by general distances and transportation networks, and present a unifying approach to compute Voronoi diagrams under such a general setting. With this approach, we show that an algorithm for convex distances can be easily obtained.