By Topic

Tensor product formulation for Hilbert space-filling curves

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Shen-Yi Lin ; Dept. of Inf. Eng. & Comput. Sci., Feng Chia Univ., Taichung, Taiwan ; Chih-Shen Chen ; Li Liu ; Chua-Huang Huang

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 2ntimes2n 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

Published in:

Parallel Processing, 2003. Proceedings. 2003 International Conference on

Date of Conference:

9-9 Oct. 2003