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:
INKREMENTALNO ISKANJE NAJBLIŽJE TOČKE Z UPORABO K-D DREVESA
Authors:
ID
Mlinar, Peter
(
Author
)
ID
Podgorelec, David
(
Mentor
)
More about this mentor...
Files:
VS_Mlinar_Peter_2015.pdf
(2,18 MB)
MD5: AD29AFB8E32BAE4556E35AE125780F3F
Language:
Slovenian
Work type:
Undergraduate thesis
Typology:
2.11 - Undergraduate Thesis
Organization:
FERI - Faculty of Electrical Engineering and Computer Science
Abstract:
V diplomski nalogi so predstavljeni inkrementalno iskanje najbližje točke v ravnini z uporabo k-d drevesa in splošni problemi inkrementalnega iskanja. Omenjene so nekatere prednosti in slabosti k-d dreves. Dotaknemo se tudi drugih znanih metod iskanja najbližje točke in njihovih problemov. Poizkušali smo odpraviti probleme z iskanjem v neugodnih razporeditvah točk, ki jih srečajo npr. algoritmi z delitvijo ravnine na trakove. Za testiranje je bil implementiran tudi program, s katerim smo izvajali meritve nad algoritmi k-d drevesa.
Keywords:
iskanje najbližje točke
,
binarno iskalno drevo
,
k-d drevo
,
porazdelitev točk
,
delitev ravnine
Place of publishing:
Maribor
Publisher:
[P. Mlinar]
Year of publishing:
2015
PID:
20.500.12556/DKUM-47858
UDC:
004.422.635.33(043.2)
COBISS.SI-ID:
19058198
NUK URN:
URN:SI:UM:DK:WPTRZJKN
Publication date in DKUM:
29.05.2015
Views:
1362
Downloads:
156
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:
K-d tree based nearest point search
Abstract:
In this paper we present an incremental nearest-point search by means of a two-dimensional k-d tree. Some general problems of the incremental nearest point searching are also mentioned. We specify advantages and disadvantages of k-d trees and try to solve some point distribution problems for algorithms with overpopulated strip splitting. A testing program was also developed, for measuring the algorithm execution times of k-d trees-based nearest-point search.
Keywords:
nearest point search
,
binary search tree
,
k-d tree
,
point distributions
,
plane subdivision
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
