Digital halftones by dot diffusion
ACM Transactions on Graphics (TOG)
Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Encoding and decoding the Hilbert order
Software—Practice & Experience
On operations of spatial ordering and location code
Applied Mathematics and Computation
On the ordering of multiattribute data in information retrieval systems
On the ordering of multiattribute data in information retrieval systems
| Hi-index | 0.48 |
The performance of many computational paradigms can be considerably improved by using appropriate quadrant-recursive spatial orders. The Hilbert order has received intensive interest in literature. Its encoding and decoding processes, however, are time-consuming. It is desired to design new spatial orders that are competitive with the Hilbert order in performance yet require simpler encoding and decoding procedures. In this paper, several new quadrant-recursive spatial orders are proposed. Of them the Q4 order behaves best, and its algorithm is more efficient than the corresponding algorithm of the Hilbert order.