Polygonization of Quasi-Convolutionally Smoothed Polyhedra

Show simple item record

dc.contributor.author Wuensche, Burkhard en
dc.contributor.author Lobb, R.J. en
dc.date.accessioned 2009-04-08T04:03:12Z en
dc.date.available 2009-04-08T04:03:12Z en
dc.date.issued 1997-04 en
dc.identifier.citation Computer Science Technical Reports 146 (1997) en
dc.identifier.issn 1173-3500 en
dc.identifier.uri http://hdl.handle.net/2292/3489 en
dc.description.abstract The smoothing of a polyhedral model is an important task in Computer Graphics. Richard Lobb [Lobb96] introduced quasi-convolutional smoothing, a fast rounding scheme approximating convolutional smoothing. For a fast interactive display of the model its surface must be polygonized. We introduce here Triage Polygonization, a new fast polygonization method for quasi-convolutionally smoothed polyhedral. The polygonization method exploits the property that quasi-convolutionally smoothed polyhedral usually have predominantly planar surfaces with only edges and corners rounded. A quasi-convolutionally smoothed polyhedron is represented implicitly as a density field isosurface. Triage Polygonization subdivides the density field in a BSP-like manner and classifies 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 field with minimal fragmentation. For cells intersected by the isosurface a more general polygonization is 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. en
dc.publisher Department of Computer Science, The University of Auckland, New Zealand en
dc.relation.ispartofseries Computer Science Technical Reports en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.source.uri http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/csTRcgi.pl?serial en
dc.title Polygonization of Quasi-Convolutionally Smoothed Polyhedra en
dc.type Technical Report en
dc.subject.marsden Fields of Research::280000 Information, Computing and Communication Sciences en
dc.rights.holder The author(s) en

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace