ALL libraries (COBIB.SI union bibliographic/catalogue database)
13.
Trapezoid polygon decomposition
Žalik, Borut ...
A efficient algorithm for simple polygons trapezoidation based on a sweep-line paradigm is described. As the sweep-line glides over the plane, a set of so-called open trapezoids is maintained. It is ...shown that boundary case (more polygon vertices are located on the sweep-line) is solved safely and do not slow-down the algorithm. If desired, the polygon holes trapezoidated in one pass, too, what is applicable in some applications. The proposed algorithm is faced with the fastest algorithm up to know developed by Seidel [2] and turns out as more efficient for different classes of polygons.
Type of material - treatise, study
Publication and manufacture - Maribor : Faculty of Electrical Engineering and Computer Science, Laboratory for geometric modelling and multimedia algorithms, 2002
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.
