ACM Home Page
Please provide us with feedback. Feedback
Boundary surface extraction and rendering for volume datasets
Full text PdfPdf (395 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2006 ACM symposium on Applied computing table of contents
Dijon, France
SESSION: Multimedia and Visualization (MV) table of contents
Pages: 1356 - 1360  
Year of Publication: 2006
ISBN:1-59593-108-2
Authors
Shiaofen Fang  Indiana University Purdue University Indianapolis, Indianapolis, IN
Pooja Gupta  Indiana University, Indianapolis, IN
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 31,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1141277.1141592
What is a DOI?

ABSTRACT

Traditional iso-surface techniques focus on the extraction and rendering of contour surfaces. Boundary surfaces, however, are often more interesting and useful to the applications as they are more natural representations of the objects embedded in the dataset. This paper describes an efficient boundary surface extraction and rendering approach for volume datasets. A volume dataset is first filtered using a Laplacian of Gaussian (LoG) filter to generate a zero-crossing field, from which boundary surface information is extracted. Two types of surfaces can be generated: (1) zero-crossing surface; and (2) iso-surface boundaries. The zero-crossing surface can be extracted directly from the zero-crossing field as an iso-surface with a zero iso-value. Original intensity values will then be attached to the vertices of the polygon mesh for flexible rendering. Iso-surface boundaries are the iso-surfaces from the original volume that best approximate the zero-crossing boundaries. The iso-values of these iso-surface boundaries are obtained through a histogram analysis of the zero-crossing boundaries in a multi-scale space. The new approach provides a more efficient and accurate surface navigation technique for volume data exploration.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
A. Doi, S. Fujiwara, K. Matsuda, and M. Kameda, 3D Volume Extraction and Mesh Generation Using Energy Minimization techniques. In 1st International Symposium on 3D Data Processing Visualization and Transmission, 2002.
 
3
 
4
 
5
S. Fang, Y. Dai, Fred Myers, Mihran Tuceryan and Ken Dunn, "Three-Dimensional Microscopy Data Exploration by Interactive Volume Visualization", Journal of Scanning Microscopies, July/August, Vol 22, 218--226, 2000.
6
 
7
 
8
9
 
10
 
11
12
 
13
 
14
 
15
A. P. Witkin. Scale-space filtering. In Proceedings of the 8 International Joint Conference on Artificial Intelligence, pages 1019--1022, Kalsruhe, West Germany, Aug. 1983.

Collaborative Colleagues:
Shiaofen Fang: colleagues
Pooja Gupta: colleagues