Jagannathan Lakshmipathy
ABSTRACT
The Marching Cubes (MC) algorithm is a popular approach to extract iso-surfaces from volumetric data. This approach extracts triangles from the volume data for a specific iso-value using a table lookup approach. The lookup entry in the MC is a name value pair, where the name is a number that uniquely identifies a cube topology and the value is the set of triangles for that topology. The MC applies a divide-and-conquer strategy by subdividing the volume into cubes with voxels at each corner of the cube and processes these cubes in a specific order. Thus, for a user specified iso-value, the MC looks up triangles for each cube and thereby generates the whole iso-surface. Most modern graphics hardware renders triangles faster if they are rendered collectively as triangle strips as opposed to individual triangles. Therefore, in this paper we have modified the MC lookup table approach such that the name is the cube topology and the value is a sub-surface piece(s) and its face-index representation. At the time of extraction we tessellate the sub-surface pieces by considering the pieces in the neighboring cubes using the face-index representation and then triangulate these tessellated sub-surface pieces into triangle strips. Our approach is superior to the existing approaches. Its features include: (1) simplicity, (2) procedural triangulation which avoids painful pre-computation, and (3) face-index representation of surface pieces that enables an efficient connection mechanism.
- G. Wyvill, C. McPheeters and B. Wyvill: Data Structure for Soft Objects, The Visual Computer, 2 (1986), pp. 227--234.Google Scholar
Cross Ref
- C. Zhou, R. Shu and M. S. Kankanhalli: Selectively Meshed Surface Reconstruction. Computers & Graphics, 19, 6 (1995), pp. 793--804.Google Scholar
- M. Woo, T. Davis and J. Neider: OpenGL Programming Guide. Addison-Wesley Publishing Company, Reading, MA, 1993.Google Scholar
- W. E. Lorensen and H. E. Cline: Marching Cubes: A High Resolution 3D Surface Construction Algorithm, Computer Graphics 21, 4, (July 1987), pp. 38--44. Google ScholarDigital Library
- J. Wilhelms and A. Van Gelder: Topological Considerations in Isosurface Generation Extended Abstract, Computer Graphics 24, 5, (Nov. 1990), pp. 79--86. Google ScholarDigital Library
- B.K. Natarajan: On generating topologically consistent isosurfaces from uniform samples. Visual Computer 11, 1994, pp. 52--62. Google ScholarDigital Library
- P. Ning and J. Bloomenthal: An Evaluation of Implicit Surface Tilers.Google Scholar
- IEEE Computer Graphics and Applications. (Nov. 1993), pp. 33--41.Google Scholar
- K. Akeley, P. Haeberli, and D. Burns: tomesh.c: C Program on SGI Developer's Toolbox.Google Scholar
- E. Arkin, M. Hled, J. Mitchell, and S. Skiena. Hamiltonian triangulations for fast rendering. In Second Annual European Symposium on Algorithms, Springer-Verlag Lecture Notes in Computer Science, Vol. 855, pp 36--47. Google ScholarDigital Library
- M. Deering: Geometry compression. Computer Graphics Proceedings, Annual Conference Series, (1995), pp 13--20. Google ScholarDigital Library
- M.J. Durst: Letters: additional reference to marching cubes. Computer Graphics 22, 1988, pp. 72--73. Google ScholarDigital Library
- R. Bar-Yehuda and C. Gotsman. Time/space tradeoffs for polygon mesh rendering. ACM Transactions on Graphics, (1996), pp. 141--152. Google ScholarDigital Library
- F. Evans, S. Skiena and A. Varshney: Optimizing Triangle Strips for Fast Rendering. Proceedings of IEEE Visualization, (1996), pp. 319--326. Google ScholarDigital Library
- F. Evans, S. Skiena, and A. Varsheny. Completing sequential triagulations is hard. Technical report, Department of Computer Science, State Univ. of New York at Stony Brook, NY 11794-4400, 1996.Google Scholar
- G. T. Herman and J. K. Udupa: Display of 3D Digital ImagesL Computational Foundations and Medical Applications. IEEE Computer Graphics & Applications3, 5 (Aug. 1983), pp. 39--46.Google Scholar
- E. J. Farrel: Color Display and Interactive Interpretation of Three-Dimensional Data. IBM J. Res. Develop 27, 4 (July 1983), pp. 356--366.Google Scholar
- D. J. Meagher: Geometric Modeling Using Octree Encoding. Computer Graphics and Image Processing 19, 2 (June 1982), pp. 129--147.Google ScholarCross Ref
- W. L. Nowinski: Computerized brain atlases for surgery of movement disorders. Seminars in Neurosurgery 2001;12(2):183--194.Google Scholar
- K. H. Hohne and R. Bernstein: Shading 3D-Images from CT Using Gray-Level gradients. IEEE Trans. On Medical Imaging MI-5, 1 (March 1986), pp. 45--47Google ScholarCross Ref
Index Terms
- A novel approach to extract triangle strips for iso-surfaces in volumes
Recommendations
Efficiently computing and updating triangle strips for real-time rendering
AbstractTriangle strips are a widely used hardware-supported data-structure to compactly represent and efficiently render polygonal meshes. In this paper we survey the efficient generation of triangle strips as well as their variants. We ...
Multi-Path Algorithm for Triangle Strips
CGI '04: Proceedings of the Computer Graphics InternationalTriangle surface models belong to the most populartype of geometric objects description in computer graphics.Therefore, the problem of fast visualization of this typeof data is often solved. One of popular approaches is stripification,i.e., a conversion ...
Level-of-Detail Triangle Strips for Deforming Meshes
ICCS '08: Proceedings of the 8th international conference on Computational Science, Part IIApplications such as video games or movies often contain deforming meshes. The most-commonly used representation of these types of meshes consists in dense polygonal models. Such a large amount of geometry can be efficiently managed by applying level-...
Comments