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

Fast calculating minimum distance between point and complex curve with subdivision approximating algorithm

LIAO Ping   

  1. College of Mechanical and Electrical Engineering,Central South University,Changsha 410083,China
  • Received:2008-02-19 Revised:2008-04-21 Online:2009-04-01 Published:2009-04-01
  • Contact: LIAO Ping

分割逼近法快速求解点到复杂平面曲线最小距离

廖 平   

  1. 中南大学 机电工程学院,长沙 410083
  • 通讯作者: 廖 平

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.

摘要: 建立了点到复杂平面曲线最小距离的数学模型,提出了快速计算点到复杂平面曲线最小距离的分割逼近算法。大量算例验证了该算法的有效性,其计算精确度高,可以达到任意给定的精度,非常适用于三坐标测量机的点相关数据处理,在工程上具有重要的实用价值。