Uncertain Curve Simplification

03/16/2021
by   Kevin Buchin, et al.
0

We study the problem of polygonal curve simplification under uncertainty, where instead of a sequence of exact points, each uncertain point is represented by a region, which contains the (unknown) true location of the vertex. The regions we consider are disks, line segments, convex polygons, and discrete sets of points. We are interested in finding the shortest subsequence of uncertain points such that no matter what the true location of each uncertain point is, the resulting polygonal curve is a valid simplification of the original polygonal curve under the Hausdorff or the Fréchet distance. For both these distance measures, we present polynomial-time algorithms for this problem.

READ FULL TEXT

page 1

page 5

page 17

page 23

page 24

research
04/24/2020

Fréchet Distance for Uncertain Curves

In this paper we study a wide range of variants for computing the (discr...
research
11/27/2021

Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model

The k-center problem is to choose a subset of size k from a set of n poi...
research
03/17/2023

Connectivity with uncertainty regions given as line segments

For a set Q of points in the plane and a real number δ≥ 0, let 𝔾_δ(Q) be...
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
03/03/2020

About the Serpinsky-Knopp curve

The Serpinsky-Knopp curve is characterized as the only curve (up to isom...
research
01/29/2021

A Companion Curve Tracing Method for Rank-deficient Polynomial Systems

We propose a method for tracing implicit real algebraic curves defined b...
research
01/23/2017

Stay-point Identification as Curve Extrema

In a nutshell, stay-points are locations that a person has stopped for s...

Please sign up or login with your details

Forgot password? Click here to reset