Skip to Main content Skip to Navigation
Journal articles

Efficient Search of Combinatorial Maps using Signatures

Stéphane Gosselin 1 Christine Solnon 1 Guillaume Damiand 1
1 M2DisCo - Geometry Processing and Constrained Optimization
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : In this paper, we address the problem of computing canonical representations of n-dimensional combinatorial maps and of using them for efficiently searching for a map in a database. We define two combinatorial map signatures: the first one has a quadratic space complexity and may be used to decide of isomorphism with a new map in linear time whereas the second one has a linear space complexity and may be used to decide of isomorphism in quadratic time. We show that these signatures can be used to efficiently search for a map in a database.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00567332
Contributor : Guillaume Damiand <>
Submitted on : Friday, June 23, 2017 - 2:36:33 AM
Last modification on : Thursday, November 21, 2019 - 2:30:18 AM
Document(s) archivé(s) le : Wednesday, January 10, 2018 - 4:49:56 PM

File

tcs-gosselin-solnon-damiand.pd...
Files produced by the author(s)

Identifiers

Citation

Stéphane Gosselin, Christine Solnon, Guillaume Damiand. Efficient Search of Combinatorial Maps using Signatures. Theoretical Computer Science, Elsevier, 2011, 412 (15), pp.1392-1405. ⟨10.1016/j.tcs.2010.10.029⟩. ⟨hal-00567332v2⟩

Share

Metrics

Record views

298

Files downloads

200