Voronoi Diagram for services neighboring a highway

Authors:
M. Abellanas;F. Hurtado;V. Sacristán;C. Icking;L. Ma;R. Klein;E. Langetepe;B. Palop
Affiliations:
Departamento de Matemática Aplicada, Universidad Politécnica de Madrid, Madrid, Spain;Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Barcelona, Spain;Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Barcelona, Spain;Praktische Informatik VI, FernUniversität Hagen, Hagen, Germany;Praktische Informatik VI, FernUniversität Hagen, Hagen, Germany;Institut für Informatik I, Universität Bonn, Bonn, Germany;Institut für Informatik I, Universität Bonn, Bonn, Germany;Departamento de Informática, Universidad de Valladolid, Valladolid, Spain
Venue:
Information Processing Letters
Year:
2003

Citing 2
Cited 14

Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing

The transportation metric and related problems

Information Processing Letters
Constructing optimal highways

CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Optimal location of transportation devices

Computational Geometry: Theory and Applications
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
The transportation metric and related problems

Information Processing Letters
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
Round-trip voronoi diagrams and doubling density in geographic networks

Transactions on Computational Science XIV
Farthest voronoi diagrams under travel time metrics

WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Bichromatic 2-center of pairs of points

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Proximity graphs inside large weighted graphs

Networks
Quickest path queries on transportation network

CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Optimal time-convex hull under the Lp metrics

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.89

Visualization

Abstract

We are given a transportation line where displacements happen at a bigger speed than in the rest of the plane. A shortest time path is a path between two points which takes less than or equal time to any other. We consider the time to follow a shortest time path to be the time distance between the two points. In this paper, we give a simple algorithm for computing the Time Voronoi Diagram, that is, the Voronoi Diagram of a set of points using the time distance.