Weighted minimum backward Fréchet distance

DOI10.1016/j.tcs.2019.03.015zbMath1423.68544OpenAlexW2401552927MaRDI QIDQ2317859

Jörg-Rüdiger Sack, Anil Maheshwari, Amin Gheibi

Publication date: 13 August 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.03.015

zbMATH Keywords

shortest pathsimilarity measurescomputational geometryvisibility graphbacktrackingFréchet distanceweighted polygonal curves

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Following a curve with the discrete Fréchet distance
• On graphs preserving rectilinear shortest paths in the presence of obstacles
• Minimizing Walking Length in Map Matching
• Local Area Prediction-Based Mobile Target Tracking in Wireless Sensor Networks
• DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES
• Determining approximate shortest paths on weighted polyhedral surfaces
• FRÉCHET DISTANCE PROBLEMS IN WEIGHTED REGIONS
• Mountain Climbing, Ladder Moving, and the Ring-Width of a Polygon
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Four Soviets Walk the Dog—with an Application to Alt's Conjecture
• The frechet distance revisited and extended
• Computing the Discrete Fréchet Distance in Subquadratic Time

This page was built for publication: Weighted minimum backward Fréchet distance