An clipping general polygons in regular girds algorithm base on successive encoding
The application of clipping general polygons in regular grids occurs frequently in geographical information systems (GIS). In general terms, the polygons usually clip into rectangle one by one in the pretreatment section, which need high-performance computer and long-time running. And also in this condition the pretreatment section needs low-CPU and low-memory usage. To improving clipping general polygon in regular girds, a new algorithm is presented in this paper. We use a new successive encoding base on Cohen-Sutherland line clipping algorithm to clip the general polygon in regular grids. We call it Grid-Clipping algorithm. The algorithm is simple and easy to understand and implement. Lent n be the total number of edges of all the result polygons in the girds, our algorithm computes the operation in time O(n).
gird clipping general polygons successive encoding
LIZHI XIE PENG LI MINGQUAN ZHOU XUESONG WANG
State Key Laboratory of Cognitive Neuroscience and Learning Beijing Normal University Beijing, 10087 School of Education Technology Beijing Normal University Beijing, 100875, China College of Information Science and Technology Beijing Normal University Beijing, 100875, China
国际会议
太原
英文
709-713
2010-10-22（万方平台首次上网日期，不代表论文的发表时间）