论文信息 - Voronoi Diagram for services neighboring a highway

Voronoi Diagram for services neighboring a highway

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.

[1] Wolfgang Schumann,et al. Das Voronoi-Diagramm von Liniensegmenten und eine Anwendung auf ein Problem mit zusammengesetzten Metriken , 2002 .

[2] Kurt Mehlhorn,et al. The LEDA Platform of Combinatorial and Geometric Computing , 1997, ICALP.

[3] Franz Aurenhammer,et al. Handbook of Computational Geometry , 2000 .

[4] Rolf Klein,et al. Algorithmische Geometrie , 1997 .

[5] Franz Aurenhammer,et al. Voronoi Diagrams , 2000, Handbook of Computational Geometry.

[6] Cathy East Dubowski,et al. The Big Sweep , 2003 .

[7] Rolf Klein,et al. "The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams , 1994, MFCS.

[8] Rolf Klein,et al. Concrete and Abstract Voronoi Diagrams , 1990, Lecture Notes in Computer Science.

[9] Atsuyuki Okabe,et al. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[10] Steven Fortune,et al. A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

[11] J. Sack,et al. Handbook of computational geometry , 2000 .

[12] Kurt Mehlhorn,et al. LEDA: a platform for combinatorial and geometric computing , 1997, CACM.