Multiresolution in geometric modelling : subdivision mark points and ternary subdivision
The term <i>multiresolution </i>captures the concept of representing a single mathematical model in several levels of detail or accuracy. The 3D geometric models we have in mind are organized sets of point data, typically in the form of triangle meshes, such as those used to represent te...
Main Author: | |
---|---|
Published: |
University of Cambridge
2005
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.603847 |
id |
ndltd-bl.uk-oai-ethos.bl.uk-603847 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-bl.uk-oai-ethos.bl.uk-6038472017-12-24T16:11:16ZMultiresolution in geometric modelling : subdivision mark points and ternary subdivisionHassan, Mohamed Fathih2005The term <i>multiresolution </i>captures the concept of representing a single mathematical model in several levels of detail or accuracy. The 3D geometric models we have in mind are organized sets of point data, typically in the form of triangle meshes, such as those used to represent terrain models or free-form surfaces in computer graphics. There are two obvious approaches to creating a multiresolution model. The first is to have a low resolution model from which we create a higher resolution one. For this we can use recursive subdivision and remeshing techniques. Conversely, we may have a high resolution model and desire a lower one. For this we can use discrete fairing and mesh decimation. This thesis focuses on recursive subdivision. We describe two new methods for analysing subdivision schemes. The first of which, mark point analysis, extends the established spectral analysis of the subdivision matrix at a vertex to the other mark points of the scheme. This provides additional necessary conditions for smoothness that we can impose on a scheme. We have used this method to help us derive two new families of subdivision schemes, both in the univariate and bivariate settings. The second method extends the established univariate theory to obtain sufficient conditions for smoothness from the binary case to the ternary case, and we posit how this would extend to any arity. This not only extends the method for proving the continuity class, but also provides an estimate for the Hölder exponent. We also present four new subdivision schemes. First, we present two new families of univariate interpolating subdivision schemes. These are then extended into the bivariate setting to give two new families of interpolating schemes on the triangular mesh. We establish their major properties using the smoothness analyses presented earlier and other techniques. Both the methods and the schemes have opened up interesting avenues for further research.510University of Cambridgehttp://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.603847https://www.repository.cam.ac.uk/handle/1810/251970Electronic Thesis or Dissertation |
collection |
NDLTD |
sources |
NDLTD |
topic |
510 |
spellingShingle |
510 Hassan, Mohamed Fathih Multiresolution in geometric modelling : subdivision mark points and ternary subdivision |
description |
The term <i>multiresolution </i>captures the concept of representing a single mathematical model in several levels of detail or accuracy. The 3D geometric models we have in mind are organized sets of point data, typically in the form of triangle meshes, such as those used to represent terrain models or free-form surfaces in computer graphics. There are two obvious approaches to creating a multiresolution model. The first is to have a low resolution model from which we create a higher resolution one. For this we can use recursive subdivision and remeshing techniques. Conversely, we may have a high resolution model and desire a lower one. For this we can use discrete fairing and mesh decimation. This thesis focuses on recursive subdivision. We describe two new methods for analysing subdivision schemes. The first of which, mark point analysis, extends the established spectral analysis of the subdivision matrix at a vertex to the other mark points of the scheme. This provides additional necessary conditions for smoothness that we can impose on a scheme. We have used this method to help us derive two new families of subdivision schemes, both in the univariate and bivariate settings. The second method extends the established univariate theory to obtain sufficient conditions for smoothness from the binary case to the ternary case, and we posit how this would extend to any arity. This not only extends the method for proving the continuity class, but also provides an estimate for the Hölder exponent. We also present four new subdivision schemes. First, we present two new families of univariate interpolating subdivision schemes. These are then extended into the bivariate setting to give two new families of interpolating schemes on the triangular mesh. We establish their major properties using the smoothness analyses presented earlier and other techniques. Both the methods and the schemes have opened up interesting avenues for further research. |
author |
Hassan, Mohamed Fathih |
author_facet |
Hassan, Mohamed Fathih |
author_sort |
Hassan, Mohamed Fathih |
title |
Multiresolution in geometric modelling : subdivision mark points and ternary subdivision |
title_short |
Multiresolution in geometric modelling : subdivision mark points and ternary subdivision |
title_full |
Multiresolution in geometric modelling : subdivision mark points and ternary subdivision |
title_fullStr |
Multiresolution in geometric modelling : subdivision mark points and ternary subdivision |
title_full_unstemmed |
Multiresolution in geometric modelling : subdivision mark points and ternary subdivision |
title_sort |
multiresolution in geometric modelling : subdivision mark points and ternary subdivision |
publisher |
University of Cambridge |
publishDate |
2005 |
url |
http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.603847 |
work_keys_str_mv |
AT hassanmohamedfathih multiresolutioningeometricmodellingsubdivisionmarkpointsandternarysubdivision |
_version_ |
1718574605467123712 |