Simplification and Repair of Polygonal Models Using Volumetric Techniques

  title={Simplification and Repair of Polygonal Models Using Volumetric Techniques},
  author={Fakir S. Nooruddin and Greg Turk},
  journal={IEEE Trans. Vis. Comput. Graph.},
Two important tools for manipulating polygonal models are simplification and repair and we present voxel-based methods for performing both of these tasks. We describe a method for converting polygonal models to a volumetric representation in a way that handles models with holes, double walls, and intersecting parts. This allows us to perform polygon model repair simply by converting a model to and from the volumetric domain. We also describe a new topology-altering simplification method that is… 

Figures and Tables from this paper

Robust Creation of Implicit Surfaces from Polygonal Meshes

A practical method for creating implicit surfaces from polygonal models that produces high-quality results for complex surfaces based on a variational interpolation technique (the three-dimensional generalization of thin-plate interpolation) is introduced.

High qualitiy simplification and repair of polygonal models

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 selfintersections of the model surface that can occur duringMesh simplification.

Complete Polygonal Scene Voxelization

A fast and robust tool for automatically converting complete polygonal scenes into volumetric representations that can handle complex geometry and exhibits robust solutions for a broad range of scenes, such as cracks, holes, overlapping geometries, interpenetrating meshes, double walls, and fuzzy borders.

Robust repair of polygonal models

  • T. Ju
  • Computer Science
    ACM Trans. Graph.
  • 2004
This work presents a robust method for repairing arbitrary polygon models that can efficiently process large models containing millions of polygons and is capable of reproducing sharp features in the original geometry.

Automatic restoration of polygon models

We present a fully automatic technique which converts an inconsistent input mesh into an output mesh that is guaranteed to be a clean and consistent mesh representing the closed manifold surface of a

Mesh repair with user-friendly topology control

Geometric Shape Abstraction and Simplification

A new method that captures the so-called cambial growth of a tree – the process that causes individual branches to thicken is introduced and the simulation is coupled to a physical cracking model to produce plausible bark structures.

A visibility algorithm for converting 3D meshes into editable 2D vector graphics

A visibility method that can partition a mesh into large components that can be layered according to visibility and a new cut algorithm that uses a graph representation of the mesh and curvature-aware geodesic distances.

ReMESH: An Interactive Environment to Edit and Repair Triangle Meshes

  • M. AtteneB. Falcidieno
  • Computer Science
    IEEE International Conference on Shape Modeling and Applications 2006 (SMI'06)
  • 2006
The foundations of ReMESH are described, a user-friendly graphical tool which incorporates several mesh-repairing features, and allows to perform a kind of low-level editing which is often missing in most existing software packages.



Controlled simplification of genus for polygonal models

This work proposes a simplification framework in which genus-reducing and genus-preserving simplifications alternate to yield much better multiresolution hierarchies than would have been possible by using either one of them.

An accurate method for voxelizing polygon meshes

A new method is introduced for voxelizing planar objects which, unlike existing methods, provides topological conformity through geometric measures and is extended to provide, for the first time, an accurate and coherent method for vxelizing polygon meshes.

Multi-resolution 3D approximations for rendering complex scenes

This work presents a simple, effective, and efficient technique for approximating arbitrary polyhedra based on triangulation and vertex-clustering, and produces a series of 3D approximations that resemble the original object from all viewpoints, but contain an increasingly smaller number of faces and vertices.

Surface simplification using quadric error metrics

This work has developed a surface simplification algorithm which can rapidly produce high quality approximations of polygonal models, and which also supports non-manifold surface models.

View-dependent simplification of arbitrary polygonal environments

HDS is dynamic, retessellating the scene continually as the user's viewing position shifts, and global, processing the entire database without first decomposing the environment into individual objects.

Decimation of triangle meshes

An application independent algorithm that uses local operations on geometry and topology to reduce the number of triangles in a triangle mesh and results from two different geometric modeling applications illustrate the strengths of the algorithm.

Consistent solid and boundary representations from arbitrary polygonal data

An algorithm is described that automatically constructs consistent representations of the solid objects modeled by an arbitrary set of polygons and is effective even when the input polygons intersect, overlap, are wrongly-oriented, have T-junctions, or are unconnected.

Model simplification using vertex-clustering

The technique is advanced with careful consideration ofroximation quality and smoothness in transitions between different levels of simplification, while maintaining its efficiency and efb%iveness.

A hybrid ray tracer for rendering polygon and volume data

  • M. Levoy
  • Computer Science
    IEEE Computer Graphics and Applications
  • 1990
Volume rendering, a technique for visualizing sampled functions of three spatial dimensions by computing 2-D projections of a colored semitransparent volume, is extended to handle polygonally defined

Marching cubes: A high resolution 3D surface construction algorithm

We present a new algorithm, called marching cubes, that creates triangle models of constant density surfaces from 3D medical data. Using a divide-and-conquer approach to generate inter-slice