| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:APROKSIMATIVNI ALGORITEM ZA DOLOČANJE BISEKTORJA DVEH MNOŽIC TOČK V RAVNINI
Authors:ID Klasinc, Marjan (Author)
ID Podgorelec, David (Mentor) More about this mentor... New window
Files:.pdf UN_Klasinc_Marjan_2015.pdf (4,96 MB)
MD5: 1EA579AE5D1D563089CEFBD1E87DB47C
 
Language:Slovenian
Work type:Undergraduate thesis
Typology:2.11 - Undergraduate Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:Diplomska naloga se osredotoča na reševanje problema bisektorja med poljubnima množicama točk v ravnini. Prikažemo nekaj pristopov, ki bisektor izračunajo natančno, in tudi takšne, katerih rezultat je aproksimativen. Z lastno implementirano metodo tvorbe aproksimativnega bisektorja med množicama ugotavljamo, kolikšna je potrebna gostota vzorčenja množic, da dobimo bisektor, ki je za nas dovolj natančen. Ker lastna implementacija temelji na tvorbi Voronojevega diagrama nad dano množico točk, preučimo tudi različne postopke tvorbe le-tega. Prav tako primerjamo dobljene bisektorje med množicama pri različnih gostotah vzorčenja.
Keywords:računalniška geometrija, bisektor množic, Voronojev diagram, aproksimacija
Place of publishing:Maribor
Publisher:[M. Klasinc]
Year of publishing:2015
PID:20.500.12556/DKUM-47842 New window
UDC:004.925.8(043.2)
COBISS.SI-ID:19058710 New window
NUK URN:URN:SI:UM:DK:BCURZCBQ
Publication date in DKUM:29.05.2015
Views:1206
Downloads:140
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:APPROXIMATION ALGORITHM FOR BISECTOR DETERMINATION OF TWO POINT SETS IN PLANE
Abstract:This diploma work is focused on solving the problem of defining a bisector between any two point sets in plane. We show some approaches that calculate the exact bisector and also those that calculate the approximate solution. With our own implemented method of forming the approximate bisector between two point sets, we find out what is the needed sampling density of the two point sets, so that the obtained bisector is accurate enough for us. Because our own implementation is based on a formed Voronoi diagram based on the two given point sets, we also make a research on various methods of constructing Voronoi diagrams. We also compare the obtained bisectors among the two point sets each with different sampling density.
Keywords:computational geometry, bisector of two point sets, Voronoi diagram, approximation


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