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:
ISKANJE NAJBLIŽJEGA SOSEDA Z UPORABO VORONOIJEVEGA DIAGRAMA
Authors:
ID
Žalar, Daniel
(
Author
)
ID
Žalik, Borut
(
Mentor
)
More about this mentor...
ID
Podgorelec, David
(
Comentor
)
Files:
VS_Zalar_Daniel_2010.pdf
(3,83 MB)
MD5: 9D74C94DCC677BEFDD2FADDD98E2AC91
PID:
20.500.12556/dkum/47b0752a-1273-4590-aea4-a64ff48a331a
Language:
Slovenian
Work type:
Undergraduate thesis
Organization:
FERI - Faculty of Electrical Engineering and Computer Science
Abstract:
V diplomskem delu najprej definiramo Voronoijev diagram, opišemo njegove lastnosti in naštejemo nekaj metod za njegovo konstrukcijo. Nato uporabimo implementacijo iz knjižnice Mesh in jo priredimo za iskanje najbližjega soseda dani točki. Predstavimo demonstracijski program, opravimo testiranje in komentiramo rezultate. Nazadnje opišemo uporabo razvite aplikacije.
Keywords:
algoritmi
,
računalniška geometrija
,
najbližja točka
,
Voronoijev diagram
Place of publishing:
Maribor
Publisher:
[D. Žalar]
Year of publishing:
2010
PID:
20.500.12556/DKUM-13845
UDC:
004.925.8
COBISS.SI-ID:
14098966
NUK URN:
URN:SI:UM:DK:VZ0KVVBC
Publication date in DKUM:
10.05.2010
Views:
2107
Downloads:
236
Metadata:
Categories:
KTFMB - FERI
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.
Secondary language
Language:
English
Title:
THE NEAREST NEIGHBOUR SEARCH USING VORONOI DIAGRAM
Abstract:
In this thesis, we first define Voronoijev diagram, describe its properties and name a few methods for its construction. Then we use the implementation from the library Mesh to find the nearest neighbour of a given point. We present a demonstration program, perform testing and comment the results. At the end, we describe the use of developed application.
Keywords:
algorithms
,
computational geometry
,
nearest point
,
Voronoi diagram
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
