DocumentCode
1683113
Title
Interval volume tetrahedrization
Author
Nielson, Gregory M. ; Sung, Junwon
Author_Institution
Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA
fYear
1997
Firstpage
221
Lastpage
228
Abstract
The interval volume is a generalization of the isosurface commonly associated with the marching cubes algorithm. Based upon samples at the locations of a 3D rectilinear grid, the algorithm produces a triangular approximation to the surface defined by F(x,y,z)=c. The interval volume is defined by α≤F(x,y,z)≤β. The authors describe an algorithm for computing a tetrahedrization of a polyhedral approximation to the interval volume.
Keywords
computational geometry; 3D rectilinear grid; algorithm; interval volume; interval volume tetrahedrization; isosurface; marching cubes algorithm; polyhedral approximation; tetrahedrization; triangular approximation; Approximation algorithms; Computer science; Grid computing; Inference algorithms; Isosurfaces; Lead compounds; Magnetic resonance imaging; Shape; X-ray tomography;
fLanguage
English
Publisher
ieee
Conference_Titel
Visualization '97., Proceedings
Conference_Location
Phoenix, AZ, USA
Print_ISBN
0-8186-8262-0
Type
conf
DOI
10.1109/VISUAL.1997.663886
Filename
663886
Link To Document