Abstract
Given k terminals and n axis-parallel rectangular obstacles on the plane, our algorithm finds a plane region R * such that, for any point p in R *, the total length of the k shortest rectilinear paths connecting p and the k terminals without passing through any obstacle is minimum. The algorithm is output-sensitive, and takes O((K + n) log n) time and O(K + n) space if k is a fixed constant, where K is the total number of polygonal vertices of the found region R *.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. J. Atallah and D. Chen: ”Parallel rectilinear shortest paths with rectangular obstacles,” Comput. Geom. Theory Appl., 1, pp. 79–113, 1991.
K. L. Clarkson, S. Kapoor, and P. M. Vaidya: ”Rectilinear shortest paths through polygonal obstacles in O(n(log n)2) time,” Proc. Third Annual ACM Symp. on Computational Geometry, Waterloo, Ontario, pp. 251–257, 1987.
P.J. de Rezende, D.T. Lee, and Y.F. Wu, “Rectilinear shortest paths with rectangular barriers,” Discrete and Computational Geometry, 4, pp. 41–53, 1989.
E.G. Gilbert and D.W. Johnson, “Distance functions and their application to robot path planning in the presence of obstacles,” IEEE Trans. of Robotics and Automation, RA-1, 1, pp. 21–30, 1985.
S. Guha and I. Suzuki: ”Proximity problems for points on a rectilinear plane with rectangular obstacles,” Algorithmica, 17, pp. 281–307, 1997.
J. JáJá, An Introduction to Parallel Algorithms, Addison Wesley, Reading, MA, 1992.
R. C. Larson, and V. O. Li: “Finding minimum rectilinear distance paths in the presence of barriers,” Networks, 11, pp. 285–304, 1981.
D. T. Lee, C. D. Yang, and T. H. Chen: “Shortest rectilinear paths among weighted obstacles,” Int. J. Comput. Geom. Appl., 1, pp. 109–204, 1991.
J. S. B. Mitchell: “L 1 shortest paths among polygonal obstacles in the plane,” Algorithmica, 8, pp. 55–88, 1992.
P.N. Klein, “A linear processor polylog-time algorithm for shortest paths in planar graphs,” Proc. of 34th Symp. on Found. of Comput. Sci., pp. 259–270, 1993.
Y. Kusakari, H. Suzuki, and T. Nishizeki, “Finding a shortest pair of paths on the plane with obstacles and crossing areas,” Proc. of ISAAC'95, Lect. Notes in Computer Science, Springer-Verlag, 1004, pp. 42–51, 1995.
Y. Kusakari, H. Suzuki, and T. Nishizeki, “An algorithm for finding a shortest pair of paths in a plane region,” Trans. on Japan Soc. for Ind. and Appl. Math., Vol. 5, No. 4, pp. 381–398, 1995 (in Japanese).
J-C. Latombe, Robot Motion Planning, Kluwer Academic Publ., Boston, 1991.
T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, John Wiley & Sons, Chichester, England, 1990.
T. Ohtsuki(Editor), Layout Design and Verification, North-Holland, Amsterdam, 1986.
F.P. Preparata, and M.I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kusakari, Y., Nishizeki, T. (1997). An algorithm for finding a region with the minimum total L 1 from prescribed terminals. In: Leong, H.W., Imai, H., Jain, S. (eds) Algorithms and Computation. ISAAC 1997. Lecture Notes in Computer Science, vol 1350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63890-3_35
Download citation
DOI: https://doi.org/10.1007/3-540-63890-3_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63890-2
Online ISBN: 978-3-540-69662-9
eBook Packages: Springer Book Archive