摘要
We present a tensor product formulation for Hilbert space-filling curves. Both recursive and iterative formulas are expressed. We view a Hilbert space-filling curve as a permutation which maps two-dimensional 2n×2n data elements stored in the row major or column major order to the order of traversing a Hilbert space-filling curve. The tensor product formula of Hilbert space-filling curves uses several permutation operations: stride permutation, radix-2 gray permutation, transposition, and antidiagonal transposition. The iterative tensor product formula can be manipulated to obtain the inverse Hilbert permutation. Also, the formulas are directly translated into computer programs which can be used in various applications including R-tree indexing, image processing, and process allocation, etc.
原文 | 英語 |
---|---|
主出版物標題 | Proceedings - 2003 International Conference on Parallel Processing, ICPP 2003 |
發行者 | Institute of Electrical and Electronics Engineers Inc. |
頁面 | 99-106 |
頁數 | 8 |
卷 | 2003-January |
ISBN(電子) | 0769520170 |
DOIs | |
出版狀態 | 已發佈 - 2003 |
事件 | 2003 International Conference on Parallel Processing, ICPP 2003 - Kaohsiung, 臺灣 持續時間: 10月 6 2003 → 10月 9 2003 |
會議
會議 | 2003 International Conference on Parallel Processing, ICPP 2003 |
---|---|
國家/地區 | 臺灣 |
城市 | Kaohsiung |
期間 | 10/6/03 → 10/9/03 |
ASJC Scopus subject areas
- 軟體
- 數學(全部)
- 硬體和架構