TY - GEN
T1 - Implementation of polygon overlay based on run-length encoding
AU - Wang, Jie Chen
AU - Shen, Ding Tao
AU - Cui, Can
PY - 2008
Y1 - 2008
N2 - Aiming at the low computation efficiency and storage insufficiency of direct-encoded raster data, a new data structure on the basis of run-length encoding has been proposed to optimize the algebraic operations that are based on direct-encoded raster data. In this paper, employing this new data structure, the realization of "intersection" is introduced; moreover, all kinds of algebraic operations on the run-length's attribute are performed during the realization process. Adopting this "intersection" operation to implement polygon overlay, the steps are as follows: firstly, convert the polygons on two different layers into run-length sets, and then intersect the run-length set of the base layer with the run-lengths of the adding layer, carrying out this "intersection" operation until obtain the resulting run-length set of the two layers, afterwards, extract the required run-length units according to different overlay modes, such as "Union" and "Erase", finally, vectiorize the run-lengths into polygons then output. In the process of overlapping, all kinds of polygon overlay modes have been realized, proving that the algorithm could be applied broadly.
AB - Aiming at the low computation efficiency and storage insufficiency of direct-encoded raster data, a new data structure on the basis of run-length encoding has been proposed to optimize the algebraic operations that are based on direct-encoded raster data. In this paper, employing this new data structure, the realization of "intersection" is introduced; moreover, all kinds of algebraic operations on the run-length's attribute are performed during the realization process. Adopting this "intersection" operation to implement polygon overlay, the steps are as follows: firstly, convert the polygons on two different layers into run-length sets, and then intersect the run-length set of the base layer with the run-lengths of the adding layer, carrying out this "intersection" operation until obtain the resulting run-length set of the two layers, afterwards, extract the required run-length units according to different overlay modes, such as "Union" and "Erase", finally, vectiorize the run-lengths into polygons then output. In the process of overlapping, all kinds of polygon overlay modes have been realized, proving that the algorithm could be applied broadly.
KW - GIS
KW - Polygon overlay
KW - Run-length encoding
UR - https://www.scopus.com/pages/publications/79951494068
U2 - 10.1109/CSSE.2008.1195
DO - 10.1109/CSSE.2008.1195
M3 - 会议稿件
AN - SCOPUS:79951494068
SN - 9780769533360
T3 - Proceedings - International Conference on Computer Science and Software Engineering, CSSE 2008
SP - 597
EP - 601
BT - Proceedings - International Conference on Computer Science and Software Engineering, CSSE 2008
T2 - International Conference on Computer Science and Software Engineering, CSSE 2008
Y2 - 12 December 2008 through 14 December 2008
ER -