Computing the overlaps of two maps - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Computing the overlaps of two maps


Two combinatorial maps M1 and M2 overlap if they share a sub-map, called an overlapping pattern, which can be extended without conflicting neither with M1 nor with M2. Isomorphism and subisomorphism are two particular cases of map overlaps which have been studied in the literature. In this paper, we show that finding the largest connected overlap between two combinatorial maps is tractable in polynomial time. On the other hand, without the connectivity constraint, the problem is NP-hard. To obtain the positive results we exploit the properties of a product map.
No file

Dates and versions

hal-01357912 , version 1 (30-08-2016)



Jean-Christophe Janodet, Colin de La Higuera. Computing the overlaps of two maps. 6th International Workshop on Computational Topology in Image Context (CTIC 2016), Jun 2016, Marseille, France. pp.65--76, ⟨10.1007/978-3-319-39441-1_7⟩. ⟨hal-01357912⟩
132 View
0 Download



Gmail Mastodon Facebook X LinkedIn More