High-Quality Simplification and Repair of Polygonal Models

Dissertation, Universität Bonn, Nov. 2009
 

Abstract

Because of the rapid evolution of 3D acquisition and modelling methods, highly complex and detailed polygonal models with constantly increasing polygon count are used as three-dimensional geometric representations of objects in computer graphics and engineering applications. The fact that this particular representation is arguably the most widespread one is due to its simplicity, flexibility and rendering support by 3D graphics hardware. Polygonal models are used for rendering of objects in a broad range of disciplines like medical imaging, scientific visualization, computer aided design, film industry, etc.

The handling of huge scenes composed of these high-resolution models rapidly approaches the computational capabilities of any graphics accelerator. In order to be able to cope with the complexity and to build level-of-detail representations, concentrated efforts were dedicated in the recent years to the development of new mesh simplification methods that produce high-quality approximations of complex models by reducing the number of polygons used in the surface while keeping the overall shape, volume and boundaries preserved as much as possible.

Many well-established methods and applications require “well-behaved” models as input. Degenerate or incorectly oriented faces, T-joints, cracks and holes are just a few of the possible degenaracies that are often disallowed by various algorithms. Unfortunately, it is all too common to find polygonal models that contain, due to incorrect modelling or acquisition, such artefacts. Applications that may require “clean” models include finite element analysis, surface smoothing, model simplification, stereo lithography. Mesh repair is the task of removing artefacts from a polygonal model in order to produce an output model that is suitable for further processing by methods and applications that have certain quality requirements on their input.

This thesis introduces a set of new algorithms that address several particular aspects of mesh repair and mesh simplification. One of the two mesh repair methods is dealing with the inconsistency of normal orientation, while another one, removes the inconsistency of vertex connectivity. Of the three mesh simplification approaches presented here, the first one attempts to simplify polygonal models with the highest possible quality, the second, applies the developed technique to out-of-core simplification, and the third, prevents self-intersections of the model surface that can occur during mesh simplification.

Download: http://nbn-resolving.de/urn:nbn:de:hbz:5N-19384

Bibtex

@PHDTHESIS{borodin-2009-dissertation,
    author = {Borodin, Pavel},
     title = {High-Quality Simplification and Repair of Polygonal Models},
      type = {Dissertation},
      year = {2009},
     month = nov,
    school = {Universit{\"a}t Bonn},
  abstract = {Because of the rapid evolution of 3D acquisition and modelling methods, highly complex and detailed
              polygonal models with constantly increasing polygon count are used as three-dimensional geometric
              representations of objects in computer graphics and engineering applications. The fact that this
              particular representation is arguably the most widespread one is due to its simplicity, flexibility
              and rendering support by 3D graphics hardware. Polygonal models are used for rendering of objects in
              a broad range of disciplines like medical imaging, scientific visualization, computer aided design,
              film industry, etc.
              
              The handling of huge scenes composed of these high-resolution models rapidly approaches the
              computational capabilities of any graphics accelerator. In order to be able to cope with the
              complexity and to build level-of-detail representations, concentrated efforts were dedicated in the
              recent years to the development of new mesh simplification methods that produce high-quality
              approximations of complex models by reducing the number of polygons used in the surface while
              keeping the overall shape, volume and boundaries preserved as much as possible.
              
              Many well-established methods and applications require ``well-behaved'' models as input. Degenerate
              or incorectly oriented faces, T-joints, cracks and holes are just a few of the possible degenaracies
              that are often disallowed by various algorithms. Unfortunately, it is all too common to find
              polygonal models that contain, due to incorrect modelling or acquisition, such artefacts.
              Applications that may require ``clean'' models include finite element analysis, surface smoothing,
              model simplification, stereo lithography. Mesh repair is the task of removing artefacts from a
              polygonal model in order to produce an output model that is suitable for further processing by
              methods and applications that have certain quality requirements on their input.
              
              This thesis introduces a set of new algorithms that address several particular aspects of mesh
              repair and mesh simplification. One of the two mesh repair methods is dealing with the inconsistency
              of normal orientation, while another one, removes the inconsistency of vertex connectivity. Of the
              three mesh simplification approaches presented here, the first one attempts to simplify polygonal
              models with the highest possible quality, the second, applies the developed technique to out-of-core
              simplification, and the third, prevents self-intersections of the model surface that can occur
              during mesh simplification.},
       url = {http://nbn-resolving.de/urn:nbn:de:hbz:5N-19384}
}