Measuring the distance of generalized maps

DOI10.1007/978-3-642-20844-7_9MaRDI QIDQ3003450zbMATH OpenOpenAlexFDO

Authors Camille Combier, Guillaume Damiand, Christine Solnon

Publication date 27 May 2011

Published in Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20844-7_9

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Computing methodologies for image processing (68U10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Map edit distance versus graph edit distance for matching images
• Matching planar maps
• scientific article; zbMATH DE number 2079389
• On the complexity of submap isomorphism
• A unified linear-time algorithm for computing distance maps

Cited in

(8)

• Two theorems about similarity maps
• On the complexity of submap isomorphism and maximum common submap problems
• Riemann Maps and Diameter Distance
• Border operator for generalized maps
• Distance-squared mappings
• Map edit distance versus graph edit distance for matching images
• Waist of maps measured via Urysohn width
• Contiguity distance between simplicial maps

This page was built for publication: Measuring the distance of generalized maps

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