Quickest Paths, Straight Skeletons, and the City Voronoi Diagram

Discrete and Computational Geometry

Volumn 31, Issue 1, 2004, Pages 17-35

  Aichholzer, Oswin ^a   Aurenhammer, Franz ^a   Palop, Belén ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF ALCALÁ   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1142300704     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-003-2947-0     Document Type: Conference Paper

References (20)

1. 1 metric and isothetic networks, in: IX Encuentros en Geometri a Computational, N. Coll et al. (eds.), Universitat de Girona, 2001, pp. 175-181.
2. O. Aichholzer, D. Alberts, F. Aurenhammer, B. Gärtner, A novel type of skeleton for polygons, Journal of Universal Computer Science 1 (1995), 752-761.
3. O. Aichholzer, F. Aurenhammer, Straight skeletons for general polygonal figures, in: Proceedings of the 2nd Annual International Computing and Combinatorics Conference (COCOON '96), Lecture Notes in Computer Science 1090, Springer-Verlag, Berlin, 1996, pp. 117-126.
4. O. Aichholzer, F. Aurenhammer, Straight skeletons for general polygonal figures in the plane, in: Voronoi's Impact on Modern Sciences II, A.M. Samoilenko (ed.), Proc. Institute of Mathematics of the National Academy of Sciences of Ukraine 21, Kiev, 1998, pp. 7-21.
5. F. Aurenhammer, H. Edelsbrunner, An optimal algorithm for constructing the weighted Voronoi diagram in the plane, Pattern Recognition 17 (1984), 251-257.
6. F. Aurenhammer, R. Klein, Voronoi diagrams, in: Handbook of Computational Geometry, J. Sack, G. Urrutia (eds.), Elsevier Science, Amsterdam, 2000, Chapter 5, pp. 201-290.
7. Y. Berman, Transportation Voronoi diagrams, Manuscript, School of Computer Science and Engineering, The Hebrew University of Jerusalem, 2002.
8. S.-W. Cheng, A. Vigneron, Motorcycle graphs and straight skeletons, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 156-165.
9. E.D. Demaine, M.L. Demaine, J.S.B. Mitchell, Folding flat silhouettes and wrapping polyhedral packages: new results in computational origami, Computational Geometry: Theory and Applications 16 (2000), 3-21.
10. H. Edelsbrunner, R. Seidel, Voronoi diagrams and arrangements, Discrete & Computational Geometry 1 (1986), 25-44.
11. D. Eppstein, J. Erickson, Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions, Discrete & Computational Geometry 22 (1999), 569-592.
12. L. Gewali, A. Meng, J.S.B. Mitchell, S. Ntafos, Path planning in 0/1/∞ weighted regions with applications, ORSA Journal on Computing 2 (1990), 253-272.
13. F. Hurtado, B. Palop, V. Sacristan, Diagramas de Voronoi con funciones temporales, in: VIII Encuentros en Geometri a Computational, J. Badenas et al. (eds.), Universitat Jaume I, 1999, pp. 279-287.
14. R. Klein, Concrete and Abstract Voronoi Diagrams, Lecture Notes in Computer Science 400, Springer-Verlag, Berlin, 1989.
15. R. Klein, K. Mehlhorn, S. Meiser, Randomized incremental construction of abstract Voronoi diagrams, Computational Geometry: Theory and Applications 3 (1993), 157-184.
16. K. Mehlhorn, S. Meiser, C. O'Dunlaing, On the construction of abstract Voronoi diagrams, Discrete & Computational Geometry 6 (1991), 211-224.
17. J.S.B. Mitchell, On maximum flows in polyhedral domains, Proceedings of the 4th Annual ACM Symposium on Computational Geometry, 1988, pp. 341-351.
18. J.S.B. Mitchell, Shortest paths among obstacles in the plane, Proceedings of the 9th Annual ACM Symposium on Computational Geometry, 1993, pp. 308-317.
19. J.S.B. Mitchell, C.H. Papadimitriou, The weighted region problem: finding shortest paths through a weighted planar subdivision, Journal of the ACM 38 (1991), 18-73.
20. E. Papadopoulou, D.T. Lee, The L∞ Voronoi diagram of segments and VLSI applications, International Journal of Computational Geometry & Applications 11 (2001), 503-528.