Abstract
Generalized maps describe the subdivision of objects in cells, and incidence and adjacency relations between cells, and they are widely used to model 2D and 3D images. Recently, we have defined submap isomorphism, which involves deciding if a copy of a pattern map may be found in a target map, and we have described a polynomial time algorithm for solving this problem when the pattern map is connected. In this paper, we show that submap isomorphism becomes NP-complete when the pattern map is not connected, by reducing the NP-complete problem Planar-4 3-SAT to it.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Lienhardt, P.: N-dimensional generalized combinatorial maps and cellular quasi-manifolds. Computational Geometry and Applications 4(3), 275–324 (1994)
Fradin, D., Meneveaux, D., Lienhardt, P.: A hierarchical topology-based model for handling complex indoor scenes. Computer Graphics Forum 25(2), 149–162 (2006)
Braquelaire, J.P., Brun, L.: Image segmentation with topological maps and inter-pixel representation. Visual Communication and Image Representation 9(1), 62–79 (1998)
Damiand, G., de la Higuera, C., Janodet, J.-C., Samuel, É., Solnon, C.: A polynomial algorithm for submap isomorphism: Application to searching patterns in images. In: Torsello, A., Escolano, F., Brun, L. (eds.) GbRPR 2009. LNCS, vol. 5534, pp. 102–112. Springer, Heidelberg (2009)
Damiand, G., Solnon, C., de la Higuera, C., Janodet, J.C., Samuel, E.: Polynomial algorithms for subisomorphism of nd open combinatorial maps. Computer Vision and Image Understanding (CVIU) 115(7), 996–1010 (2011)
Combier, C., Damiand, G., Solnon, C.: From maximum common submaps to edit distances of generalized maps. Pattern Recognition Letters 33(15), 2020–2028 (2012)
Cook, S.A.: The complexity of theorem-proving procedures. In: ACM Symposium on Theory of Computing, pp. 151–158 (1971)
Jansen, K., Müller, H.: The minimum broadcast time problem for several processor networks. Theoretical Computer Science 147(1-2), 69–85 (1995)
Mohar, B.: A linear time algorithm for embedding graphs in an arbitrary surface. SIAM Journal on Discrete Mathematics 12(1), 6–26 (1999)
Combier, C., Damiand, G., Solnon, C.: Measuring the distance of generalized maps. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS, vol. 6658, pp. 82–91. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Solnon, C., Damiand, G., de la Higuera, C., Janodet, JC. (2013). On the Complexity of Submap Isomorphism. In: Kropatsch, W.G., Artner, N.M., Haxhimusa, Y., Jiang, X. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2013. Lecture Notes in Computer Science, vol 7877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38221-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-38221-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38220-8
Online ISBN: 978-3-642-38221-5
eBook Packages: Computer ScienceComputer Science (R0)