Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
Computational complexity of combinatorial surfaces
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Determining contractibility of curves
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Computing minimum length paths of a given homotopy class
Computational Geometry: Theory and Applications
Faster shortest-path algorithms for planar graphs
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Transforming curves on surfaces
Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
Computing a canonical polygonal schema of an orientable triangulated surface
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Dynamic generators of topologically embedded graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
Greedy optimal homotopy and homology generators
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Splitting (complicated) surfaces is hard
Proceedings of the twenty-second annual symposium on Computational geometry
Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time
Proceedings of the twenty-second annual symposium on Computational geometry
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
Journal of the ACM (JACM)
Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Multiple source shortest paths in a genus g graph
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Computing geometry-aware handle and tunnel loops in 3D models
ACM SIGGRAPH 2008 papers
Splitting (complicated) surfaces is hard
Computational Geometry: Theory and Applications
Testing contractibility in planar rips complexes
Proceedings of the twenty-fourth annual symposium on Computational geometry
Finding shortest contractible and shortest separating cycles in embedded graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition
ACM Transactions on Algorithms (TALG)
Cut locus and topology from surface point data
Proceedings of the twenty-fifth annual symposium on Computational geometry
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry
Finding shortest contractible and shortest separating cycles in embedded graphs
ACM Transactions on Algorithms (TALG)
Optimal homologous cycles, total unimodularity, and linear programming
Proceedings of the forty-second ACM symposium on Theory of computing
Finding shortest non-trivial cycles in directed graphs on surfaces
Proceedings of the twenty-sixth annual symposium on Computational geometry
Approximating loops in a shortest homology basis from point data
Proceedings of the twenty-sixth annual symposium on Computational geometry
ACM Transactions on Algorithms (TALG)
Shortest cut graph of a surface with prescribed vertex set
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
The tight orthogonal homotopic bases of closed oriented triangulated surfaces and their computing
Computers & Mathematics with Applications
Optimal Homologous Cycles, Total Unimodularity, and Linear Programming
SIAM Journal on Computing
Minimum cuts and shortest non-separating cycles via homology covers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A polynomial-time algorithm for planar multicuts with few source-sink pairs
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
An efficient computation of handle and tunnel loops via Reeb graphs
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Hi-index | 0.00 |
We describe algorithms to compute the shortest path homotopic to a given path, or the shortest cycle freely homotopic to a given cycle, on an orientable combinatorial surface. Unlike earlier results, our algorithms do not require the input path or cycle to be simple. Given a surface with complexity n, genus g ≥ 2, and no boundary, we construct in O(n2 log n) time a tight octagonal decomposition of the surface---a set of simple cycles, each as short as possible in its free homotopy class, that decompose the surface into a complex of octagons meeting four at a vertex. After the surface is preprocessed, we can compute the shortest path homotopic to a given path of complexity k in O(gnk) time, or the shortest cycle homotopic to a given cycle of complexity k in O(gnk log(nk)) time. A similar algorithm computes shortest homotopic curves on surfaces with boundary or with genus 1. We also prove that the recent algorithms of Colin de Verdière and Lazarus for shortening embedded graphs and sets of cycles have running times polynomial in the complexity of the surface and the input curves, regardless of the surface geometry.