Computing homotopic shortest paths in the plane

[1]  James R. Munkres,et al.  Topology; a first course , 1974 .

[2]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[3]  Charles E. Leiserson,et al.  Optimal Placement for River Routing , 1983, SIAM J. Comput..

[4]  Ron Y. Pinter,et al.  River Routing: Methodology and Analysis , 1983 .

[5]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[6]  Richard Cole,et al.  River Routing Every Which Way, but Loose (Extended Abstract) , 1984, FOCS.

[7]  Dana S. Richards,et al.  Complexity of Single-Layer Routing , 1984, IEEE Transactions on Computers.

[8]  Charles E. Leiserson,et al.  Algorithms for routing and testing routability of planar VLSI layouts , 1985, STOC '85.

[9]  Kurt Mehlhorn,et al.  On continuous Homotopic one layer routing , 1988, SCG '88.

[10]  Jirí Matousek,et al.  Efficient partition trees , 1991, SCG '91.

[11]  Jirí Matousek.  Range searching with efficient hierarchical cuttings , 1992, SCG '92.

[12]  Bernard Chazelle,et al.  Cutting hyperplanes for divide-and-conquer , 1993, Discret. Comput. Geom..

[13]  Jirí Matousek,et al.  Range searching with efficient hierarchical cuttings , 1992, SCG '92.

[14]  John Hershberger,et al.  Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract) , 1991, WADS.

[15]  Reuven Bar-Yehuda,et al.  Triangulating disjoint Jordan chains , 1994, Int. J. Comput. Geom. Appl..

[16]  Dima Grigoriev,et al.  Computing Minimum-Link Path in a Homotopy Class amidst Semi-Algebraic Obstacles in the Plane , 1997, AAECC.

[17]  Dima Grigoriev,et al.  Polytime algorithm for the shortest path in a homotopy class amidst semi-algebraic obstacles in the plane , 1998, ISSAC '98.

[18]  Joseph S. B. Mitchell,et al.  Geometric Shortest Paths and Network Optimization , 2000, Handbook of Computational Geometry.

[19]  J. Sack,et al.  Handbook of computational geometry , 2000 .

[20]  Stephen G. Kobourov,et al.  Computing homotopic shortest paths efficiently , 2002, Comput. Geom..

[21]  Jack Snoeyink,et al.  Testing Homotopy for Paths in the Plane , 2002, SCG '02.

[22]  A. Blumberg.  BASIC TOPOLOGY , 2002 .

[23]  Quasi-optimal upper bounds for simplex range searching and new zone theorems , 1992, Algorithmica.

[24]  Leonidas J. Guibas,et al.  Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons , 1987, Algorithmica.

[25]  Bernard Chazelle.  An algorithm for segment-dragging and its implementation , 2005, Algorithmica.