Abstract
In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, 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. Experimental results show that these signatures can be used to recognize images very efficiently. © Springer-Verlag Berlin Heidelberg 2009.
Author supplied keywords
Cite
CITATION STYLE
Gosselin, S., Damiand, G., & Solnon, C. (2009). Signatures of combinatorial maps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5852 LNCS, pp. 370–382). https://doi.org/10.1007/978-3-642-10210-3_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
