Analyzing changes between two sets of polygons using plane subdivision
Gomboši, Matej ; Žalik, Borut
In this article, a new algorithm for determining differences between two sets of polygons is considered. It has been pro ven 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 algorithm analyses the remaining edges and prepares a report about the detected differences. To speed-up the geometric search, the algorithm uses a combination of a uniform space subdivision and binary searching trees. It has been shown that the algorithm 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 log nj, and space complexity O(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 land cadastre.
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.
