ALL libraries (COBIB.SI union bibliographic/catalogue database)
13.
Merging polygons with uncertain boundaries
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 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 e-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.
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
