Topological models for boundary representation: a comparison with n-dimensional generalized maps
Computer-Aided Design - Beyond solid modelling
Marked Subgraph Isomorphism of Ordered Graphs
SSPR '98/SPR '98 Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Computer Vision and Image Understanding
Filtering for subgraph isomorphism
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Signatures of Combinatorial Maps
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Extracting plane graphs from images
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Efficient search of combinatorial maps using signatures
Theoretical Computer Science
A polynomial algorithm for submap isomorphism of general maps
Pattern Recognition Letters
Polynomial algorithms for subisomorphism of nD open combinatorial maps
Computer Vision and Image Understanding
Measuring the distance of generalized maps
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
From maximum common submaps to edit distances of generalized maps
Pattern Recognition Letters
A distance measure between labeled combinatorial maps
Computer Vision and Image Understanding
Polynomial algorithms for open plane graph and subgraph isomorphisms
Theoretical Computer Science
Mining spatiotemporal patterns in dynamic plane graphs
Intelligent Data Analysis - Dynamic Networks and Knowledge Discovery
| Hi-index | 0.00 |
In this paper, 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.