Finding a region with the minimum total L1 distance from prescribed terminals

Algorithmica (New York)

Volumn 35, Issue 3, 2003, Pages 225-256

  Kusakari, Yoshiyuki ^a   Nishizeki, Takao ^b  

^a AKITA PREFECTURAL UNIVERSITY   (Japan)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

Facility location; L1 distance; Optimal region; Rectilinear shortest path

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

FACILITY LOCATION; OPTIMAL REGION; POLYGONAL VERTICES; RECTILINEAR SHORTEST PATH;

ALGORITHMS;

EID: 0942268472     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-002-0997-y     Document Type: Article

References (18)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. M. J. Atallah and D. Chen, Parallel rectilinear shortest paths with rectangular obstacles, Comput. Geom. Theory Appl., 1 (1991), 79-113.
3. 2) time, Proc. Third Annual ACM Symp. on Computational Geometry, Waterloo, Ontario, pp. 251-257, 1987.
4. P. J. de Rezende, D. T. Lee, and Y. F. Wu, Rectilinear shortest paths with rectangular barriers, Discrete Comput. Geom., 4 (1989), 41-53.
5. E. G. Gilbert and D. W. Johnson, Distance functions and their application to robot path planning in the presence of obstacles, IEEE Trans. Robotics Automation, RA-1(1) (1985), 21-30.
6. S. Guha and I. Suzuki, Proximity problems for points on a rectilinear plane with rectangular obstacles, Algorithmica, 17 (1997), 281-307.
7. J. JáJá, An Introduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1992.
8. P. N. Klein, A linear processor polylog-time algorithm for shortest paths in planar graphs, Proc. 34th Symp. on Foundations of Computer Science, pp. 259-270, 1993.
9. 1 distance from prescribed terminals, Proc. ISAAC '97, Lecture Notes in Computer Science 1350, pp. 324-333, Springer-Verlag, Berlin, 1997.
10. Y. Kusakari, H. Suzuki, and T. Nishizeki, Finding a shortest pair of paths on the plane with obstacles and crossing areas, Proc. ISAAC '95, Lecture Notes in Computer Science 1004, pp. 42-51, Springer-Verlag, Berlin, 1995.
11. Y. Kusakari, H. Suzuki, and T. Nishizeki, A shortest pair of paths on the plane with obstacles and crossing areas, Internat. J. Comput. Geom. Appl., 9(2), (1999), 151-170.
12. R. C. Larson and V. O. Li, Finding minimum rectilinear distance paths in the presence of barriers, Networks, 11 (1981), 285-304.
13. J.-C. Latombe, Robot Motion Planning, Kluwer, Boston, MA, 1991.
14. D. T. Lee, C. D. Yang, and T. H. Chen, Shortest rectilinear paths among weighted obstacles, Internat. J. Comput. Geom. Appl., 1 (1991), 109-204.
15. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Wiley, Chichester, 1990.
16. 1 shortest paths among polygonal obstacles in the plane, Algorithmica, 8 (1992), 55-88.
17. T. Ohtsuki (editor) Layout Design and Verification North-Holland, Amsterdam, 1986.
18. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.