Full metadata
Title
A smoothing algorithm for the dual marching tetrahedra method
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.
Date Created
2011
Contributors
- Johnson, Sean (Author)
- Farin, Gerald (Thesis advisor)
- Richa, Andrea (Committee member)
- Nallure Balasubramanian, Vineeth (Committee member)
- Arizona State University (Publisher)
Topical Subject
Resource Type
Extent
iii, 38 p. : ill. (some col.)
Language
eng
Copyright Statement
In Copyright
Primary Member of
Peer-reviewed
No
Open Access
No
Handle
https://hdl.handle.net/2286/R.I.14450
Statement of Responsibility
by Sean Johnson
Description Source
Viewed on Jan. 4, 2013
Level of coding
full
Note
thesis
Partial requirement for: M.S., Arizona State University, 2011
bibliography
Includes bibliographical references (p. 36-37)
Field of study: Computer science
System Created
- 2012-08-24 06:12:27
System Modified
- 2021-08-30 01:49:20
- 3 years 3 months ago
Additional Formats