Abstract
Isosurface generation algorithms usually need a vertexidentification process since most of polygon-vertices of an isosurface are shared by several polygons. In our observation the identification process is often costly when traditional search algorithms are used. In this paper we propose a new isosurface generation algorithm that does not use the traditional search algorithm for polygon-vertex identification. When our algorithm constructs a polygon of an isosurface, it visits all cells adjacent to the vertices of the polygon, and registers the vertices to polygons inside the visited adjacent cells. The method does not require a costly vertex identification process, since a vertex is registered in all polygons that share the vertex at the same time, and the vertex is not required after the moment. In experimental tests, this method was about 20 percent faster than the conventional isosurface propagation method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Hansen C. D., and Hinker P., Massively Parallel Isosurface Extraction, Proceedings of IEEE Visualization’ 92, pp. 77–83, 1992.
Howie C. T., and Blake E. H., The Mesh Propagation Algorithm for Isosurface Construction, Computer Graphics Forum (Eurographics), Vol. 13, No. 3, pp. C–65–74, 1994.
Durkin J. W., and Hughes J. F., Nonpolygonal Isosurface Rendering for Large Volume, Proceedings of IEEE Visualization’ 94, pp. 293–300, 1994.
Giles M., and Haimes R., Advanced Interactive Visualization for CFD, Computer Systems in Engineering, Vol. 1, No. 1, pp. 51–62, 1990.
Gallagher R. S., Span Filtering: An Optimization Scheme for Volume Visualization of Large Finite Element Models, Proceedings of IEEE Visualization’ 91, pp. 68–74, 1991.
Livnat Y., Shen H., and Johnson C. R., A Near Optimal Isosurface Extraction Algorithm Using the Span Space, IEEE Transactions on Visualization and Computer Graphics, Vol. 2, No. 1, pp. 73–84, 1996.
Shen H., Hansen C. D., Livnat Y., and Johnson C. R., Isosurfacing in Span Space with Utmost Efficiency (ISSUE), Proceedings of IEEE Visualization’ 96, pp. 287–294, 1996.
Welhelms J., and Gelder A. Van, Octrees for Fast Isosurface Generation, ACM Transactions on Graphics, Vol. 11, No. 3, pp. 201–227, 1992.
Silver D., and Zabusky N. J., Quantifying Visualization for Reduced Modeling in Nonlinear Science: Extracting Structures from Data Sets, Journal of Visual Communication and Image Representation, Vol. 4, No. 1, pp. 46–61, 1993.
Itoh T., and Koyamada K., Automatic Isosurface Propagation by Using an Extrema Graph and Sorted Boundary Cell Lists, IEEE Transactions on Visualization and Computer Graphics, Vol. 1, No. 4, pp. 319–327, 1995.
Itoh T., Yamaguchi Y., and Koyamada K., Volume Thinning for Automatic Isosurface Propagation, Proceedings of IEEE Visualization’ 96, pp. 313–320, 1996.
Speray D., and Kennon S., Volume Probe: Interactive Data Exploration on Arbitrary Grids, Computer Graphics, Vol. 24, No. 5, pp. 5–12, 1990.
Doi A., and Koide A., An Efficient Method of Triangulating Equivalued Surfaces by Using Tetrahedral Cells, IEICE Transactions, Vol. E74, No. 1, pp. 214–224, 1991.
Lorensen W. E., and Cline H. E., Marching Cubes: A High Resolution 3D Surface Construction Algorithm, Computer Graphics, Vol. 21, No. 4, pp. 163–169, 1987.
Wyvill G., McPheeters C., and Wyvill B., Data Structure for Soft Objects, The Visual Computer, Vol. 2, No. 4, pp. 227–234, 1986.
Bloomenthal J., Polygonization of Implicit Surfaces, Computer Aided Geometric Design, Vol. 5, No. 4, pp. 341–355, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Itoh, T., Yamaguchi, Y., Koyamada, K. (2000). Fast Isosurface Generation Using the Cell-Edge Centered Propagation Algorithm. In: Valero, M., Joe, K., Kitsuregawa, M., Tanaka, H. (eds) High Performance Computing. ISHPC 2000. Lecture Notes in Computer Science, vol 1940. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39999-2_53
Download citation
DOI: https://doi.org/10.1007/3-540-39999-2_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41128-4
Online ISBN: 978-3-540-39999-5
eBook Packages: Springer Book Archive