National and University Library, Ljubljana (NUK)
Naročanje gradiva za izposojo na dom
Naročanje gradiva za izposojo v čitalnice
Naročanje kopij člankov
Urnik dostave gradiva z oznako DS v signaturi
  • Algorithm for joining a set of polygons with unstable borders
    Klajnšek, Gregor ; Žalik, Borut
    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 unstable edge are called unstable 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. Unstable edges are then linked into edge chains and removed. Distinctive edges, edges separating the stable parts of polygons from the unstable ones, are then used to form the result, i.e. the set of merged polygons. The proposed solution was compared with the brute force approach and turned out to be much more efficient.
    Type of material - treatise, study
    Publication and manufacture - Maribor : Faculty of Electrical Engineering and Computer Science, Laboratory for geometric modelling and multimedia algorithms, 2003
    Language - english
    COBISS.SI-ID - 13070870

Call number – location, accession no. ... Copy status
glavno skladišče 609644/2003 see publication
loading ...
loading ...
loading ...