Matching planar maps

DOI10.1016/S0196-6774(03)00085-3zbMATH Open1060.68125OpenAlexW2612776813MaRDI QIDQ4458868FDOQ4458868

Authors: Helmut Alt, Günter Rote, Carola Wenk, Alon Efrat 

Publication date: 14 March 2004

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-6774(03)00085-3

Recommendations

• scientific article; zbMATH DE number 2079389
• Planar maps
• Fitting planar graphs on planar maps
• Fitting Planar Graphs on Planar Maps
• scientific article; zbMATH DE number 1775439
• Generalized planar matching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45)

Cited In (36)

• Title not available (Why is that?)
• Global Curve Simplification
• Distance measures for geometric graphs
• Shape Matching by Random Sampling
• Title not available (Why is that?)
• Planarizing Gadgets for Perfect Matching Do Not Exist
• Fast algorithms for approximate Fréchet matching queries in geometric trees
• Map edit distance versus graph edit distance for matching images
• Skeleton-based recognition of shapes in images via longest path matching
• Checking similarity of planar figures
• Title not available (Why is that?)
• Approximating the \(\lambda \)-low-density value
• Improved algorithms for partial curve matching
• Measuring the distance of generalized maps
• Shape matching by random sampling
• Measuring similarity between curves on 2-manifolds via homotopy area
• On length-sensitive Fréchet similarity
• Conflating two polygonal lines
• Closest paths in graph drawings under an elastic metric
• Following a curve with the discrete Fréchet distance
• Distance measures for embedded graphs
• Pattern matching for sets of segments
• Discretely following a curve
• Title not available (Why is that?)
• Coastline matching via a graph-based approach
• Title not available (Why is that?)
• Fréchet distance with speed limits
• Computing the Fréchet distance between folded polygons
• Computing the Fréchet distance between piecewise smooth curves
• Jaywalking your dog: computing the Fréchet distance with shortcuts
• Matching general polygonal arcs
• Curve matching, time warping, and light fields: New algorithms for computing similarity between curves
• Distances between immersed graphs: metric properties
• Integrated shape-sensitive functional metrics
• Algorithms and Computation
• Minimizing walking length in map matching

This page was built for publication: Matching planar maps

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