| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Triangulirajmo mnogokotnik
Authors:ID Lamot, Marko (Author)
ID Žalik, Borut (Author)
ID Šumrada, Radoš (Reviewer)
ID Radovan, Dalibor (Reviewer)
Files:URL http://www.dlib.si/details/URN:NBN:SI:doc-GYTEF2XO
 
Language:Slovenian
Work type:Not categorized
Typology:1.04 - Professional Article
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V članku predstavljamo tehnike delitve mnogokotnikov v trikotnike oz. triangulacijo mnogokotnikov. Namen delitve mnogokotnikov je v poenostavitvi obdelovanja mnogokotnikov, saj so lahko le-ti v geodetskih aplikacijah zelo kompleksni (vsebujejo veliko število konkavnih oglišč, imajo ugnezdene luknje). Vsak mnogokotnik je mogoče triangulirati z vstavljanjem diagonal, karje razvidno iz dokaza o triangulaciji mnogokotnika. Obstaja veliko postopkov, ki uporabljajo to dejstvo, vendar pa je mogoče triangulirati mnogokotnike tudi s popolnoma drugimi pristopi. Algoritme delitve mnogokotnikov lahko delimo na tri skupine: algoritme, ki temeljijo na vstavljanju diagonale, algoritme, ki temeljijo na Delaunayevi triangulaciji inalgoritme, ki uporabljajo za delitev Steinerjeve točke.
Keywords:mnogokotnik, traingulacija mnogokotnikov, računalniška geometrija, algoritmi
Publisher:Zveza geodetov Slovenije
Year of publishing:2000
Number of pages:str. 42-52
Numbering:Letn. 44, št. 1-2
PID:20.500.12556/DKUM-53218 New window
UDC:681.3.019:514.116
ISSN on article:0351-0271
COBISS.SI-ID:5875222 New window
NUK URN:URN:SI:UM:DK:TZF9MOXB
Publication date in DKUM:10.07.2015
Views:2217
Downloads:63
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and 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:Geodetski vestnik
Shortened title:Geod. vestn.
Publisher:Zveza geodetov Slovenije
ISSN:0351-0271
COBISS.SI-ID:5091842 New window

Secondary language

Language:English
Abstract:This paper considers different approaches how to divide polygons into triangles what is known as a polygon triangulation. Polygons can be very complex in geodesic applications (they could have a lot concave vertices, they could contain holes) therefore there is often a need to decompose them into simpler components. Every polygon can be triangulated by inserting diagonals what is shown in the proof of existence of polygon triangulation. There are a lot of polygon triangulation techniques which use that fact. However, polygons can be triangulated by some other approaches, too. The algorithms performing polygon triangulation can be classified into three major groups: algorithms, which are based on diagonal insertion, algorithms, which are based on Delaunay triangulation, and algorithms using Steiner's points.
Keywords:polygon, polygon triangulation, computational geometry, algorithms


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica