Implementation and Application of Intersection Operation Based on Run-Length Encoding

Considering the deficiency of direct-encoding raster data in computation efficiency and storage capacity, in this paper, a new run-length encoding data structure is proposed, which is suitable for algebraic operations and could optimize the algebraic operations that are based direct-encoding raster data. In this paper, the implementation of ldquointersectionrdquo operation based on this data structure is introduced; besides, all kinds of algebraic operations on the run-lengthpsilas attributes are realized in the process of implementation. The approach of this algorithm is firstly using a linked-list to store the run-length set of every raster row, then, for every to-be-operated run-length unit, executing the intersection operation on it with the run-length set of corresponding raster row, afterwards, inserting or deleting run-length unit while carrying out the algebraic operations on the attributes of run-length. This algorithm is fit for most raster operations, and has an advantage in data precision and computation efficiency compared with the direct-encoding raster data.