Shortest circuits with given homotopy in a constellation

Authors:
Dominique Michelucci;Marc Neveu
Affiliations:
University of Burgundy, Dijon, France;University of Burgundy, Dijon, France
Venue:
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Year:
2004

Citing 2
Cited 1

Shortest paths and networks

Handbook of discrete and computational geometry
Computational topology

Handbook of discrete and computational geometry

Robustness and Randomness

Reliable Implementation of Real Number Algorithms: Theory and Practice

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.