Shortest Circuits with Given Homotopy in a Constellation

Michelucci, D.; Neveu, M.

Shortest Circuits with Given Homotopy in a Constellation

Files

297-302_michelucci.pdf (514.93 KB)

Date

2004

Authors

Michelucci, D.
Neveu, M.

Publisher

The Eurographics Association

Abstract

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.

        @inproceedings{10.2312:sm.20041405
,
booktitle = {Solid Modeling
},
editor = {Gershon Elber and Nicholas Patrikalakis and Pere Brunet
},
title = {{Shortest Circuits with Given Homotopy in a Constellation
}},
author = {Michelucci, D. and 
Neveu, M.
},
year = {2004
},
publisher = {The Eurographics Association
},
ISSN = {1811-7783
},
ISBN = {3-905673-55-X
},
DOI = {10.2312/sm.20041405
}
}