不确定曲线的简化
Uncertain Curve Simplification
摘要：
研究了不确定性条件下的多边形曲线简化问题，其中每个不确定点用一个包含顶点真实位置的区域来表示，而不是用一系列精确点来表示.我们考虑的区域是圆盘、线段、凸多边形和离散点集。我们感兴趣的是找到不确定点的最短子序列，使得无论每个不确定点的真实位置是什么，得到的多边形曲线都是原始多边形曲线在Hausdorff或Fréchet距离下的有效简化。对于这两个距离的措施，我们提出了多项式时间算法这个问题。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
