MANIPULATING IMAGES BY USING RUN-LENGTH MORTON CODES

摘要

In this paper, we first present a variation of the 2-dimensional run-encoding, called the run-length Morton code encoding scheme, for compressing binary images, then we present efficient algorithms for manipulating set operations and performing conversions between the proposed encoding scheme and some well-known spatial data structures. The time complexities of set operations are linearly proportional to the size (number) of the run-length Morton codes and the time complexities of conversions are linearly proportional to the number of the nodes in the corresponding quadtree/bintree with respect to the run-length Morton codes.