Thick non-crossing paths and minimum-cost flows in polygonal domains

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2007, Pages 56-65

  Polishchuk, Valentin ^a   Mitchell, Joseph S B ^b  

^a USA   (United States)

^b HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

Data structures; Geometric shortest paths; Minimum cost flows

Indexed keywords

GEOMETRIC SHORTEST PATHS; MINIMUM COST FLOWS; PSEUDOPOLYNOMIAL TIME ALGORITHM;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

COMPUTATIONAL GEOMETRY;

EID: 35348835407     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247069.1247079     Document Type: Conference Paper

References (31)

1. P. K. Agarwal and M. Sharir. Arrangements and their applications. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 49-119. Elsevier Science B.V. North-Holland, Amsterdam, 2000.
2. A. Aggarwal, M. M. Klawe, S. Moran, P. W. Shor, and R. Wilber. Geometric applications of a matrix searching algorithm. In Proc. 2nd Annu. ACM Sympos. Comput. Geom., pages 285-292, 1986.
3. O. Bastert and S. P. Fekete. Geometric wire routing. Technical Report 332, Zentrum für Angewandte Informatik, 1998.
4. S. Bespamyatnikh. Computing nomotopic shortest paths in the plane. J. Algorithms, 49(2):284-303, 2003.
5. S. Bespamyatnikh. Encoding homotopy of paths in the plane. In Proc. LATIN'04, LNCS 2976, pages 329-338, 2004.
6. S. Cabello, Y. Liu, A. Mantler, and J. Snoeyink. Testing homotopy for paths in the plane. In SCG '02: Proceedings of the eighteenth annual symposium on Computational geometry, pages 160-169, New York, NY, USA, 2002.
7. F. Chin, J. Snoeyink, and C. A. Wang. Finding the medial axis of a simple polygon in linear time. Discrete Comput. Geom., 21(3):405-420, 1999.
8. R. Cole and A. Siegel. River routing every which way, but loose. In Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci., pages 65-73, 1984.
9. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997.
10. A. Efrat, S. Kobourov, M. Stepp, and C. Wenk. Growing fat graphs. In SCG '02: Proceedings of the eighteenth annual symposium on Computational geometry, pages 277-278, New York, NY, USA, 2002. ACM Press.
11. A. Efrat, S. G. Kobourov, and A. Lubiw. Computing homotopic shortest paths efficiently. In Proceedings of the 10th Annual European Symposium on Algorithms, pages 411-423, London, UK, 2002. Springer-Verlag.
12. S. Gao, M. Jerrum, M. Kaufman, K. Mehlhorn, and W. Rülling. On continuous homotopic one layer routing. In SCG '88: Proceedings of the fourth annual symposium on Computational geometry, pages 392-402, New York, NY, USA, 1988. ACM Press.
13. L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. Tarjan. Linear time algorithms for visibility and shortest path problems inside simple polygons. In SCG '86, pages 1-13, New York, NY, USA, 1986. ACM Press.
14. J. Hershberger and J. Snoeyink. Computing minimum length paths of a given homotopy class. Comput. Geom. Theory Appl., 4:63-98, 1994.
15. S. Hirsch and E. Leiserowitz. Exact construction of minkowski sums of polygons and a disc with application to motion planning. Technical report ECG-TR181205-01, Tel-Aviv University, 2002.
16. H. v. d. Holst and J. C. d. Pina. Length-bounded disjoint paths in planar graphs. Discr. Appl. Math., 120(1-3):251-261, 2002.
17. C.-P. Hsu. General river routing algorithm. In Proceedings 20th conference on Design automation, pages 578-583, 1983.
18. K. Kedem, R. Livne, J. Pach, and M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom., 1:59-71, 1986.
19. Y. Kusakari, H. Suzuki, and T. Nishizeki. Finding a shortest pair of paths on the plane with obstacles and crossing areas. In J. S. et al., editor, Algorithms and Computation, pages 42-51. Springer, Berlin, 1995.
20. D. T. Lee, C. D. Yang, and C. K. Wong. Rectilinear paths among rectilinear obstacles. Discr. Appl. Math., 70:185-215, 1996.
21. C. E. Leiserson and F. M. Maley. Algorithms for routing and testing routability of planar VLSI layouts. In Proc. 17th Annu. ACM Sympos. Theory Comput., pages 69-78, 1985.
22. F. M. Maley. Single-Layer Wire Routing and Compaction. MIT Press, Cambridge, MA, 1990.
23. E. A. Melissaratos and D. L. Souvaine. On solving geometric optimization problems using shortest paths. In Proc. 6th Annu. ACM Sympos. Comput. Geom., pages 350-359, 1990.
24. J. S. B. Mitchell. On maximum flows in polyhedral domains. J. Comput. Syst. Sci., 40:88-123, 1990.
25. J. S. B. Mitchell. Geometric shortest paths and network optimization. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 633-701. Elsevier Science B.V. North-Holland, Amsterdam, 2000.
26. V. Polishchuk. Thick Non-Crossing Paths and Minimum-Cost Continuous Flows in Geometric Domains. PhD thesis. Stony Brook University, 2007.
27. E. Papadopoulou. Personal communication.
28. E. Papadopoulou. k-pairs non-crossing shortest paths in a simple polygon. Int. J. Comp. Geom. Appl., 9(6):533-552, 1999.
29. G. Strang. Maximal flow through a domain. Math. Program., 26:123-143, 1983.
30. J. Takahashi, H. Suzuki, and T. Nishizeki. Finding shortest non-crossing rectilinear paths in plane regions. In ISAAC, pages 98-107, 1993.
31. C.D. Yang, D. T. Lee, and C. K. Wong. On bends and lengths of rectilinear paths: a graph theoretic approach. Internat. J. Comput. Geom. Appl., 2(1):61-74, 1992.