Matching of geometrically and topologically changing meshes

The aim for this thesis is to develop a foundation for a compression system for animated mesh sequences, specifically under dynamic change of mesh geometry and topology. Compression of mesh sequences is of special interest in the game industry and this particular thesis is a part of an ongoing serie...

Full description

Bibliographic Details
Main Author: Jonsson, Kristoffer
Format: Others
Language:English
Published: Uppsala universitet, Avdelningen för beräkningsvetenskap 2015
Subjects:
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-262249
id ndltd-UPSALLA1-oai-DiVA.org-uu-262249
record_format oai_dc
spelling ndltd-UPSALLA1-oai-DiVA.org-uu-2622492018-01-11T05:12:49ZMatching of geometrically and topologically changing meshesengJonsson, KristofferUppsala universitet, Avdelningen för beräkningsvetenskap2015meshmeshesmatchingmatchingstopologygeometrymanifoldcompressionanimationanimationsfluidspherical harmonicstensorbijectivegamegamesDICEComputational MathematicsBeräkningsmatematikComputer SciencesDatavetenskap (datalogi)GeometryGeometriThe aim for this thesis is to develop a foundation for a compression system for animated mesh sequences, specifically under dynamic change of mesh geometry and topology. Compression of mesh sequences is of special interest in the game industry and this particular thesis is a part of an ongoing series of projects at EA DICE. One of the primary challenges when creating a mesh compression system is creating a matching bijective subset of the mesh surfaces between two subsequent frames in the animation to guide remeshing of the sequence. This thesis describes a method for producing a bijective set of matching mesh patches between two meshes along with an error metric that captures the quality of the matching in terms of shape similarity and distortion. Theory of mathematical topology and tensor algebra used in methods for high performance scientific digital 3D-image recognition are here adopted to extract similar local features between meshes. Techniques for creating parametrizations of mesh patches are combined with techniques for matching point clouds and deforming mesh geometry under energy minimization in order to produce a matching set of patches. The presented algorithm successfully creates bijective sets of matched patches for subsequent meshes in a sequence as well as measures the error for the matchings. Results show an average matching set size of approximately 25% of the mesh areas over a sequence of meshes. This suggests that the data size of such a sequence could potentially be reduced by 25%. Student thesisinfo:eu-repo/semantics/bachelorThesistexthttp://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-262249UPTEC F, 1401-5757 ; 15056application/pdfinfo:eu-repo/semantics/openAccess
collection NDLTD
language English
format Others
sources NDLTD
topic mesh
meshes
matching
matchings
topology
geometry
manifold
compression
animation
animations
fluid
spherical harmonics
tensor
bijective
game
games
DICE
Computational Mathematics
Beräkningsmatematik
Computer Sciences
Datavetenskap (datalogi)
Geometry
Geometri
spellingShingle mesh
meshes
matching
matchings
topology
geometry
manifold
compression
animation
animations
fluid
spherical harmonics
tensor
bijective
game
games
DICE
Computational Mathematics
Beräkningsmatematik
Computer Sciences
Datavetenskap (datalogi)
Geometry
Geometri
Jonsson, Kristoffer
Matching of geometrically and topologically changing meshes
description The aim for this thesis is to develop a foundation for a compression system for animated mesh sequences, specifically under dynamic change of mesh geometry and topology. Compression of mesh sequences is of special interest in the game industry and this particular thesis is a part of an ongoing series of projects at EA DICE. One of the primary challenges when creating a mesh compression system is creating a matching bijective subset of the mesh surfaces between two subsequent frames in the animation to guide remeshing of the sequence. This thesis describes a method for producing a bijective set of matching mesh patches between two meshes along with an error metric that captures the quality of the matching in terms of shape similarity and distortion. Theory of mathematical topology and tensor algebra used in methods for high performance scientific digital 3D-image recognition are here adopted to extract similar local features between meshes. Techniques for creating parametrizations of mesh patches are combined with techniques for matching point clouds and deforming mesh geometry under energy minimization in order to produce a matching set of patches. The presented algorithm successfully creates bijective sets of matched patches for subsequent meshes in a sequence as well as measures the error for the matchings. Results show an average matching set size of approximately 25% of the mesh areas over a sequence of meshes. This suggests that the data size of such a sequence could potentially be reduced by 25%.
author Jonsson, Kristoffer
author_facet Jonsson, Kristoffer
author_sort Jonsson, Kristoffer
title Matching of geometrically and topologically changing meshes
title_short Matching of geometrically and topologically changing meshes
title_full Matching of geometrically and topologically changing meshes
title_fullStr Matching of geometrically and topologically changing meshes
title_full_unstemmed Matching of geometrically and topologically changing meshes
title_sort matching of geometrically and topologically changing meshes
publisher Uppsala universitet, Avdelningen för beräkningsvetenskap
publishDate 2015
url http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-262249
work_keys_str_mv AT jonssonkristoffer matchingofgeometricallyandtopologicallychangingmeshes
_version_ 1718605033648422912