diplomsko delo
Žan Terplan (Author), Aljaž Zalar (Mentor)

Abstract

Glajenje ploskev je pomemben postopek pri optimizaciji tridimenzionalnih modelov, zlasti v kontekstu simulacij in računalniške grafike. V diplomskem delu predstavimo in analiziramo metodo glajenja heksaedrskih mrež, ki temelji na uporabi matematičnega algoritma, imenovanega Lasserrejeve hierarhije. Metodo preizkušamo na dveh različnih modelih z uporabo različnih velikosti in intenzitet Gaussovega šuma. Negladkosti ocenjujemo tako, da primerjamo vizualne karakteristike modelov in numerične vrednosti Jacobijevih determinant heksaedrov. S tem ugotavljamo stopnjo negladkosti mreže, pri kateri je glajenje še uspešno.

Keywords

pozitivni polinom; heksaedrska mreža;Lasserrejeve hierarhije;popravljanje mrež;univerzitetni študij;diplomske naloge;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UL FRI - Faculty of Computer and Information Science
Publisher: [Ž. Terplan]
UDC: 004.92(043.2)
COBISS: 209814019 Link will open in a new window
Views: 106
Downloads: 32
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: Usage of Lasserre hierarchies in computer graphics
Secondary abstract: Mesh surface smoothing is an important process in the optimization of three-dimensional models, especially in the context of simulations and computer graphics. In this thesis, we present and analyze a method for smoothing hexahedral meshes, based on the use of a mathematical algorithm called the Lasserre hierarchy. We test the method on two different models, using various sizes and intensities of Gaussian noise. We assess smoothness by comparing the visual characteristics of the models and the numerical values of the Jacobian determinants of the hexahedra. This allows us to determine the level of mesh deformation at which smoothing is still successful.
Secondary keywords: computer graphics;positive polynomial; hexahedral mesh;Lasserre hierarchies;mesh repair;computer and information science;diploma;Računalniška grafika;Računalništvo;Univerzitetna in visokošolska dela;
Type (COBISS): Bachelor thesis/paper
Study programme: 1000468
Embargo end date (OpenAIRE): 1970-01-01
Thesis comment: Univ. v Ljubljani, Fak. za računalništvo in informatiko
Pages: 1 spletni vir (1 datoteka PDF (54 str.))
ID: 24920795