A simple and novel seed-set finding approach for iso-surface extraction
Pages 125 - 132
Abstract
Iso-surface extraction is one of the most important approaches for volume rendering, and iso-contouring is one of the most effective methods for iso-surface extraction. Unlike most other methods having their search domain to be the whole dataset, iso-contouring does its search only on a relatively small subset of the original data-set. This subset, called a seed-set, has the property that every iso-surface must intersect with it, and it could be built at the preprocessing time. When an iso-value is given at the run time, iso-contouring algorithm starts from the intersected cells in the seed-set, and gradually propagates to form the whole iso-surface. As smaller seed-sets offer less cell searching time, most existing iso-contouring algorithms concentrates on how to identify an optimal seed-set. In this paper, we propose a new and linear-time approach for seed-set construction. This presented algorithm could reduce the size of the generated seed-sets by up to one or two orders of magnitude, compared with other previously proposed fast (linear time) algorithms.
References
[1]
C. L. Bajaj, V. Pascucci, and D. R. Schikore. Fast Isocontouring for Improved Interactivity. In Proceedings on 1996 Symposium on Volume Visualization, pages 39. 46, October 1996. 1, 2, 4, 5, 6
[2]
C. L. Bajaj, V. pascucci, and D. R. Schikore. Fast Isocontouring for Structured and Unstructured Meshes in Any Dimension. In IEEE Visualization '97 Late Breaking Hot Topics, 1997. 1
[3]
C. L. Bajaj, V. pascucci, and D. R. Schikore. Seed Sets and Search Structures for Accelerated Isocontouring. Technical Report 97-034, Department of Computer Science, Purdue University, 1997. 1
[4]
P. Cignoni, P. Marino, C. Montani, E. Puppo, and R. Scopigno. Speeding Up Isosurface Extraction Using Interval Trees. IEEE Transactions on Visualization and Computer Graphics, 3(2):158-170, April 1997. 2
[5]
H. Edelsbrunner. Dynamic Data Structures for Orthogonal Intersection Queries. Technical Report Report F59, Inst. Informationsverarb., Tech. University Graz, 1980. 2
[6]
R. S. Gallagher. Span Filtering: An Optimization Scheme for Volume Visualization of Large Finite Element Models. In IEEE Visualization '91, pages 68-75, October 1991. 2
[7]
T. Itoh and K. Koyamada. Automatic Isosurface Propagation Using an Extrema Graph And Sorted Boundary Cell Lists. IEEE Transactions on Visualization and Computer Graphics, 1(4):319-327, December 1995. 2
[8]
T. Itoh, Y. Yamaguchi, and K. Koyamada. Volume Thinning for Automatic Isosurface Propagation. In IEEE Visualization '96, pages 303-310, October 1996. 2, 3, 6
[9]
M. J. Kreveld, R. Oostrum, C. J. Bajaj, V. Pascucci, and D. Schikore. Contour Trees and Small Seed Sets for Isosurface Traversal. In Symposium on Computational Geometry, pages 212-220, 1997. 2, 5, 6, 7
[10]
W. E. Lorensen and H. E. Cline. Marching Cube: A High Resolution 3D Surface Construction Algorithm. Computer Graphics, 21(4):163-169, July 1987. 2
[11]
M. Levoy. Display of Surfaces from Volume Data. IEEE Computer Graphics and Applications, 8(3):29-37, March 1988. 2
[12]
M. Levoy. Efficient Ray Tracing of Volume Data. ACM Transactions on Graphics, 9(3):245-261, 1990. 2
[13]
Y. Livnat, H. Shen, and C. R. Johnson. A Near Optimal Isosurface Extraction Algorithm Using the Span Space. IEEE Transactions on Visualization and Computer Graphics, 2(1):73-84, March 1996. 1, 2, 3
[14]
H. Shen, C. D. Hansen, Y. Livnat, and C. R. Johnson. Isosurfacing in Span Space with Utmost Efficiency. In IEEE Visualization '96, pages 287-294, October 1996. 2
[15]
J. Wilhelms and A. V. Gelder. Octrees for Faster Isosurface Generation. ACM Transactions on Graphics, 11(3):201.227, July 1992. 2
Recommendations
A novel feature extraction method for identifying quality seed selection
Nowadays, research works in the agriculture field have been widely incorporated and showing promising growth. Digital image mining techniques were used in this paper to test different seeds. Analysis of physical purity tells us the proportion of pure seed ...
The Need for Seed (in the Abstract Tile Assembly Model)
AbstractIn the abstract Tile Assembly Model (aTAM) square tiles self-assemble, autonomously binding via glues on their edges, to form structures. Algorithmic aTAM systems can be designed in which the patterns of tile attachments are forced to follow the ...
Design and testing of novel seed miss prevention system for single seed precision metering devices
Highlights- Seed misses in single seed metering devices can be prevented by varying rotational speed.
AbstractPrecision seed metering devices based on seed singulation principles all suffer from seed miss problems. The majority of researches on single seed metering devices primarily aims to reduce seed misses. This paper focuses on finding the ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Eurographics Association
Goslar, Germany
Publication History
Published: 01 June 2005
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 23 Jan 2025