Grafični prikaz Kruskalovega algoritma v 3D prostoru : diplomsko delo

Cerar, Jurij

| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

First page > Show document

Show document

Title:	Grafični prikaz Kruskalovega algoritma v 3D prostoru : diplomsko delo
Authors:	ID Cerar, Jurij (Author) ID Kohek, Štefan (Mentor) More about this mentor... ID Strnad, Damjan (Comentor)
Files:	UN_Cerar_Jurij_2022.pdf (1,54 MB) MD5: 75DDCEEF3B94C1A8D1886D453374607F
Language:	Slovenian
Work type:	Bachelor thesis/paper
Typology:	2.11 - Undergraduate Thesis
Organization:	FERI - Faculty of Electrical Engineering and Computer Science
Abstract:	V diplomskem delu smo implementirali aplikacijo za demonstracijo Kruskalovega algoritma nad oblaki točk LiDAR v 3D prostoru ter izmerili čas algoritma in čas upodabljanja, kakor tudi pomnilniško zahtevnost algoritma. Poleg tega smo tudi primerjali uporabo evklidske razdalje in intenzitete kot cene povezav. Zato smo ustvarili namizno aplikacijo, ki prebere točke LiDAR in jih izriše v 3D prostoru. Nato izvede Kruskalov algoritem nad temi točkami ter prikaže vmesne rezultate algoritma. Zaradi velikega števila začetnih povezav grafa smo uvedli aproksimacijo s pomočjo enakomerne mreže. Ugotovili smo da je uporaba intenzitete kot cene hitrejša od uporabe evklidske razdalje. Ugotovili smo tudi, da poraba pomnilnika narašča linearno glede na število vozlišč. Poleg tega smo preučili, kako nam gradnja minimalnega vpetega drevesa omogoča lažje preučevanje točk.
Keywords:	Kruskalov algoritem, graf, format LAS, OpenGL
Place of publishing:	Maribor
Place of performance:	Maribor
Publisher:	[J. Cerar]
Year of publishing:	2022
Number of pages:	1 spletni vir (1 datoteka PDF (XII, 50 f.))
PID:	20.500.12556/DKUM-83494
UDC:	004.92.021(043.2)
COBISS.SI-ID:	146685187
Publication date in DKUM:	21.12.2022
Views:	753
Downloads:	85
Metadata:
Categories:	KTFMB - FERI
:	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.

Licences

License:	CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Link:	http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:	The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:	05.12.2022

Secondary language

Language:	English
Title:	Graphical display of Kruskal's algorithm in 3D space
Abstract:	In this thesis, we implemented an application for the demonstration of Kruskal's algorithm in 3D space on LiDAR point cloud, and measured the time of the algorithm and the time of rendering, as well as the space complexity of the algorithm. In addition, we also compared the use of Euclidean distance and point intensity as the cost of edges.Therefore, we created a desktop application that reads the LiDAR point cloud and presents it in a 3D space. Then the application runs Kruskal’s algorithm over these points, as well as displays the partial results of the algorithm. Due to the large number of initial connections of the graph, we introduced an approximation using a uniform grid. It can be seen that using intensity as cost is faster than using Euclidean distance. We also found that memory consumption increases linearly with the number of nodes. Additionally, we examined how building a minimum spanning tree allows us to examine points more easily.
Keywords:	Kruskal’s algoritem, graph, LAS format, OpenGL

Comments

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back