diplomsko delo univerzitetnega študijskega programa
Amadej Pevec (Author), Borut Žalik (Mentor), Niko Lukač (Co-mentor)

Abstract

V diplomskem delu najprej opravimo kratek pregled različnih pristopov za tvorjenje Delaunayeve triangulacije, nato pa se osredotočimo na algoritem gradnje triangulacije s korakanjem. V praktičnem delu implementiramo tri različne strategije korakanja in jih nato med seboj primerjamo.

Keywords

računalniška geometrija;algoritmi;Delaunayeva triangulacija;triangulacija;algoritem s korakanjem;diplomske naloge;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher: [A. Pevec]
UDC: 004.925.021(043.2)
COBISS: 17396758 Link will open in a new window
Views: 1928
Downloads: 199
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: WALKING - BASED DELAUNAY TRIANGULATION
Secondary abstract: In this thesis, Delaunay triangulation based on walking is considered. Firstly, different approaches for generating Delaunay triangulation are briefly mentioned. More detailly walking-based Delaunay triangulation strategy has been studied. Practical part of graduation work consist of implementation and comparison between the results of three walking algorithms.
Secondary keywords: computational geometry;algorithms;triangulation;Delaunay triangulation;
URN: URN:SI:UM:
Type (COBISS): Bachelor thesis/paper
Thesis comment: Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Računalništvo in informacijske tehnologije
Pages: VII, 25 f.
ID: 8727746
Recommended works:
, diplomsko delo univerzitetnega študijskega programa
, diplomsko delo univerzitetnega študijskega programa