Browse > Article

Polygon Reduction Algorithm for Three-dimensional Surface Visualization  

유선국 (연세대학교 의학공학교실)
이경상 (연세대학교 대학원 생체공학과)
배수현 (삼성종합기술)
김남현 (연세대학교 의학공학교실)
Publication Information
The Transactions of the Korean Institute of Electrical Engineers D / v.53, no.5, 2004 , pp. 368-373 More about this Journal
Abstract
Surface visualization can be useful, particularly for internet-based education and simulation system. Since the mesh data size directly affects the downloading and operational performance, the problem that should be solved for efficient surface visualization is to reduce the total number of polygons, constituting the surface geometry as much as Possible. In this paper, an efficient polygon reduction algorithm based on Stokes＇ theorem, and topology preservation to delete several adjacent vertices simultaneously for past polygon reduction is proposed. The algorithm is irrespective of the shape of polygon, and the number of the polygon. It can also reduce the number of polygons to the minimum number at one time. The performance and the usefulness for medical imaging application was demonstrated using synthesized geometrical objects including plane. cube. cylinder. and sphere. as well as a real human data.
Keywords
surface visualization; arbitrary polygon; average plane; Stokes′ theorem;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Robert R. Mercer, Gray M. Mccauley, Satich Anjilvel, 'Approximation of Surfaces in Quantitative 3-D Reconstructions,' IEEE Trans. of Biomedical Engineering, vol. 37, No. 1, pp. 1136-1145, December, 1990   DOI   ScienceOn
2 Stephen Bright and Susan Laflin, 'Shading of Solid Voxel Models,' Computer Graphics, vol.5, No. 2, pp. 131-138, June, 1986   DOI   ScienceOn
3 G.T. Herman 'Image Reconstruction from projection : Implementation and Applications,' New York, Springer-Verlag, 1979
4 P.A.Warrick, W.R.J. Funnell, 'VRML-based anatomical visualization tool for medical education,' IEEE trans. Inform, Techno. Biomed., vol.2, pp.55-61, 1998   DOI   ScienceOn
5 Will Schroeder, Hen Martin, Bill Lorensen, Visualization Toolkit, Prentice Hall, 1997
6 G.T. Herman 'Three dimensional imaging on a CT and MR scanner,' J. Comput. Assist. Tomogra. Vol. 12, pp. 450-458, 1988   DOI   ScienceOn
7 Paolo Sabela, 'A rendering Algorithm for Visualizing 3D scalar Fields,' Computer Graphics, vol. 22, No. 4, August, pp. 160-167, 1988
8 Dennis D. Crouch, Richard A. Robb, 'A New Algorithm for Efficient Polygon Decimation for virtual Reality Applications in Medicine,' SPIE vol. 3031, pp. 514-517
9 Bradley A Payne, Arthur W. Toga, 'Surface Reonstruction bu Multiaxial Triangulation,' IEEE Computer Graphics and Applications, pp. 28-35, November, 1994
10 W.E. Lorensen, and H.E. Cline, 'Marching cubes: A High Resolution 3 D Surface Construction Algorithm,' Computer Graphics, Vol. 25, No. 3, July 1991
11 William J. Schroeder, Jonathan A. Zarge, William E. Lorensen, 'Decimation of Triangle Meshes,' Computer Graphics, Vol. 26, pp. 65-70   DOI
12 Tran S. Gieng, Bermd Hamann, Kenneth I. Joy, Gregory L. Schussman, Issac J. Trotts, 'Smooth Hierarchical Surface Triangulation,' IEEE, pp.379-386   DOI
13 David K. Cheng, ' Fundamentals of Engineering Electromagnetics,' Addison-Wesley, April, 1994