UNI-MB - logo
UMNIK - logo
 
(UM)
  • Comparing two sets of polygons in land cadastre
    Gomboši, Matej ; Žalik, Borut
    In this report, a new algorithm for determining differences between land cadastre polygons is considered. For this task, it has been proven, that it is enough to test only the polygon edges to ... perform the comparison. The algorithm works in two steps. First, the polygon edges are inserted into data structure and eliminated by a simple criterion. In the second part, the algorithem analyses the remaining edges and prepares the report about the detected differences. To speed-up the geometric search, the algorithm uses a combination of a uniform space subdivision and binary search trees. It has been shown, that the algorithmn is numerically stable, and works well also with the limited set of non-simple polygons occurring in practice. The algorithm's time complexity is O(n logn), and space complexity 0(n) where n is the common number of edges in both sets of polygons. That has been confirmed by experiments using data sets from a cadastre database.
    Type of material - treatise, study
    Publication and manufacture - Maribor : Faculty of Electrical Engineering and Computer Science, Laboratory for geometric modelling and multimedia algorithms, 2002
    Language - english
    COBISS.SI-ID - 13070102