ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computers & Graphics
Volume 26, Issue 2, April 2002, Pages 209-218
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (1164 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0097-8493(02)00052-3    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2002 Elsevier Science Ltd. All rights reserved.

Visualization of very Large Datasets

Improving progressive view-dependent isosurface propagation

Zhiyan LiuCorresponding Author Contact Information, E-mail The Corresponding Author, Adam Finkelstein and Kai Li

Department of Computer Science, Princeton University, 35 Olden Street, Princeton, NJ 08544, USA

Available online 12 February 2002.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Recently, we proposed a new isosurface extraction algorithm that extracts portions of the isosurface in a view-dependent manner by ray casting and propagation. The algorithm casts rays through a volume to find visible active cells as seeds and then propagates their polygonal isosurface into the neighboring cells. Small pieces of the isosurface are generated by distance-limited propagation and joined together to form the final surface. This paper presents our evaluation of several design choices of the algorithm. We have implemented these design choices and showed that by making right design decisions, we can substantially reduce the time to obtain most (such as 99.9%) of the isosurface.

Author Keywords: Data visualization; Isosurface extraction; View dependent; Level of detail; Ray casting

Article Outline

1. Introduction
2. The algorithm and design choices
2.1. Ray casting
2.1.1. Intersection calculation
2.1.2. Ray-casting order
2.2. Propagation
2.3. Adaptive-resolution isosurface
3. Performance evaluation
3.1. Exact intersection vs. approximate intersection
3.2. Cut-off angle vs. maximum count
3.3. Three ray casting schemes
3.4. Caching interpolants and triangles
3.5. Screen-bounding box
3.6. Impact of m
4. Final results
5. Comparisons with other algorithms
6. Conclusions and future work
Acknowledgements
References




Computers & Graphics
Volume 26, Issue 2, April 2002, Pages 209-218
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.