An improved partitioning method for dissolving long and narrow patches

Abstract Partition strategies are the only way to resolve automatic generalization problems for massive map data. Nevertheless, when partition strategies are introduced to dissolve long and narrow patches, traditional partitioning methods are not conducive to balancing the computation load on machines, and grid boundaries easily affect dissolution accuracy and stability of the process. Hence, this paper proposes an improved partitioning method for dissolving long and narrow patches. First, the vast quantity of patches is roughly partitioned using regular grids, and then the grids are meticulously partitioned based on the area balance of long and narrow patches. Second, the topology is established and combined with the semantic information of the boundary arcs to correct the boundaries of the regular grids. Finally, the actual data from the national geographic census at 1:10000 scale (125779 patches) for Chishui City, Guizhou Province are used for validation. The results demonstrate that the proposed method is highly efficient and rational.