On Spatial Orders and Location Codes

被引：7

作者：

Stocco, Leo J. ^{[1
]}

Schrack, Gunther ^{[1
]}

机构：

[1] Univ British Columbia, Dept Elect & Comp Engn, Vancouver, BC V6T 1Z4, Canada

来源：

IEEE TRANSACTIONS ON COMPUTERS | 2009年 / 58卷 / 03期

关键词：

Spatial order; location code; matrix multiplication; encryption; dilation; quadtree; octree;

D O I：

10.1109/TC.2008.171

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Spatial orders such as the Morton (Z) order, U-order, or X-order have applications in matrix manipulation, graphic rendering, and data encryption. It is shown that these spatial orders are single examples of entire classes of spatial orders that can be defined in arbitrary numbers of dimensions and base values. Second, an algorithm is proposed that can be used to transform between these spatial orders and Cartesian coordinates. It is shown that the efficiency of the algorithm improves with a larger base value. By choosing a base value that corresponds to the available memory page size, the computational effort required to perform operations such as matrix multiplication can be optimized.

引用

页码：424 / 432

页数：9

共 9 条

[1]

[Anonymous], 1890, Math. Ann.

[2]

Hilbert D., 1891, Mathematische Annalen, P459, DOI [10.1007/BF01199431, DOI 10.1007/BF01199431]

[3] EFFICIENT LINEAR QUADTREE CONSTRUCTION ALGORITHM [J].

HOLROYD, FC ;

MASON, DC .

IMAGE AND VISION COMPUTING, 1990, 8 (03) :218-224

[4]

LIU X, 1988, INT J GEOGR INF SYST, V12, P3

[5]

Morton G. M., 1966, COMPUTER ORIENTED GE

[6] FINDING NEIGHBORS OF EQUAL SIZE IN LINEAR QUADTREES AND OCTREES IN CONSTANT TIME [J].

SCHRACK, G .

CVGIP-IMAGE UNDERSTANDING, 1992, 55 (03) :221-230

[7]

STOCCO L, 1995, P IEEE PAC RIM C COM, P426

[8] A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels [J].

Valsalam, V ;

Skjellum, A .

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2002, 14 (10) :805-839

[9]

[No title captured]

← 1 →