摘要
本文设计了任意维空间中具有线性复杂度的希尔伯特序编码解码算法并提出了希尔伯特空间填充曲线的一种变体.本文同时对编码解码算法进行了改进,设计了复杂度更低的算法,降低了计算量.文中给出的希尔伯特空间填充曲线的变体保证曲线的编码顺序不随曲线阶数的改变而变化.
We designed encoding and decoding algorithms for high dimensional Hilbert order. Hilbert order has good locality, and it has wide applications in various fields in computer science, such as memory management, database, and dynamic load balancing. We analyzed existing algorithms for computing 2D and 3D Hilbert order, and designed improved Mgorithms for computing Hilbert order in arbitrary space dimensions. We also proposed an alternate form of Hilbert space filling curve which has the advantage of preserving the ordering between different levels.
出处
《数值计算与计算机应用》
CSCD
2015年第1期42-58,共17页
Journal on Numerical Methods and Computer Applications
基金
国家973项目(2011CB309703)
国家863项目(2012AA01A309)
国家自然科学基金(11171334
11321061
11101417)
中国科学院国家数学与交叉科学中心资助
