Shortest circuits with given homotopy in a constellation

A polynomial method is described for computing the shortest circuit with a prescribed homotopy on a surface. The surface is not described by a mesh but by a constellation: a set of sampling points. Points close enough (their distance is less than a prescribed threshold) are linked with an edge: the induced graph is not a triangulation but still permits to compute homologic and homotopic properties. Advantages of constellations over meshes are their simplicity and robustness.

[1]  Joseph S. B. Mitchell,et al.  Shortest Paths and Networks , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

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

[3]  K. K. Nambiar,et al.  Foundations of Computer Science , 2001, Lecture Notes in Computer Science.

[4]  Gert Vegter,et al.  Computational Topology , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[5]  Bernard Péroche,et al.  Error-free boundary evaluation based on a lazy rational arithmetic: a detailed implementation , 1994, Comput. Aided Des..

[6]  William J. Cook,et al.  Combinatorial optimization , 1997 .