东北大学学报:自然科学版 ›› 2019, Vol. 40 ›› Issue (7): 1061-1064.DOI: 10.12068/j.issn.1005-3026.2019.07.027

• 数学 • 上一篇    

基于活动标架对Hilbert曲线的研究

于延华, 刘玲, 杨云   

  1. (东北大学 理学院, 辽宁 沈阳110819)
  • 收稿日期:2018-05-07 修回日期:2018-05-07 出版日期:2019-07-15 发布日期:2019-07-16
  • 通讯作者: 于延华
  • 作者简介:于延华(1978-),女,湖北荆门人,东北大学副教授.
  • 基金资助:
    国家自然科学基金资助项目(11371080); 中央高校基本科研业务费专项资金资助项目(N170504014).

Study of Hilbert Curve Based on Moving Frame

YU Yan-hua, LIU Ling, YANG Yun   

  1. School of Sciences, Northeastern University, Shenyang 110819, China.
  • Received:2018-05-07 Revised:2018-05-07 Online:2019-07-15 Published:2019-07-16
  • Contact: YANG Yun
  • About author:-
  • Supported by:
    -

摘要: 现有刻画三维Hilbert曲线的算法大多是从始点到终点递归地计算节点坐标,针对此类算法迭代次数较多的问题,提出一种刻画三维Hilbert曲线的新算法.借助于构造活动标架,得到刚体运动下的不变量,即离散曲率挠率.考虑到活动标架,曲线节点将被重新编码.并建立曲线弯曲点位置编号与其对应的曲率挠率数对的映射,编写相应算法使其对任意编号n,能够输出该编号对应弯曲点的曲率挠率数对且画出弯曲点图象结构.相比于基于Matlab生成Hilbert曲线的算法Hilbert3(n),该算法不局限于曲线的阶数、不依赖相邻阶曲线节点坐标之间的迭代.实验结果表明此算法更加高效.

关键词: 活动标架, Hilbert曲线, 离散曲率, 离散挠率, 迭代

Abstract: Most algorithms for describing three-dimensional Hilbert curves calculate node coordinates from the start point to the end point recursively. Directing at the multiple iteration, a new algorithm was brought forth. By means of constructing moving frame, the invariants under rigid body motion are obtained, that is, discrete curvature and torsion. Considering moving frame, the nodes are recoded. Establishing a map between the inflection point location number and the discrete curvature and torsion of the inflection point, based on that, writing the corresponding algorithm to make it for any number n, the pairs of curvature torsion and the image structure corresponding to the inflection points can be output. Compared to the algorithm Hilbert3(n), the proposed algorithm is not limited to the order of the curve and does not depend on the iteration between the coordinates. Experimental results show that the algorithm is more efficient.

Key words: moving frame, Hilbert curve, discrete curvature, discrete torsion, iteration

中图分类号: