Computing minimum length paths of a given homotopy class

On the bit complexity of minimum link paths: superquadratic algorithms for problems solvable in linear time

Proceedings of the twelfth annual symposium on Computational geometry

Approximating monotone polygonal curves using the uniform metric

Proceedings of the twelfth annual symposium on Computational geometry

A path router for graph drawing

Proceedings of the fourteenth annual symposium on Computational geometry

Polytime algorithm for the shortest path in a homotopy class amidst semi-algebraic obstacles in the plane

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation

Simplifying a polygonal subdivision while keeping it simple

SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry

Hardware-assisted view-dependent map simplification

SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry

Testing Homotopy for paths in the plane

Proceedings of the eighteenth annual symposium on Computational geometry

Growing fat graphs

Proceedings of the eighteenth annual symposium on Computational geometry

Computing homotopic shortest paths in the plane

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

Optimal Polygon Cover Problems and Applcations

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation

Computing Homotopic Shortest Paths Efficiently

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms

Computing homotopic shortest paths in the plane

Journal of Algorithms

Curvature-bounded traversals of narrow corridors

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry

Tightening non-simple paths and cycles on surfaces

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation

Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004

Computing homotopic shortest paths efficiently

Computational Geometry: Theory and Applications

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

SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry

Optimal pants decompositions and shortest homotopic cycles on an orientable surface

Journal of the ACM (JACM)

Mutually visible agents in a discrete environment

ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62

Walking your dog in the woods in polynomial time

Proceedings of the twenty-fourth annual symposium on Computational geometry

Testing contractibility in planar rips complexes

Proceedings of the twenty-fourth annual symposium on Computational geometry

Efficient triangulation-based pathfinding

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1

Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time

Computational Geometry: Theory and Applications

A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation

Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004

Computing homotopic shortest paths efficiently

Computational Geometry: Theory and Applications

An approximate morphing between polylines

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII

Computational topology

Algorithms and theory of computation handbook

Median trajectories

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I

Shortest paths with arbitrary clearance from navigation meshes

Proceedings of the 2010 ACM SIGGRAPH/Eurographics Symposium on Computer Animation

Navigation queries from triangular meshes

MIG'10 Proceedings of the Third international conference on Motion in games

Testing a rotation axis to drain a 3D workpiece

Computer-Aided Design

Faster algorithms for minimum-link paths with restricted orientations

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures

A nearly optimal algorithm for finding L1shortest paths among polygonal obstacles in the plane

ESA'11 Proceedings of the 19th European conference on Algorithms

Tightening Nonsimple Paths and Cycles on Surfaces

SIAM Journal on Computing

Optimal paths for mutually visible agents

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Shortest non-crossing walks in the plane

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms

Minimum cuts and shortest non-separating cycles via homology covers

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms

Testing graph isotopies on surfaces

Proceedings of the twenty-eighth annual symposium on Computational geometry

Shortest path problem in rectangular complexes of global nonpositive curvature

Computational Geometry: Theory and Applications

Computing shortest homotopic cycles on polyhedral surfaces with hyperbolic uniformization metric

Computer-Aided Design

Simplifying massive contour maps

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Invariants for homology classes with application to optimal search and planning problem in robotics

Annals of Mathematics and Artificial Intelligence

Minimum-link paths revisited

Computational Geometry: Theory and Applications