A Polynomial Algorithm for Submap Isomorphism: Application to Searching Patterns in Images
Guillaume Damiand, Colin de la Higuera, Jean-Christophe Janodet, Emilie Samuel and Christine Solnon
In: 7th IAPR-TC-15 Workshop on Graph-based Representations in Pattern Recognition (GbR'09), 26-28 May 2009, Venice, Italy.
We address the problem of searching for a pattern in a plane graph, i.e., a planar drawing of a planar graph. To do that, we propose to model plane graphs with 2-dimensional combinatorial maps, which provide nice data structures for modelling the topology of a subdivision of a plane into nodes, edges and faces. We define submap isomorphism, we give a polynomial algorithm for this problem, and we show how this problem may be used to search for a pattern in a plane graph. First experimental results show the validity of this approach to efficiently search for patterns in images.