Efficient Search of Combinatorial Maps using Signatures

Stéphane Gosselin (1) , Christine Solnon (1) , Guillaume Damiand (1)

1 M2DisCo - Geometry Processing and Constrained Optimization

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.

Mots clés: signature; map isomorphism; Combinatorial map

Domaines: Algorithme et structure de données [cs.DS]

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