undergraduate thesis
K-D tree method for nearest neighbor in 3D point cloud

Stefan Radošević (2016)
Metadata
TitleIzrada K-D stabla za pronalazak najbližeg susjeda u 3D oblaku točaka
AuthorStefan Radošević
Mentor(s)Ivan Aleksi (thesis advisor)
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.
KeywordsK-D tree point cloud .NET Framework C#
Parallel title (English)K-D tree method for nearest neighbor in 3D point cloud
Committee MembersIvan Aleksi (committee chairperson)
Hrvoje Glavaš (committee member)
Josip Job (committee member)
GranterSveučilište Josipa Jurja Strossmayera u Osijeku
Fakultet elektrotehnike, računarstva i informacijskih tehnologija Osijek
Lower level organizational unitsZavod za računalno inženjerstvo i automatiku
Katedra za računalno inženjerstvo
PlaceOsijek
StateCroatia
Scientific field, discipline, subdisciplineTECHNICAL SCIENCES
Computing
Program Engineering
Study programme typeuniversity
Study levelundergraduate
Study programmeUndergraduate University Study Programme in Computer Engineering
Academic title abbreviationuniv.bacc.ing.comp.
Genreundergraduate thesis
Language Croatian
Defense date2016-09-28
Parallel 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
Parallel keywords (Croatian)K-D stablo oblak točaka .NET Framework C#
Resource typetext
Access conditionOpen access
Terms of usehttp://rightsstatements.org/vocab/InC/1.0/
URN:NBNhttps://urn.nsk.hr/urn:nbn:hr:200:663405
CommitterAnka Ovničević