On performance of quadrant-recursive spatial orders

摘要

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.