CaltechTHESIS
  A Caltech Library Service

Approximation of surfaces by normal meshes

Citation

Friedel, Ilja Heinrich (2005) Approximation of surfaces by normal meshes. Dissertation (Ph.D.), California Institute of Technology. http://resolver.caltech.edu/CaltechETD:etd-05242005-164959

Abstract

This thesis introduces a novel geometry processing pipeline based on unconstrained spherical parameterization and normal remeshing. We claim three main contributions:

First we show how to increase the stability of Normal Mesh construction, while speeding it up by decomposing the process into two stages: parameterization and remeshing. We show that the remeshing step can be seen as resampling under a small perturbation of the given parameterization. Based on this observation we describe a novel algorithm for efficient and stable (interpolatory) normal mesh construction via parameterization perturbation.

Our second contribution is the introduction of Variational Normal Meshes. We describe a novel algorithm for encoding these meshes, and use our implementation to argue that variational normal meshes have a higher approximation quality than interpolating normal meshes, as expected. In particular we demonstrate that interpolating normal meshes have about 60 percent higher Hausdorff approximation error for the same number of vertices than our novel variational normal meshes. We also show that variational normal meshes have less aliasing artifacts than interpolatory normal meshes.

The third contribution is on creating parameterizations for unstructured genus zero meshes. Previous approaches could only avoid collapses by introducing artificial constraints or continuous reprojections, which are avoided by our method. The key idea is to define upper bound energies that are still good approximations. We achieve this by dividing classical planar triangle energies by the minimum distance to the sphere center. We prove that these simple modifaction provides the desired upper bounds and are good approximations in the finite element sense.

We have implemented all algorithms and provide example results and statistical data supporting our theoretical observations.

Item Type:Thesis (Dissertation (Ph.D.))
Subject Keywords:remeshing; unconstrained spherical parameterization; wavelets
Degree Grantor:California Institute of Technology
Division:Engineering and Applied Science
Major Option:Computer Science
Thesis Availability:Public (worldwide access)
Research Advisor(s):
  • Schroeder, Peter
Thesis Committee:
  • Schroeder, Peter (chair)
  • Barr, Alan H.
  • Candes, Emmanuel J.
  • Desbrun, Mathieu
Defense Date:18 May 2005
Author Email:ilja (AT) cs.caltech.edu
Record Number:CaltechETD:etd-05242005-164959
Persistent URL:http://resolver.caltech.edu/CaltechETD:etd-05242005-164959
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:2003
Collection:CaltechTHESIS
Deposited By: Imported from ETD-db
Deposited On:27 May 2005
Last Modified:26 Dec 2012 02:45

Thesis Files

[img]
Preview
PDF (phd_ilja_friedel.pdf) - Final Version
See Usage Policy.

18Mb

Repository Staff Only: item control page