Universal approximate simplification under the discrete Fréchet distance

DOI10.1016/j.ipl.2017.10.002zbMath1427.68335OpenAlexW2766854120MaRDI QIDQ1705647

Omrit Filtser

Publication date: 16 March 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2017.10.002

zbMATH Keywords

approximation algorithmspolygonal curvescurve simplificationdiscrete Fréchet distance

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• On the Chain Pair Simplification Problem
• Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
• Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
• Computing the Discrete Fréchet Distance in Subquadratic Time

This page was built for publication: Universal approximate simplification under the discrete Fréchet distance