On Optimal Polyline Simplification using the Hausdorff and Fréchet Distance

03/09/2018
by   Marc van Kreveld, et al.
0

We revisit the classical polygonal line simplification problem and study it using the Hausdorff distance and Fréchet distance. Interestingly, no previous authors studied line simplification under these measures in its pure form, namely: for a given ϵ > 0, choose a minimum size subsequence of the vertices of the input such that the Hausdorff or Fréchet distance between the input and output polylines is at most ϵ. We analyze how the well-known Douglas-Peucker and Imai-Iri simplification algorithms perform compared to the optimum possible, also in the situation where the algorithms are given a considerably larger error threshold than ϵ. Furthermore, we show that computing an optimal simplification using the undirected Hausdorff distance is NP-hard. The same holds when using the directed Hausdorff distance from the input to the output polyline, whereas the reverse can be computed in polynomial time. Finally, to compute the optimal simplification from a polygonal line consisting of n vertices under the Fréchet distance, we give an O(kn^5) time algorithm that requires O(kn^2) space, where k is the output complexity of the simplification.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/04/2021

Minimum-Complexity Graph Simplification under Fréchet-Like Distances

Simplifying graphs is a very applicable problem in numerous domains, esp...
research
02/02/2021

Optimal Intervention in Economic Networks using Influence Maximization Methods

We consider optimal intervention in the Elliott-Golub-Jackson network mo...
research
05/20/2021

Computing the Fréchet Distance Between Uncertain Curves in One Dimension

We consider the problem of computing the Fréchet distance between two cu...
research
10/27/2018

Minimizing Branching Vertices in Distance-preserving Subgraphs

It is NP-hard to determine the minimum number of branching vertices need...
research
09/26/2018

On Optimal Min-# Curve Simplification Problem

In this paper we consider the classical min--# curve simplification prob...
research
03/06/2019

The k-Fréchet distance

We introduce a new distance measure for comparing polygonal chains: the ...
research
12/02/2019

Capacity of the covariance perceptron

The classical perceptron is a simple neural network that performs a bina...

Please sign up or login with your details

Forgot password? Click here to reset