Abstract
This paper investigates geometric and algorithmic properties of the Voronoi diagram with a transportation network on the Euclidean plane. With a transportation network, the distance is measured as the length of the shortest (time) path. In doing so, we introduce a needle, a generalized Voronoi site. We present an O(nm 2log n + m 3log m) algorithm to compute the Voronoi diagram with a transportation network on the Euclidean plane, where n is the number of given sites and m is the complexity of the given transportation network.
This work is supported by grant No.R01-2003-000-11676-0 from KOSEF.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hurtado, F., Palop, B., Sacristán, V.: Diagramas de voronoi con funciones temporales. VIII Encuetos en Geometria Computacional (1999)
Abellanas, M., Hurtado, F., Sacristán, V., Palop, B.: Voronoi diagram for services neighboring a highway. IPL: Information Processing Letters 86 (2003)
Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristán, V.: Proximity problems for time metrics induced by the l 1 metric and isothetic networks. In: IX Encuetros en Geometria Computacional (2001)
Aichholzer, O., Aurenhammer, F., Palop, B.: Quickest paths, straight skeletons, and the city voronoi diagram. In: Proceedings of the 8th SoCG, June, 5-7, 2002, pp. 151–159. ACM Press, New York (2002)
Klein, R.: Concrete and Abstract Voronoi Diagrams. LNCS, vol. 400. Springer, Heidelberg (1989)
Mehlhorn, K., Meiser, S., O’Dunlaing, C.: On the construction of abstract Voronoi diagrams. Discrete Comput. Geom. 6, 211–224 (1991)
Klein, R., Mehlhorn, K., Meiser, S.: Randomized incremental construction of abstract voronoi diagrams. Computational Geometry: Theory and Applications 3, 157–184 (1993)
Dehne, F., Klein, R.: the big sweep: On the power of the wavefront approach to Voronoi diagrams. Algorithmica 17, 19–32 (1997)
Mitchell, J.S.B., Papadimitriou, C.H.: The weighted region problem: Finding shortest paths through a weighted planar subdivision. Journal of the ACM 38, 18–73 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bae, S.W., Chwa, KY. (2004). Voronoi Diagrams with a Transportation Network on the Euclidean Plane. In: Fleischer, R., Trippen, G. (eds) Algorithms and Computation. ISAAC 2004. Lecture Notes in Computer Science, vol 3341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30551-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-30551-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24131-7
Online ISBN: 978-3-540-30551-4
eBook Packages: Computer ScienceComputer Science (R0)