A fast checking algorithm of overlay, repetition and disjoint errors in land spatial data

摘要

While in land spatial data processing or application, spatial relationship of land data features should be carefully checked to guarantee the data quality. For land use data or cadastral data, lots of spatial relation rules need GIS query functions to find the overlay or disjoint feature errors, for example, all the land use patches must conform to combine a non-overlay, non-repetition and continuous area. Currently, there are many types of spatial relationship like equality, contain, intersect, disjoint, overlay, contact etc, which can be utilized in GIS systems. Though each of them can find different data errors, they require in turn examining every pair of features separately and will be very time-consuming, especially when land use data contains large number of features or lots of the feature shapes are complicated, so for land spatial data management system, a fast algorithm is needed to systematically check variant data errors in a short time. In this paper, a new land data checking algorithm of overlay, repetition and disjoint errors is proposed. The main concept and detail steps of this algorithm are introduced and illustrated. Then an experiment on comparing this algorithm and a common algorithm which uses spatial query functions of GIS software in checking overlap, repetition, and disjoint errors for land use data is carried out. Results show that this algorithm has high efficiency than the other one.