Computing homotopic shortest paths efficiently

Computational Geometry: Theory and Applications

Volumn 35, Issue 3, 2006, Pages 162-172

  Efrat, Alon ^a   Kobourov, Stephen G ^a   Lubiw, Anna ^b  

^a University of Arizona   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Homotopic shortest paths; Shortest path in a polygon

Indexed keywords

EID: 84867977487     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2006.03.003     Document Type: Article

References (17)

1. R. Bar-Yehuda, and B. Chazelle Triangulating disjoint Jordan chains International Journal of Computational Geometry and Applications 4 4 1994 475 481
2. S. Bespamyatnikh Computing homotopic shortest paths in the plane Journal of Algorithms 49 2 2003 284 303
3. S. Cabello, Y. Liu, A. Mantler, J. Snoeyink, Testing homotopy for paths in the plane, in: 18th Annual Symposium on Computational Geometry, 2002, pp. 160-169
4. B. Chazelle, A theorem on polygon cutting with applications, in: 23rd Annual Symposium on Foundations of Computer Science, 1982, pp. 339-349
5. B. Chazelle An algorithm for segment-dragging and its implementation Algorithmica 3 1988 205 221
6. R. Cole, A. Siegel, River routing every which way, but loose, in: 25th Annual Symposium on Foundations of Computer Science, 1984, pp. 65-73
7. M. de Berg, M. van Kreveld, M.H. Overmars, and O. Schwarzkopf Computational Geometry: Algorithms and Applications second ed. 2000 Springer-Verlag Berlin
8. C.A. Duncan, A. Efrat, S.G. Kobourov, C. Wenk, Drawing with fat edges, in: 9th Symposium on Graph Drawing (GD'01), September 2001, pp. 162-177
9. H. Edelsbrunner A note on dynamic range searching Bulletin of the European Association for Theoretical Computer Science 15 1981 34 40
10. A. Efrat, S. Kobourov, and A. Lubiw Computing homotopic shortest paths efficiently, Technical report, April 2002 http://www.arXiv.org/abs/cs/0204050
11. A. Efrat, S.G. Kobourov, M. Stepp, C. Wenk. Growing fat graphs, in: 18th Annual Symposium on Computational Geometry, 2002, pp. 277-278
12. S. Gao, M. Jerrum, M. Kaufmann, K. Mehlhorn, W. Rülling, C. Storb, On continuous homotopic one layer routing, in: 4th Annual Symposium on Computational Geometry, 1988, pp. 392-402
13. J. Hershberger, and J. Snoeyink Computing minimum length paths of a given homotopy class Computational Geometry: Theory and Applications 4 1994 63 97
14. D.T. Lee, and F.P. Preparata Euclidean shortest paths in the presence of rectilinear barriers Networks 14 3 1984 393 410
15. C.E. Leiserson, F.M. Maley, Algorithms for routing and testing routability of planar VLSI layouts, in: 17th Annual ACM Symposium on Theory of Computing, 1985, pp. 69-78
16. J.S.B. Mitchell, Geometric shortest paths and network optimization, in: J.-R. Sack, J. Urrutia (Eds.), Handbook of Computational Geometry, 1998
17. H. Samet The Design and Analysis of Spatial Data Structures 1989 Addison-Wesley Reading, MA