Skip to main content
Article thumbnail
Location of Repository

A Fast Polygonization Method for Quasi-convolutionally Smoothed Polyhedra

By Burkhard Claus Wünsche

Abstract

This thesis introduces Triage Polygonization, a new fast polygonization method for quasi-convolutionally smoothed polyhedra. The polygonization method exploits the property that quasi-convolutionally smoothed polyhedra usually have predominantly planar surfaces with only edges and corners rounded. A quasi-convolutionally smoothed polyhedron is represented implicitly as a density eld iso-surface. Triage Polygonization subdivides the density eld in a BSP-like manner and classi es the resulting cells as inside, outside, or intersected by the isosurface. Planar surface areas usually lie on the boundary of cells and are extracted directly from the subdivided density eld with minimal fragmentation. For cells intersected by the iso-surface a more general polygonization is performed. For quasiconvolutionally smoothed scenes with a small rounding radius Triage Polygonization is 20{30 times faster and outputs only 1-2 % of the polygons of the Marching Cubes algorithm without compromising the approximation. The approach taken for Triage Polygonization can be extended to related problems. Currently research is underway to extend Triage Polygonization to handle truly convolutionally smoothed scenes

Topics: Contents
Year: 1996
OAI identifier: oai:CiteSeerX.psu:10.1.1.415.8707
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.auckland.ac.nz/~... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.