Computing the Overlaps of Two Maps

DOI10.1007/978-3-319-39441-1_7zbMath1339.68269OpenAlexW2476025250MaRDI QIDQ2815189

Colin de la Higuera, Jean-Christophe Janodet

Publication date: 27 June 2016

Published in: Computational Topology in Image Context (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-39441-1_7

zbMATH Keywords

overlapping patternsoverlapsproduct map2D semi-open combinatorial maps

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Polynomial algorithms for open plane graph and subgraph isomorphisms
• Planar Subgraph Isomorphism Revisited
• A Polynomial Algorithm for Submap Isomorphism
• Planar Formulae and Their Uses
• Subgraph Isomorphism in Planar Graphs and Related Problems
• On the Complexity of Submap Isomorphism
• Combinatorial Maps

This page was built for publication: Computing the Overlaps of Two Maps