Abstract
We consider the problem of computing all farthest neighbors (and the diameter) of a given set of n points in the presence of highways and obstacles in the plane. When traveling on the plane, travelers may use highways for faster movement and must avoid all obstacles. We present an efficient solution to this problem based on knowledge from earlier research on shortest path computation. Our algorithms run in \(\ensuremath{O(nm(\log m + \log^2n))}\) time using O(m + n) space, where the m is the combinatorial complexity of the environment consisting of highways and obstacles.
Work by S.W. Bae was supported by the Brain Korea 21 Project. Work by M. Korman was supported by MEXT scolarship and CERIES GCOE project, MEXT Japan.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agarwal, P.K., Matoušek, J.: On range searching with semialgebraic sets. Discrete Comput. Geom. 11(1), 393–418 (1994)
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: Proc. 13th Comput., Australasian Theory Sympos. (CATS), Ballarat, Australia. CRPIT, vol. 65, pp. 7–14. ACS (2007)
Aichholzer, O., Aurenhammer, F., Palop, B.: Quickest paths, straight skeletons, and the city Voronoi diagram. In: Proc. 18th Annu. ACM Sympos. Comput. Geom., pp. 151–159 (2002)
Bae, S.W., Chwa, K.-Y.: The farthest city Voronoi diagram. In: Proc. of the First Meeting of AAAC (2008)
Bae, S.W., Kim, J.-H., Chwa, K.-Y.: Optimal construction of the city Voronoi diagram. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 183–192. Springer, Heidelberg (2006)
Ben-Moshe, B., Katz, M.J., Mitchell, J.S.B.: Farthest neighbors and center points in the presence of rectangular obstacles. In: Proc. 17th Annu. ACM Sympos. Comput. Geom., pp. 164–171 (2001)
Cardinal, J., Collette, S., Hurtado, F., Langerman, S., Palop, B.: Moving walkways, escalators, and elevators. CoRR, abs/0705.0635 (2007)
Chazelle, B.: An algorithm for segment dragging and its implementation. Algorithmica 3, 205–221 (1988)
Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry. Discrete Comput. Geom. 4, 387–421 (1989)
Mitchell, J.S.B.: L 1 shortest paths among polygonal obstacles in the plane. Algorithmica 8, 55–88 (1992)
Mitchell, J.S.B.: Shortest paths among obstacles in the plane. Internat. J. Comput. Geom. Appl. 6(3), 309–331 (1996)
Ostrovsky-Berman, Y.: The transportation metric and related problems. Inform. Process. Lett. 95, 461–465 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bae, S.W., Korman, M., Tokuyama, T. (2009). All Farthest Neighbors in the Presence of Highways and Obstacles . In: Das, S., Uehara, R. (eds) WALCOM: Algorithms and Computation. WALCOM 2009. Lecture Notes in Computer Science, vol 5431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00202-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-00202-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00201-4
Online ISBN: 978-3-642-00202-1
eBook Packages: Computer ScienceComputer Science (R0)