Download
PDF 1.27 MB
undergraduate thesis
18   12
K-D tree method for nearest neighbor in 3D point cloud
Stefan Radošević (2016)
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Computer Engineering and Automation
Chair of Computer Engineering
Cite this document...

Radošević, S. (2016). Izrada K-D stabla za pronalazak najbližeg susjeda u 3D oblaku točaka (Undergraduate thesis). Retrieved from https://urn.nsk.hr/urn:nbn:hr:200:141782

Radošević, Stefan. "Izrada K-D stabla za pronalazak najbližeg susjeda u 3D oblaku točaka." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2016. https://urn.nsk.hr/urn:nbn:hr:200:141782

Radošević, Stefan. "Izrada K-D stabla za pronalazak najbližeg susjeda u 3D oblaku točaka." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2016. https://urn.nsk.hr/urn:nbn:hr:200:141782

Radošević, S. (2016). 'Izrada K-D stabla za pronalazak najbližeg susjeda u 3D oblaku točaka', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 25 April 2019, https://urn.nsk.hr/urn:nbn:hr:200:141782

Radošević S. Izrada K-D stabla za pronalazak najbližeg susjeda u 3D oblaku točaka [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2016 [cited 2019 April 25] Available at: https://urn.nsk.hr/urn:nbn:hr:200:141782

S. Radošević, "Izrada K-D stabla za pronalazak najbližeg susjeda u 3D oblaku točaka", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2016. Available at: https://urn.nsk.hr/urn:nbn:hr:200:141782

Metadata
TitleIzrada K-D stabla za pronalazak najbližeg susjeda u 3D oblaku točaka
Title (english)K-D tree method for nearest neighbor in 3D point cloud
AuthorStefan Radošević
MentorIvan Aleksi (mentor)
Committee memberIvan Aleksi (predsjednik povjerenstva)
Committee memberHrvoje Glavaš (član povjerenstva)
Committee memberJosip Job (član povjerenstva)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
(Department of Computer Engineering and Automation)
(Chair of Computer Engineering)
Osijek
Defense date and country2016-09-28, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Program Engineering
Abstract
U radu je glavni zadatak analizirati K- dimenzijsko stablo i za odabranu točku u oblaku točaka pronaći, bez obzira što je K- dimenzijsko stablo nejednoliko raspoređeno, najbližega susjeda. Opisan je program C# pomoću kojega je zadani zadatak ostvaren. Opisana je platforma .NET Framework koja u kombinaciji s C# nudi mogućnost pisanja aplikacija za različite platforme kao što su mobilni uređaji, desktop računala ili web serveri. Također je objašnjeno K-dimenzijsko stablo, što je ono u biti, način na koji je konstruirano i način na koji se ono pretražuje. Opisan je algoritam za pronalazak najbližega susjeda u K- dimenzijskom stablu te je isti ostvaren u C# jeziku tako što je učitana slika koja predstavlja oblak točaka i ta je slika obrađena.
Abstract (english)
The paper's main taks is to analyze K-dimensional tree and for the selected point in point cloud, not matter if K-D tree is unevenly distributed, to find the nearest neighbor. Described a program, called C# which is used for realizing the given task. Then, described the platform .NET Framework, which in combination with C# provides the ability to write applications for various platforms such as mobile devices, desktop computers or web servers. Also, it is explained K-dimensional tree, what it is, the way it is constructed and the way in which can be searched. Descrobed the algorithm for finding nearest neighbors in the K-dimensional tree and that algorithm is realized in the C# programming languange in a way that the loaded image representing the point cloud and the image processing.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:141782
Study programmeTitle: Računarstvo
Study programme type: sveučilišni
Study level: preddiplomski
Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
Type of resourcetext
File originBorn digital
Access conditionsOpen access
Terms of usehttp://rightsstatements.org/vocab/InC/1.0/
Created on2016-11-07 10:18:17