On length-sensitive Fréchet similarity

DOI10.1007/978-3-031-38906-1_15OpenAlexW4385359629MaRDI QIDQ6179412

Erfan Hosseini Sereshgi, Kevin Buchin, Brittany Terese Fasy, Carola Wenk

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-38906-1_15

zbMATH Keywords

curvespartial matchingFréchet distancegraphs in \(\mathbb{R}^2\)

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Fréchet distance with speed limits
• Distance measures for embedded graphs
• Similarity of polygonal curves in the presence of outliers
• On two geometric problems related to the travelling salesman problem
• Map Construction Algorithms
• Matching planar maps
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Hamilton Paths in Grid Graphs

This page was built for publication: On length-sensitive Fréchet similarity