Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
Statistics
Login
First page
>
Show document
Show document
Title:
Polygon trapezoidation by sets of open trapezoids
Authors:
ID
Žalik, Borut
(
Author
)
ID
Jezernik, Anton
(
Author
)
ID
Rizman Žalik, Krista
(
Author
)
Files:
http://dx.doi.org/10.1016/S0097-8493(03)00151-1
Language:
English
Work type:
Unknown
Typology:
1.01 - Original Scientific Article
Organization:
FERI - Faculty of Electrical Engineering and Computer Science
Abstract:
A new efficient algorithm is described for the simple trapezoidation of polygons based on a sweep-line paradigm. As the sweep-line glides over the plane, a set of so-called open trapezoids is generated and maintained. It is shown that a boundary case (more polygon vertices are located on the sweep-line) can be solved safely and does not slow down the algorithm. If desired, the polygon holes can be trapezoidated simultaneously. This proposed algorithm when compared with the fastest known algorithm developed by Seidel resulted in more efficiency for different classes of polygons.
Keywords:
polygon
,
polygon decomposition
,
trapezoidation
,
computational geometry
Year of publishing:
2003
PID:
20.500.12556/DKUM-27707
UDC:
004.4:514.116
ISSN on article:
0097-8493
COBISS.SI-ID:
8326422
NUK URN:
URN:SI:UM:DK:INK4YUWH
Publication date in DKUM:
01.06.2012
Views:
2256
Downloads:
141
Metadata:
Categories:
Misc.
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Average score:
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Record is a part of a journal
Title:
Computers & Graphics
Shortened title:
Comput. graph.
Publisher:
Pergamon Press.
ISSN:
0097-8493
COBISS.SI-ID:
25264384
Secondary language
Language:
English
Keywords:
mnogokotniki
,
deljenje mnogokotnikov
,
trapezoidacija
,
računalniška geometrija
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
