Abstract
The problem of simplifying a polygonal curve or chain is well studied and has many applications. The discrete Fréchet distance is a useful similarity measure for curves, which has been utilized for many real-world applications. When the curves are huge, a simplification algorithm is needed in order to reduce running times. In this paper we adapt some of the techniques of Driemel and Har-Peled [5] (for the continuous Fréchet distance) to obtain a universal approximate simplification of a given polygonal curve, under the discrete Fréchet distance.
Original language | English |
---|---|
Pages (from-to) | 22-27 |
Number of pages | 6 |
Journal | Information Processing Letters |
Volume | 132 |
DOIs | |
State | Published - 1 Apr 2018 |
Keywords
- Approximation algorithms
- Curve simplification
- Discrete Fréchet distance
- Polygonal curves
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications