Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (10): 163-164.DOI: 10.3778/j.issn.1002-8331.2009.10.049
• 图形、图像、模式识别 • Previous Articles Next Articles
LIAO Ping
Received:
Revised:
Online:
Published:
Contact:
廖 平
通讯作者:
Abstract: The mathematical model of minimum distance between a point and a complex curve is established,the subdivision approximating algorithm for fast calculating the minimum distance between a point and complex curve is proposed.The effectiveness of algorithm is verified by a series of tests,it can obtain precision result,be realized easily using computer and be applied to three coordinate measuring machine,so it has important value in the engineering.
摘要: 建立了点到复杂平面曲线最小距离的数学模型,提出了快速计算点到复杂平面曲线最小距离的分割逼近算法。大量算例验证了该算法的有效性,其计算精确度高,可以达到任意给定的精度,非常适用于三坐标测量机的点相关数据处理,在工程上具有重要的实用价值。
LIAO Ping. Fast calculating minimum distance between point and complex curve with subdivision approximating algorithm[J]. Computer Engineering and Applications, 2009, 45(10): 163-164.
廖 平. 分割逼近法快速求解点到复杂平面曲线最小距离[J]. 计算机工程与应用, 2009, 45(10): 163-164.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2009.10.049
http://cea.ceaj.org/EN/Y2009/V45/I10/163