Measuring the distance of generalized maps

DOI10.1007/978-3-642-20844-7_9zbMATH Open1381.05011OpenAlexW2170262926MaRDI QIDQ3003450FDOQ3003450

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

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

Mathematics Subject Classification ID

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

Cited In (8)

• Distance-squared mappings
• Border operator for generalized maps
• Riemann Maps and Diameter Distance
• Map edit distance versus graph edit distance for matching images
• Waist of maps measured via Urysohn width
• Two theorems about similarity maps
• On the complexity of submap isomorphism and maximum common submap problems
• 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)