An algorithm for finding a region with the minimum total l1 from prescribed terminals

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1350, Issue , 1997, Pages 324-333

  Kusakari, Yoshiyuki ^a   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

A-PLANE; K TERMINALS; OUTPUT-SENSITIVE; RECTANGULAR OBSTACLES; RECTILINEAR PATH; TOTAL LENGTH;

ALGORITHMS;

EID: 0942303489     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63890-3_35     Document Type: Conference Paper

References (16)

1. M. J. Atallah and D. Chen: "Parallel rectilinear shortest paths with rectangular obstacles," Comput. Geom. Theory Appl., 1, pp. 79-113, 1991
2. K. L. Clarkson, S. Kapoor, and P.M. Vaidya: "Rectilinear shortest paths through polygonal obstacles in O(n(logn) 2) time," Proc. Third Annum ACM Symp. on Computational Geometry, Waterloo, Ontario, pp. 251-257, 1987
3. 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
4. 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
5. S. Guha and I. Suzuki: "Proximity problems for points on a rectilinear plane with rectangular obstacles," Algorithmica, 17, pp. 281-307, 1997
6. J. JáJá, An Introduction to Parallel Algorithms, Addison Wesley, Reading, MA, 1992
7. R. C. Larson, and V. O. Li: "Finding minimum rectilinear distance paths in the presence of barriers," Networks, 11, pp. 285-304, 1981
8. 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
9. J. S. B. Mitchell: "L1 shortest paths among polygonal obstacles in the plane," Algorithmica, 8, pp. 55-88, 1992
10. 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
11. Y. Kusakari, H. Suzuki, and T. Nishizeki, "Finding a shortest pair of paths on the plane with obstacles and crossing areas," Proc. o] ISAAC'95, Lect. Notes in Computer Science, Springer-Verlag, 1004, pp. 42-51, 1995
12. 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)
13. J-C. Latombe, Robot Motion Planning, Kluwer Academic Publ., Boston, 1991
14. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, John Wiley & Sons, Chichester, England, 1990
15. T. Ohtsuki(Editor), Layout Design and Verification, North-Holland, Amsterdam, 1986
16. F.P. Preparata, and M.I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.