Shortest non-crossing walks in the plane With Amir Nayyeri (original) (raw)
Related papers
Shortest Non-Crossing Walks in the Plane
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
Algorithms for finding noncrossing paths with minimum total length in plane graphs
Electronics and Communications in Japan (Part III: Fundamental Electronic Science)
k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
International Journal of Computational Geometry & Applications, 1999
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
Minimum-link paths among obstacles in the plane
Algorithmica, 1992
An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
Discrete and Computational …, 1997
Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time
Symposium on Computational Geometry, 1987
Shortest Paths Among Obstacles in the Plane
International Journal of Computational Geometry & Applications, 1996
Shortest Non-Crossing Rectilinear Paths in Plane Regions
International Journal of Computational Geometry & Applications, 1997
An efficient algorithm for finding a collision���free path among polyhedral obstacles
1990
Computing Shortest Paths in the Plane with Removable Obstacles
2018
Two-guard walkability of simple polygons
1998
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
SIAM Journal on Computing, 1999
Long Non-crossing Configurations in the Plane
Discrete & Computational Geometry, 2010
A linear-time algorithm for edge-disjoint paths in planar graphs
Combinatorica, 1995
The complexity of pebbling reachability and solvability in planar and outerplanar graphs
Discrete Applied Mathematics, 2014
Thick non-crossing paths and minimum-cost flows in polygonal domains
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07, 2007
Minimum-link shortest paths for polygons amidst rectilinear obstacles
Computational Geometry
The algebraic complexity of shortest paths in polyhedral spaces
1985
Puzzle – on the complexity of a path avoiding forbidden pairs of vertices
Science Park Research Organization & Counselling
Connecting obstacles in vertex-disjoint paths
Traversing a Set of Points with a Minimum Number of Turns
Discrete & Computational Geometry, 2009
Routing in grid graphs by cutting planes
ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research, 1995
Shortest path problem in rectangular complexes of global nonpositive curvature
Computational Geometry, 2013
Theory of Computing Systems, 2014
Edge-disjoint paths in planar graphs
Journal of Combinatorial Theory, Series B, 1985
Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time
2001
A branch-and-cut approach to the crossing number problem
Discrete Optimization, 2008
Shortest paths in simple polygons with polygon-meet constraints
2004
A near optimal algorithm for finding Euclidean shortest path in polygonal domain
ArXiv, 2010
Improved Fixed-Parameter Algorithms for Non-Crossing Subgraphs1
11
Touring a sequence of polygons
2003