Computing the Fréchet gap distance
From MaRDI portal
Publication:2022625
DOI10.1007/s00454-020-00224-wzbMath1462.68205OpenAlexW3047460893MaRDI QIDQ2022625
Benjamin Raichel, Chenglin Fan
Publication date: 29 April 2021
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2017/7184/
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating the Fréchet distance for realistic curves in near linear time
- Can we compute the similarity between surfaces?
- Computing the Fréchet distance between piecewise smooth curves
- Algorithms for Reporting and Counting Geometric Intersections
- DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES
- Computing the Fréchet distance with shortcuts is NP-hard
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
- Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability
- Four Soviets Walk the Dog—with an Application to Alt's Conjecture
- Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
- The frechet distance revisited and extended
- Computing the Discrete Fréchet Distance in Subquadratic Time
This page was built for publication: Computing the Fréchet gap distance
