Name
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. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.4230/LIPIcs.MFCS.2021.26 | MFCS |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kevin Buchin | 1 | 0 | 2.70 |
| Maarten Löffler | 2 | 551 | 62.87 |
| Aleksandr Popov | 3 | 0 | 1.01 |
| Marcel Roeloffzen | 4 | 3 | 3.84 |