| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document

Title:Delaunayeva triangulacija s prebirnim krogom
Authors:Meznarič, Gal (Author)
Žalik, Borut (Mentor) More about this mentor... New window
Files:.pdf UN_Meznaric_Gal_2017.pdf (2,75 MB)
MD5: 82ED143B2B2CE0CD966AE89E16C04DEE
Work type:Bachelor thesis/paper (mb11)
Typology:2.11 - Undergraduate Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V diplomski nalogi predstavimo problem Delaunayeve triangulacije na ravninski množici točk in njene pomembnejše lastnosti. Naredimo splošen pregled obstoječih metod izgradnje Delaunayeve triangulacije, več pozornosti pa namenimo metodi Delaunayeve triangulacije s prebirno premico, ki služi kot osnova algoritmu s prebirnim krogom. Glavni del diplomske naloge obsega podrobnejšo predstavitev vseh faz algoritma Delaunayeve triangulacije s prebirnim krogom, implementacijo tega algoritma in primerjavo hitrosti izvajanja z Žalikovim algoritmom s prebirno premico. Ugotovimo, da se poenostavljena verzija algoritma s prebirnim krogom obnese bolje od izvirne, a ne prehiti Žalikovega algoritma s prebirno premico.
Keywords:Delaunayeva triangulacija, algoritmi, računalniška geometrija
Year of publishing:2017
Publisher:G. Meznarič
COBISS_ID:20682262 New window
Categories:KTFMB - FERI
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
AddThis uses cookies that require your consent. Edit consent...

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.


License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:20.06.2017

Secondary language

Title:Delaunay triangulation with circle sweep
Abstract:A problem of computing the Delaunay triangulation of a set of 2D points and its related properties is considered in this thesis. An overview of existing computational methods is done at first. Focus is given to the sweep-line algorithm, which served as a basis for the circle-sweep algorithm. The central part of the thesis covers the presentation of the circle-sweep algorithm in detail, its implementation and comparison of spent CPU time in regard to the Žalik’s sweep-line algorithm. It was determined that the simplified version of the circle-sweep algorithm offers better performance in comparison to the original version, yet fails to surpass the Žalik’s sweep-line algorithm.
Keywords:Delaunay triangulation, algorithms, computer geometry


Leave comment

You have to log in to leave a comment.

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

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