| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:INKREMENTALNO ISKANJE NAJBLIŽJE TOČKE S TRINIVOJSKIM RAZVRŠČANJEM TOČK V RAVNINI
Authors:ID Dimkov, Toše (Author)
ID Podgorelec, David (Mentor) More about this mentor... New window
Files:.pdf UNI_Dimkov_Tose_2011.pdf (4,18 MB)
MD5: 841FD4520B47F71C98803E6F38DE9B2B
PID: 20.500.12556/dkum/1285eaf1-cb7d-40b7-ad3f-0c2ef1257e2a
 
Language:Slovenian
Work type:Undergraduate thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V diplomskem delu je predstavljen nov algoritem za reševanje inkrementalnega problema najbližje točke v ravnini. Predhodna rešitev z enakomerno delitvijo ravnine na trakove se ni obnesla v primeru izrazito neenakomerno porazdeljenih točk, pa tudi njena izboljšava z enosmernim dinamičnim pristopom delitve na trakove lahko v praksi hitro naleti na porazdelitve točk, kjer se izkaže za neučinkovito. Prvotna ideja je bila zgolj kombinirati oba pristopa v trinivojsko organizacijo točk, a nismo bili povsem zadovoljni z rezultati, zato v delu predlagamo tudi nov pristop z dvosmerno dinamično delitvijo na trakove. Tako v horizontalnih kot v vertikalnih trakovih organiziramo točke v po dva deterministična seznama s preskakovanjem (DSL), iskanje točke pa potem poteka sočasno z izmenično rabo do osmih DSL. Nova rešitev doseže cilj, za katerega je bila zasnovana, in pogosto predstavlja boljšo alternativo kot do sedaj obstoječi algoritmi.
Keywords:inkrementalni problem najbližje točke, sekljalna tabela, deterministični seznam s preskakovanjem (DSL), iskanje najbližje točke, dvosmerna dinamična delitev ravnine na trakove, razpolavljanje DSL, trinivojsko razvrščanje točk
Place of publishing:Maribor
Publisher:[T. Dimkov]
Year of publishing:2011
PID:20.500.12556/DKUM-19843 New window
UDC:004.925:514.113(043.2)
COBISS.SI-ID:15300118 New window
NUK URN:URN:SI:UM:DK:NWPQ0DPW
Publication date in DKUM:05.09.2011
Views:2385
Downloads:215
Metadata:XML DC-XML DC-RDF
Categories:KTFMB - FERI
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and 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:INCREMENTAL NEAREST-POINT SEARCH WITH THREE-LEVEL POINT ARRANGEMENT IN PLANE
Abstract:In this thesis, we present a new algorithm for solving the incremental nearest-point problem. Some of the known solutions to date failed to provide competitive results in situations when the initial set of points is unequally dispersed over the plane. Further, the algorithm which splits the plane on equal strips and was intended to solve those situations can quickly run into sets of points where it was proven ineffective. The idea from the very same beginning was to combine both methods into three-level point arrangement but we did not get the desired result at the end. Thus, we present a new approach that applies the idea of dynamic two-way plane splitting. We arrange the points into horizontal and vertical strips, each strip containing two deterministic skip lists for storing the x and y coordinates of a point respectively. The nearest-point search is executed simultaneously among up to eight DSLs. The new solution meets our expectations and is often considered as better alternative to the best-known solutions to date.
Keywords:incremental nearest-point problem, hash table, deterministic skip-list (DSL), nearest-point search, dynamic two-way plane splitting, DSL splitting, three-level point arrangement


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica