We study 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 discrete sets of points, line segments, and convex polygons. We are interested in finding the shortest subsequence of uncertain points such that no matter what the true location of each point is, the resulting polygonal curve is a valid simplification of the original curve under the Hausdorff distance. We present polynomial-time algorithms for this problem.
|Status||Gepubliceerd - 7 apr. 2021|
|Evenement||37th European Workshop on Computational Geometry - Online, Saint Petersburg, Rusland|
Duur: 7 apr. 2021 → 9 apr. 2021
|Congres||37th European Workshop on Computational Geometry|
|Verkorte titel||EuroCG 2021|
|Periode||7/04/21 → 9/04/21|