Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
