Merging polygons with uncertain boundaries

This paper considers an algorithm for merging a set of polygons forming land-cadastre, when the topological consistency of the polygons is not assured. In this case the polygon edges do not abut exactly, thus forming undesired gaps or overlaps. Polygons containing at least one uncertain edge are called uncertain polygons. The algorithm firstly discovers those areas with topological inconsistencies; this task is accelerated by the use of a so-called sweep-band having a width of ɛ-distance. Uncertain edges are then linked into edge chains and removed. Distinctive edges, edges separating the certain parts of polygons from the uncertain ones, are then used to form the result, i.e. the set of merged polygons.