含线段和圆弧的折线的最优压缩
Optimal Compression of a Polyline with Segments and Arcs
摘要:
本文描述了一种有效的方法,以最少的线段和弧的数量来构造一个合成图。虽然拟合圆弧的复杂度为O(1)(参见[1]和[2]),但主要的复杂度是检查结果圆弧是否在指定的公差范围内。还有额外的测试来检查端部和方向的变化(参见[3,第3节]和[4,第II. C和II.D节])。然而,在降低复杂性方面最重要的部分是能够细分弧段,以限制弧段拟合的数量[2]。本文描述的方法找到了一个压缩的线段和弧的数量最少的。
英文摘要:
This paper describes an efficient approach to constructing a resultant polyline with a minimum number of segments and arcs. While fitting an arc can be done with complexity O(1) (see [1] and [2]), the main complexity is in checking that the resultant arc is within the specified tolerance. There are additional tests to check for the ends and for changes in direction (see [3, section 3] and [4, sections II.C and II.D]). However, the most important part in reducing complexity is the ability to subdivide the polyline in order to limit the number of arc fittings [2]. The approach described in this paper finds a compressed polyline with a minimum number of segments and arcs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。