| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:APROKSIMACIJA SREDNJE OSI ENOSTAVNIH MNOGOKOTNIKOV
Authors:ID Smogavec, Gregor (Author)
ID Žalik, Borut (Mentor) More about this mentor... New window
ID Podgorelec, David (Comentor)
Files:.pdf UNI_Smogavec_Gregor_2010.pdf (2,93 MB)
MD5: 2A2A8F079F5F6287780A3DA08BA76C45
PID: 20.500.12556/dkum/8041389f-bc31-49f0-997d-d7e1504e5e96
 
Language:Slovenian
Work type:Undergraduate thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:Srednja os mnogokotnika je množica središč maksimalnih notranjih krožnic v mnogokotniku. Uporablja se kot nepogrešljiv del pri reševanju različnih problemov, kot so razpoznavanje znakov, GIS, zaznavanje trkov, obdelava in analiza slik. Po definiciji dobimo eksaktno rešitev srednje osi, če v mnogokotnik vstavljamo krožnice, ki se stikajo z mejami mnogokotnika na vsaj dveh mestih, in povežemo sosednja središča le teh. Omenjeni pristop pa za posledico, razen eksaktne rešitve, potegne za sabo veliko časovno zahtevnost. To je glavni razlog, zakaj ima ta pristop omejeno uporabnost pri zgoraj omenjenih nalogah, če potrebujemo rešitev v realnem času. V diplomski nalogi predlagamo nov algoritem, ki se bo uspešno kosal s tem problemom. Algoritem deluje v štirih korakih. Najprej se zgradi omejena Delaunayeva triangulacija nad mnogokotnikom. Nato iz triangulacije izločimo odvečne trikotnike. Preostalo triangulacijo popravimo z dodajanjem Steinerjevih točk in nazadnje povežemo središča sosednjih si trikotnikov, da dobimo aproksimacijo srednje osi mnogokotnika. Meritve kažejo, da dobimo z našim algoritmom aproksimacijo srednje osi zelo hitro, kar nam daje možnost, da uporabimo algoritem v realno časovnih aplikacijah, kot na primer v robotizaciji.
Keywords:algoritem, računalniška geometrija, srednja os, triangulacija, središča maksimalnih krožnic
Place of publishing:Maribor
Publisher:[G. Smogavec]
Year of publishing:2009
PID:20.500.12556/DKUM-12792 New window
UDC:004.94(043.2)
COBISS.SI-ID:13786390 New window
NUK URN:URN:SI:UM:DK:HXH5U2LS
Publication date in DKUM:06.01.2010
Views:1999
Downloads:150
Metadata:XML DC-XML DC-RDF
Categories:KTFMB - FERI
:
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.

Secondary language

Language:English
Title:MEDIAL AXIS APROXIMATION OF SIMPLE POLYGONS
Abstract:Medial axis of a simple polygon is a set of centres of maximal inscribed discs. It is used as an essential part in a variety of applications like character recognition, GIS, collision detection, image processing and analysis. By definition, exact medial axis is obtained, if we put maximal circles in the polygon and connect the neighboring circles. Since exact computation of the medial axis is difficult and time consuming, it limits the above applications in a sense of real-time execution. Because of this, we propose an algorithm which finds an approximation of a medial axis. The algorithm works in four steps. Firstly, a constrained Delaunay triangulation is constructed. Then superfluous triangles are removed. The polygon is after that further triangulated with Steiner points to meet the criteria of introduced heuristics. The centres of gravity of neighboring triangles are connected and an approximation of the medial axis of a polygon is obtained. Experiments show that approximation of the medial axis is obtained very rapidly, what gives the possibility to use the algorithm in real-time applications; for example in robotics.
Keywords:algorithm, computer geometry, medial axis, triangulation, centres of maximal disks


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