面状矢量拓扑数据快速栅格化算法
A Fast Algorithm for Rasterizing Topological Region Vector Data
-
摘要: 针对GIS面状拓扑数据,提出了一种快速栅格化算法———差分边界标志与累加扫描算法.首先对所有的面状拓扑数据中的弧段进行顺序扫描,在栅格缓冲区中利用差分边界标志法进行边界标志,然后利用累加扫描线法对栅格缓冲区的各行从左至右进行累加扫描充填.该算法不仅实现简单,而且由于算法中充分利用了弧段的拓扑特征,避免了多边形区域的组织和弧段的重复处理,从而保证了海量面状拓扑数据栅格化的效率;同时还对栅格化算法中的退化问题提出了解决方案.实际应用表明,文中算法具有较高的效率和较强的实用性.Abstract: Aiming to rasterize topological region data in GIS, we present a fast algorithm named as difference boundary-labeling and accumulating-scan algorithm. By the method, at first the system scan orderly all the arcs in the topological region data, and label the boundaries in the raster buffer by means of difference boundary-labeling algorithm. Then all the pixels at each row in raster buffer is filled up from left to right using accumulating-scan algorithm. The algorithm is not only easy to be implemented, but I can also avoid the construction of regions and repeated processing of arcs as it makes full use of the arcs' characteristics. High efficiency could be achieved by using this fast algorithm when rasterizing massive topological region data. In the paper we also discussed the degradation facts and gave our solutions. The experiment showed that the algorithm is practical and highly efficient.
下载: