Description
The Dual Marching Tetrahedra algorithm is a generalization of the Dual Marching Cubes algorithm, used to build a boundary surface around points which have been assigned a particular scalar density value, such as the data produced by and Magnetic Resonance Imaging or Computed Tomography scanner. This boundary acts as a skin between points which are determined to be "inside" and "outside" of an object. However, the DMT is vague in regards to exactly where each vertex of the boundary should be placed, which will not necessarily produce smooth results. Mesh smoothing algorithms which ignore the DMT data structures may distort the output mesh so that it could incorrectly include or exclude density points. Thus, an algorithm is presented here which is designed to smooth the output mesh, while obeying the underlying data structures of the DMT algorithm.
Download count: 6
Details
Title
- A smoothing algorithm for the dual marching tetrahedra method
Contributors
- Johnson, Sean (Author)
- Farin, Gerald (Thesis advisor)
- Richa, Andrea (Committee member)
- Nallure Balasubramanian, Vineeth (Committee member)
- Arizona State University (Publisher)
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
2011
Subjects
Resource Type
Collections this item is in
Note
- thesisPartial requirement for: M.S., Arizona State University, 2011
- bibliographyIncludes bibliographical references (p. 36-37)
- Field of study: Computer science
Citation and reuse
Statement of Responsibility
by Sean Johnson