Representing geometric structures in d dimensions: topology and order
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Subdivisions of n-dimensional spaces and n-dimensional generalized maps
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Topological models for boundary representation: a comparison with n-dimensional generalized maps
Computer-Aided Design - Beyond solid modelling
Computer Vision and Image Understanding
Frequent subgraph mining in outerplanar graphs
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Topological model for 3D image representation: Definition and incremental extraction algorithm
Computer Vision and Image Understanding
A Polynomial Algorithm for Submap Isomorphism
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Polynomial algorithms for subisomorphism of nD open combinatorial maps
Computer Vision and Image Understanding
| Hi-index | 0.00 |
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.