Show simple item record

dc.contributor.advisor Warren, Joe
dc.creatorJu, Tao
dc.date.accessioned 2009-06-04T06:51:32Z
dc.date.available 2009-06-04T06:51:32Z
dc.date.issued 2003
dc.identifier.urihttps://hdl.handle.net/1911/17598
dc.description.abstract In this thesis we present a fast, table-driven isosurface extraction technique on volumetric data. Unlike Marching Cubes or other cell-based algorithms, the proposed polygonization generates convex negative space inside individual cells, enabling fast collision detection on the triangulated isosurface. In our implementation, we are able to perform over 2 million point classifications per second. The algorithm is driven by an automatically constructed look-up table that stores compact decision trees by sign configurations. The decision trees determine triangulations dynamically by values at cell corners. Using the same technique, we can perform fast, crack-free multi-resolution contouring on nested grids of volumetric data. The method can also be extended to extract isosurfaces on arbitrary convex, space-filling polyhedra.
dc.format.extent 26 p.
dc.format.mimetype application/pdf
dc.language.iso eng
dc.subjectComputer science
dc.title Convex contouring of volumetric data
dc.type.genre Thesis
dc.type.material Text
thesis.degree.department Computer Science
thesis.degree.discipline Engineering
thesis.degree.grantor Rice University
thesis.degree.level Masters
thesis.degree.name Master of Science
dc.identifier.citation Ju, Tao. "Convex contouring of volumetric data." (2003) Master’s Thesis, Rice University. https://hdl.handle.net/1911/17598.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record