两点已知时圆弧的近似拟合
Approximate Fitting of a Circular Arc When Two Points Are Known
摘要:
用圆弧逼近点的任务在许多应用中被执行,例如图像压缩、噪声过滤和特征识别。然而,执行大量圆弧拟合的算法的开发需要一种有效的方法来拟合复杂度为O(1)的圆弧。在[1]中描述了基于平方非对称矩阵的特征向量问题的这个任务的优雅解决方案。对于[2]中描述的压缩算法,当已知弧上的两个点时,有必要解决这个任务。本文介绍了一种不同的方法来有效地拟合圆弧,并解决了一个或两个点是已知的任务。
英文摘要:
The task of approximating points with circular arcs is performed in many applications, such as polyline compression, noise filtering, and feature recognition. However, the development of algorithms that perform a significant amount of circular arcs fitting requires an efficient way of fitting circular arcs with complexity O(1). The elegant solution to this task based on an eigenvector problem for a square nonsymmetrical matrix is described in [1]. For the compression algorithm described in [2], it is necessary to solve this task when two points on the arc are known. This paper describes a different approach to efficiently fitting the arcs and solves the task when one or two points are known.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。