| dc.contributor.author | Michelucci, D. | en_US |
| dc.contributor.author | Neveu, M. | en_US |
| dc.contributor.editor | Gershon Elber and Nicholas Patrikalakis and Pere Brunet | en_US |
| dc.date.accessioned | 2016-02-17T18:02:47Z | |
| dc.date.available | 2016-02-17T18:02:47Z | |
| dc.date.issued | 2004 | en_US |
| dc.identifier.isbn | 3-905673-55-X | en_US |
| dc.identifier.issn | 1811-7783 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.2312/sm.20041405 | en_US |
| dc.description.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. | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | I.3.3 [Computer Graphics] | en_US |
| dc.subject | Computational Geometry and Object Modeling | en_US |
| dc.title | Shortest Circuits with Given Homotopy in a Constellation | en_US |
| dc.description.seriesinformation | Solid Modeling | en_US |
| dc.description.sectionheaders | Posters Session | en_US |
| dc.identifier.doi | 10.2312/sm.20041405 | en_US |
| dc.identifier.pages | 297-302 | en_US |
