diplomsko delo
Peter Mlinar (Author), David Podgorelec (Mentor)

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

računalniške aplikacije;programiranje;iskanje najbližje točke;binarno iskalno drevo;k-d drevo;inkrementalno iskanje;porazdelitev točk;delitev ravnine;algoritmi;diplomske naloge;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher: [P. Mlinar]
UDC: 004.422.635.33(043.2)
COBISS: 19058198 Link will open in a new window
Views: 713
Downloads: 61
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: K-d tree based nearest point search
Secondary 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.
Secondary keywords: computer applications;search;nearest point search;binary search tree;k-d tree;point distributions;plane subdivisions;algorithms;
URN: URN:SI:UM:
Type (COBISS): Undergraduate thesis
Thesis comment: Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Računalništvo in informatika
Pages: X, 41 str.
ID: 8751718