Computing the overlaps of two maps

DOI10.1007/978-3-319-39441-1_7MaRDI QIDQ2815189zbMATH OpenOpenAlexFDO

Authors Jean-Christophe Janodet, Colin de la Higuera

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

2D semi-open combinatorial mapsoverlapping patternsoverlapsproduct map

Mathematics Subject Classification ID

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

Recommendations

• On the complexity of submap isomorphism and maximum common submap problems
• On the complexity of submap isomorphism
• A Polynomial Algorithm for Submap Isomorphism
• Implements of some new algorithms for combinatorial maps
• Signatures of combinatorial maps

Cites work

• A Polynomial Algorithm for Submap Isomorphism
• Combinatorial maps. Efficient data structures for computer graphics and image processing
• scientific article; zbMATH DE number 3489159 (Why is no real title available?)
• On the complexity of submap isomorphism
• Planar Formulae and Their Uses
• Planar subgraph isomorphism revisited
• Polynomial algorithms for open plane graph and subgraph isomorphisms
• Subgraph Isomorphism in Planar Graphs and Related Problems

Cited in

(4)

• On the complexity of submap isomorphism and maximum common submap problems
• On the complexity of submap isomorphism
• Efficient search of combinatorial maps using signatures
• The computation of megamaps

This page was built for publication: Computing the overlaps of two maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815189)