Universal approximate simplification under the discrete Fréchet distance

Omrit Filtser

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


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 languageEnglish
Pages (from-to)22-27
Number of pages6
JournalInformation Processing Letters
StatePublished - 1 Apr 2018


  • Approximation algorithms
  • Curve simplification
  • Discrete Fréchet distance
  • Polygonal curves

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Universal approximate simplification under the discrete Fréchet distance'. Together they form a unique fingerprint.

Cite this