magistrsko delo
Uroš Ribič (Author), Gašper Fijavž (Mentor), Sergio Cabello (Co-mentor)

Abstract

Preiskovali smo problem iskanja ravnin na trianguliranem terenu. Za množico točk v prostoru zgradimo Delaunayjevo triangulacijo in z dvema različnima metodama poiščemo ravnino na terenu. V prvi metodi uporabimo algoritem za iskanje največjega konveksnega poligona. Algoritem se dobro obnese na manjši množici točk, na večji množici točk, pa zaradi svoje kvadratične časovne zahtevnosti ne pride v poštev. V drugi metodi uporabimo aproksimacijski algoritem. Ta se bolje obnese tudi na večji množici podatkov, kot tudi na realnih geografskih podatkih, ki jih lahko dobimo na spletnem portalu LIDAR. Implementiran vmesnik nam pomaga, da na enostaven način testiramo obe metodi in vizualiziramo rezultate.

Keywords

aproksimacijski algoritmi;ravnina;relief pokrajine;iskanje regij;računalništvo;računalništvo in informatika;magisteriji;

Data

Language: Slovenian
Year of publishing:
Typology: 2.09 - Master's Thesis
Organization: UL FRI - Faculty of Computer and Information Science
Publisher: [U. Ribič]
UDC: 004:51(043.2)
COBISS: 42017795 Link will open in a new window
Views: 1450
Downloads: 76
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: Finding planar regions
Secondary abstract: We studied the problem of finding planar regions in a triangulated terrain. For a set of points in 3-space, we construct the Delaunay triangulation. Then, with two different methods we look for a region which is flat. The first method uses an algorithm to find the largest convex polygon. The algorithm works well on smaller sets of points, but on larger sets of points it performs poorly due to its quadratic time complexity. In the second method, we use an approximation algorithm. It performs better on larger data sets, as well as on real geographical data, which can be obtained on the web portal LIDAR. The implemented interface helps us to test both methods in an easy way and visualize the results.
Secondary keywords: approximation algorithms;planarity;terrain;finding regions;computer science;computer and information science;master's degree;
Type (COBISS): Master's thesis/paper
Study programme: 1000471
Embargo end date (OpenAIRE): 1970-01-01
Thesis comment: Univ. v Ljubljani, Fak. za računalništvo in informatiko
Pages: 44 str.
ID: 12219705