The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
우리는 새로운 건축 방법을 개발합니다. n-차원 힐베르트 공간 채우기 곡선. 구성 방법에는 블록 할당, 회색 순열, 좌표 변환 및 재귀 구성의 네 단계가 포함됩니다. 우리는 텐서 곱 이론을 사용하여 방법을 공식화합니다. 안 n-2차원 힐베르트 공간 채우기 곡선r 각 차원의 요소는 2를 재배열하는 순열로 지정됩니다.rn C 언어에서는 행 주요 순서로, FORTRAN 언어에서는 열 주요 순서로 순회하는 순서로 저장된 데이터 요소입니다. n-차원 힐베르트 공간 채우기 곡선. 텐서곱 공식화 n차원 힐베르트 공간 채우기 곡선은 스트라이드 순열, 역순열 및 회색 순열을 사용합니다. 우리는 재귀적 및 반복적 텐서 곱 공식을 모두 제시합니다. n-차원 힐베르트 공간 채우기 곡선. 텐서 곱 공식은 다양한 응용 프로그램에서 사용할 수 있는 컴퓨터 프로그램으로 직접 변환됩니다. 프로그램 생성 과정은 논문에 설명되어 있습니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Chih-Sheng CHEN, Shen-Yi LIN, Min-Hsuan FAN, Chua-Huang HUANG, "A Novel Construction Method for n-Dimensional Hilbert Space-Filling Curves" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 7, pp. 1807-1815, July 2010, doi: 10.1587/transinf.E93.D.1807.
Abstract: We develop a novel construction method for n-dimensional Hilbert space-filling curves. The construction method includes four steps: block allocation, Gray permutation, coordinate transformation and recursive construction. We use the tensor product theory to formulate the method. An n-dimensional Hilbert space-filling curve of 2r elements on each dimension is specified as a permutation which rearranges 2rn data elements stored in the row major order as in C language or the column major order as in FORTRAN language to the order of traversing an n-dimensional Hilbert space-filling curve. The tensor product formulation of n-dimensional Hilbert space-filling curves uses stride permutation, reverse permutation, and Gray permutation. We present both recursive and iterative tensor product formulas of n-dimensional Hilbert space-filling curves. The tensor product formulas are directly translated into computer programs which can be used in various applications. The process of program generation is explained in the paper.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.1807/_p
부
@ARTICLE{e93-d_7_1807,
author={Chih-Sheng CHEN, Shen-Yi LIN, Min-Hsuan FAN, Chua-Huang HUANG, },
journal={IEICE TRANSACTIONS on Information},
title={A Novel Construction Method for n-Dimensional Hilbert Space-Filling Curves},
year={2010},
volume={E93-D},
number={7},
pages={1807-1815},
abstract={We develop a novel construction method for n-dimensional Hilbert space-filling curves. The construction method includes four steps: block allocation, Gray permutation, coordinate transformation and recursive construction. We use the tensor product theory to formulate the method. An n-dimensional Hilbert space-filling curve of 2r elements on each dimension is specified as a permutation which rearranges 2rn data elements stored in the row major order as in C language or the column major order as in FORTRAN language to the order of traversing an n-dimensional Hilbert space-filling curve. The tensor product formulation of n-dimensional Hilbert space-filling curves uses stride permutation, reverse permutation, and Gray permutation. We present both recursive and iterative tensor product formulas of n-dimensional Hilbert space-filling curves. The tensor product formulas are directly translated into computer programs which can be used in various applications. The process of program generation is explained in the paper.},
keywords={},
doi={10.1587/transinf.E93.D.1807},
ISSN={1745-1361},
month={July},}
부
TY - JOUR
TI - A Novel Construction Method for n-Dimensional Hilbert Space-Filling Curves
T2 - IEICE TRANSACTIONS on Information
SP - 1807
EP - 1815
AU - Chih-Sheng CHEN
AU - Shen-Yi LIN
AU - Min-Hsuan FAN
AU - Chua-Huang HUANG
PY - 2010
DO - 10.1587/transinf.E93.D.1807
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 2010
AB - We develop a novel construction method for n-dimensional Hilbert space-filling curves. The construction method includes four steps: block allocation, Gray permutation, coordinate transformation and recursive construction. We use the tensor product theory to formulate the method. An n-dimensional Hilbert space-filling curve of 2r elements on each dimension is specified as a permutation which rearranges 2rn data elements stored in the row major order as in C language or the column major order as in FORTRAN language to the order of traversing an n-dimensional Hilbert space-filling curve. The tensor product formulation of n-dimensional Hilbert space-filling curves uses stride permutation, reverse permutation, and Gray permutation. We present both recursive and iterative tensor product formulas of n-dimensional Hilbert space-filling curves. The tensor product formulas are directly translated into computer programs which can be used in various applications. The process of program generation is explained in the paper.
ER -