Abstract
Given two sets of points in the plane, we are interested in locating a highway h such that an objective function on the city distance between points of the two sets is minimized (where the city distance is measured with speed v > 1 on a highway and 1 in the underlying metric elsewhere). Extending the results of Ahn et al. ([7]), we consider the option that there are already some built highways. We give a unified approach to this problem to design polynomial-time algorithms for several combinations of objective functions and types of the inserted highway (turnpike or freeway).
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
Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., del Río, B.P., Sacristan, V.: Proximity Problems for Time Metrics Induced by the L 1 Metric and Isothetic Networks. In: Proc. Encuentros en Geometría Computacional (2001)
Ahn, H.-K., Alt, H., Asano, T., Bae, S.W., Brass, P., Cheong, O., Knauer, C., Na, H.-S., Shin, C.-S., Wolff, A.: Constructing Optimal Highways. In: Computing: The Australian Theory Symposium, vol. 65 (2007)
Aicholzer, O., Aurenhammer, F., Palop, B.: Quickest Path, Straight Skeleton and the City Voronoi Diagram. In: ACM Sympos. Comput. Geom., pp. 151–159 (2002)
Bae, S.W., Kim, J.-H., Chwa, K.-Y.: Optimal Construction of the City Voronoi Diagram. In: Proc. 17th Annu. Internat. Sympos. Algorithms Comput., pp. 183–192 (2006)
Bae, S.W., Chua, K.-Y.: Shortest Paths and Voronoi Diagrams with Transportation Networks under General Distances. In: Proc 16th Annu. Internat. Sympos. Algoritms Comput., pp. 1007–1018 (2005)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry. Algorithms and Applications. Springer, Heidelberg (1997)
Cardinal, J., Langerman, S.: Min-max-min Geometric Facility Location Problems. In: Proc. of the European Workshop on Computational Geometry (2006)
Cardinal, J., Collette, S., Hurtado, F., Langerman, S., Palop, B.: Moving Walkways, Escalators, and Elevators. Eprint arXiv:0705.0635 (2007)
Hassin, R., Megiddo, N.: Approximation Algorithms for Hitting Objects with Straight Lines. Discrete Applied Mathematics 30(1), 29–42 (1991)
Korman, M., Tokuyama, T.: Optimal Insertion of a Segment Highway in a City Metric. In: Proc. of the European Workshop on Computational Geometry, pp. 189–192 (2008)
Kranakis, E., Krizanc, D., Meertens, L.: Link Length of Rectilinear Hamiltonian Tours in Grids. Ars Combinatoria 38, 177–192 (1994)
Mitchell, J.S.B.: L 1 Shortest Paths among Obstacles in the Plane. Internat. J. Comput. Geom. Appl. 6(3), 309–331 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Korman, M., Tokuyama, T. (2008). Optimal Insertion of a Segment Highway in a City Metric. In: Hu, X., Wang, J. (eds) Computing and Combinatorics. COCOON 2008. Lecture Notes in Computer Science, vol 5092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69733-6_60
Download citation
DOI: https://doi.org/10.1007/978-3-540-69733-6_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69732-9
Online ISBN: 978-3-540-69733-6
eBook Packages: Computer ScienceComputer Science (R0)