Greedy optimal homotopy and homology generators

We describe simple greedy algorithms to construct the shortest set of loops that generates either the fundamental group (with a given basepoint) or the first homology group (over any fixed coefficient field) of any oriented 2-manifold. In particular, we show that the shortest set of loops that generate the fundamental group of any oriented combinatorial 2-manifold, with any given basepoint, can be constructed in O(n log n) time using a straightforward application of Dijkstra's shortest path algorithm. This solves an open problem of Colin de Verdière and Lazarus.

[1]  Francis Lazarus,et al.  Optimal System of Loops on an Orientable Surface , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[2]  R. Ho.  Algebraic Topology , 2022 .

[3]  J. Tsitsiklis,et al.  Efficient algorithms for globally optimal trajectories , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[4]  R. Kimmel,et al.  Finding shortest paths on surfaces , 1994 .

[5]  Minoru Tanaka,et al.  Loki: Software for Computing Cut Loci , 2002, Exp. Math..

[6]  Bernard Chazelle,et al.  A minimum spanning tree algorithm with inverse-Ackermann type complexity , 2000, JACM.

[7]  D. Matula,et al.  Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane , 2010 .

[8]  John R Gilbert,et al.  A Separator Theorem for Graphs of Bounded Genus , 1984, J. Algorithms.

[9]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

[10]  Ron Kimmel,et al.  Texture Mapping Using Surface Flattening via Multidimensional Scaling , 2002, IEEE Trans. Vis. Comput. Graph..

[11]  Francis Lazarus,et al.  Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface , 2003, Graph Drawing.

[12]  Philip N. Klein,et al.  A randomized linear-time algorithm to find minimum spanning trees , 1995, JACM.

[13]  E. Margarita,et al.  On vector spaces associated with a graph , 1977 .

[14]  J A Sethian,et al.  Computing geodesic paths on manifolds. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[15]  Sanjiv Kapoor,et al.  Efficient computation of geodesic shortest paths , 1999, STOC '99.

[16]  Jeff Erickson,et al.  Optimally Cutting a Surface into a Disk , 2002, SCG '02.

[17]  J. Sethian,et al.  Fast methods for the Eikonal and related Hamilton- Jacobi equations on unstructured meshes. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[18]  Yijie Han,et al.  Shortest paths on a polyhedron , 1990, SCG '90.

[19]  I. Holopainen.  Riemannian Geometry , 1927, Nature.

[20]  Joseph Douglas Horton,et al.  A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph , 1987, SIAM J. Comput..

[21]  Anne Verroust-Blondet,et al.  Computing a canonical polygonal schema of an orientable triangulated surface , 2001, SCG '01.

[22]  J. Stillwell.  Classical topology and combinatorial group theory , 1980 .

[23]  Joseph O'Rourke,et al.  An Implementation of Chen & Han's Shortest Paths Algorithm , 2000, Canadian Conference on Computational Geometry.

[24]  Mikkel Thorup,et al.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.

[25]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[26]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[27]  David Eppstein,et al.  Dynamic generators of topologically embedded graphs , 2002, SODA '03.

[28]  Jonathan A. Kelner.  Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus , 2006, SIAM J. Comput..

[29]  Joseph S. B. Mitchell,et al.  The Discrete Geodesic Problem , 1987, SIAM J. Comput..