多边形曲线的渐进简化
Progressive Simplification of Polygonal Curves
摘要:
多边形曲线在不同细节层次上的简化是许多应用中的一个重要问题。现有的几何优化算法只能最大限度地减少简化曲线的复杂性为一个单一的细节层次。我们提出了一个$O(n^3m)$的时间算法,需要一个多边形曲线的n个顶点,并产生一组一致的简化m尺度,同时最大限度地减少累积简化的复杂性。该算法与Hausdorff、Fréchet和基于区域的距离等距离度量兼容,并能够简化$O(n^5)$时间内的连续缩放。为了加快这种算法在实践中,我们提出了新的技术来构建和表示所谓的快捷图。这些技术对轨迹数据的实验评估显示,使用快捷图进行渐进和非渐进曲线简化在运行时间和内存使用方面都有显着改善。
英文摘要:
Simplifying polygonal curves at different levels of detail is an important problem with many applications. Existing geometric optimization algorithms are only capable of minimizing the complexity of a simplified curve for a single level of detail. We present an $O(n^3m)$-time algorithm that takes a polygonal curve of n vertices and produces a set of consistent simplifications for m scales while minimizing the cumulative simplification complexity. This algorithm is compatible with distance measures such as the Hausdorff, the Fréchet and area-based distances, and enables simplification for continuous scaling in $O(n^5)$ time. To speed up this algorithm in practice, we present new techniques for constructing and representing so-called shortcut graphs. Experimental evaluation of these techniques on trajectory data reveals a significant improvement of using shortcut graphs for progressive and non-progressive curve simplification, both in terms of running time and memory usage.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。