Uncertain Curve Simplification

DOI10.4230/LIPICS.MFCS.2021.26MaRDI QIDQ6168440zbMATH OpenOpenAlexFDO

Authors

Publication date 8 August 2023

Full work available at URL https://arxiv.org/abs/2103.09223

zbMATH Keywords

uncertaintyHausdorff distancecurvessimplificationFréchet distance

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Abstract: 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'echet distance. For both these distance measures, we present polynomial-time algorithms for this problem.

Recommendations

• Fréchet Distance for Uncertain Curves
• Uncertainty quantification and estimation of closed curves based on noisy data
• scientific article; zbMATH DE number 1114422
• Global Curve Simplification
• scientific article; zbMATH DE number 1405405
• Progressive simplification of polygonal curves

Cited in

(2)

• Fréchet Distance for Uncertain Curves
• Computing realistic terrains from imprecise elevations

This page was built for publication: Uncertain Curve Simplification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168440)