节点文献

点到二维隐式曲线的正交投影算法

Orthogonal projections algorithm for point onto implicit curves

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 徐海银方雄兵李婷李端玲

【Author】 Xu Haiyin1,2 Fang Xiongbing1 Li Ting1 Li Duanling3(1 College of Computer Science and Technology,Huazhong University of Science and Technology,Wuhan430074,China;2 The Media School,Bournemouth University,Poole,Dorset BH12 5BB,United Kingdom;3 Automation School,Beijing University of Posts and Telecommunications,Beijing 100876,China)

【机构】 华中科技大学计算机科学与技术学院波恩茅斯大学传媒学院北京邮电大学自动化学院

【摘要】 针对点到二维(2D)隐式曲线的正交投影问题,提出了一种稳定的几何迭代算法.分析隐式曲线在初始点处的曲率,将给定点向初始点处的切线或曲率圆作投影,并建立了追踪投影点的一阶和二阶泰勒迭代方法;在此基础上提出了基于曲率的步长控制策略;考虑到泰勒迭代方法产生的误差,进一步给出了基于梯度的迭代误差矫正方法.最后,给出了计算给定点到二维隐式曲线正交投影的完整算法.仿真结果表明,算法稳定、高效,收敛性良好.

【Abstract】 A geometric iteration algorithm for projecting a point onto planar implicit curves is presented.A first-order and a second-order Taylor′s algorithms for tracing the projections are established by analyzing the curvature of the implicit curve and projecting the given point onto the tangent or curvature circle at the initial point.A curvature based method for controlling iteration step is further proposed.Considering the iteration error brought by the aforementioned Taylor′s method,a gradient based method for correcting iteration errors is carried out.Complete algorithm for computing the orthogonal projection of a given point on a two-dimensional implicit curve is summarized ulitimatley.Simulations indicate that the proposed algorithm has good convergence,robustness and efficiency.

【基金】 国家自然科学基金资助项目(50705010);湖北省科技攻关项目(2006AA101C01);湖北省国际科技合作重点资助项目(HZW0050)
  • 【文献出处】 华中科技大学学报(自然科学版) ,Journal of Huazhong University of Science and Technology(Nature Science Edition) , 编辑部邮箱 ,2009年01期
  • 【分类号】TP391.41
  • 【被引频次】1
  • 【下载频次】159
节点文献中: 

本文链接的文献网络图示:

本文的引文网络