An envelope construction of a set of polygons in a land cadastre
Žalik, Borut
This paper describes an efficient algorithm for an envelope construction of a set of polygons, which abut exactly against each other along their edges--the situation is characteristic in a land ...cadastre. This feature allows an efficient algorithm to be implemented, which consists of three steps. At first, the common edges of neighboring polygons are eliminated. We call these edges twin edges. In the second step, an envelope is constructed using non-twin edges. For this task, a new algorithm using two binary trees is proposed. At the end, the spatial relationships between polygons forming the envelope are established. To accelerate the elimination of twin edges, a combination of a uniform plane subdivision and binary searching trees is used.The whole algorithm for envelope determination works in O(n log n) time, where n is the total number of the input edges. At the end, the algorithm is analyzed also regarding spent CPU time using different configurations of inputpolygons.
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.
