Merging polygons with uncertain boundaries

Authors:
Gregor Klajnšek;Borut alik
Affiliations:
Faculty of Electrical Engineering and Computer Science, University of Maribor, Smetanova ul. 17, SI-2000 Maribor, Slovenia;Faculty of Electrical Engineering and Computer Science, University of Maribor, Smetanova ul. 17, SI-2000 Maribor, Slovenia
Venue:
Computers & Geosciences
Year:
2005

Citing 2
Cited 1

Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Matching and aligning features in overlayed coverages

Proceedings of the 6th ACM international symposium on Advances in geographic information systems

Original papers: A geometric and topological system for supporting agricultural subsidies in Slovenia

Computers and Electronics in Agriculture

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.