Browse > Article

Efficient 3D Object Simplification Algorithm Using 2D Planar Sampling and Wavelet Transform  

장명호 (LG전자 디스플레이제품연구소)
이행석 (금오공과대학교 컴퓨터공학)
한규필 (금오공과대학교 컴퓨터공학)
박양우 (경운대학교 멀티미디어공학부)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.31, no.5_6, 2004 , pp. 297-304 More about this Journal
Abstract
In this paper, a mesh simplification algorithm based on wavelet transform and 2D planar sampling is proposed for efficient handling of 3D objects in computer applications. Since 3D vertices are directly transformed with wavelets in conventional mesh compression and simplification algorithms, it is difficult to solve tiling optimization problems which reconnect vertices into faces in the synthesis stage highly demanding vertex connectivities. However, a 3D mesh is sampled onto 2D planes and 2D polygons on the planes are independently simplified in the proposed algorithm. Accordingly, the transform of 2D polygons is very tractable and their connection information Is replaced with a sequence of vertices. The vertex sequence of the 2D polygons on each plane is analyzed with wavelets and the transformed data are simplified by removing small wavelet coefficients which are not dominant in the subjective quality of its shape. Therefore, the proposed algorithm is able to change the mesh level-of-detail simply by controlling the distance of 2D sampling planes and the selective removal of wavelet coefficients. Experimental results show that the proposed algorithm is a simple and efficient simplification technique with less external distortion.
Keywords
Mesh simplification; Polygonal surface simplification; Wavelet transform;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Low, K. L. and Tan, T. S., Model simplification using vertex clustering. In 1997 ACM Symposium on Interactive 3D Graphics, pp.75-82. 1997   DOI
2 Rossignac, J. and Borrel, P., Multiresolution 3D approximation for rendering complex scenes. In Geometric Modeling in Computer Graphics, pp. 455-465. 1993
3 Jaideva C. Goswami and Andrew K. Chan. Fundamentals of Wavelets : Theory, Algorithms, and Applications. Published simultaneously in Canada. 1999
4 Jonathan D. Cohen. Concepts and Algorithms for Polygonal Simplification. SIGGRAPH 99 Course Tutorial #20: Interactive Walkthroughs of Large Geometric Datasets. pp. C1-C34. 1999. also in SIGGRAPH 2000 Course Tutorial
5 Greg Turk, 'Re-tiling Polygonal Surfaces,' SIGGRAPH92, pp. 55-64, 1992   DOI
6 I. Daubechies, 'Orthogonal bases of compactly supported wavelets,' Commun. Pure Appl., Math., 41. pp. 909-996, 1988   DOI
7 Hoppe, H., Progressive meshes. In ACM Computer Graphics Proc., Annual Conference Series(Sggraph'96), pp.99-108. 1996   DOI
8 Hoppe, H., DeRose, T., Duchamp, T., Mcdonald, J. and Stuetzle, W., Mesh optimization. In ACM Computer Graphics Proc., Annual Conference Series(Siggraph '93), pp.19-26. 1993   DOI
9 Eric J. StoJlnitz, Tony D. Derose, and David H. Sallesin, Wavelets for Computer Graphics-Theory and Applications, Morgan Kaufmann Publishers, Inc., San Francisco, CA, 1996
10 Matthias Eck, Tony DeRose, Tom Duchamp, Hugues Hoppe, Michael Lounsberry, and Werner Stuetzle, 'Multiresolution Analysis of Arbitrary Meshes,' SIGGRAPH95, pp 173-182, 1995   DOI
11 Markus Gross, O. Staadt, and R. Gatti, 'Efficient Triangular Surface Approximations Using Wavelets and Quadtree Structures,' IEEE Transactions on Visual and Computer Graphics, vol. 2, no. 2, pp. 130-144, 1996   DOI   ScienceOn
12 Michael Garland, Paul S. Heckbert, August Surface Simplification Using Quadric Error Metrics, In SIGGRAPH '97 Proc., pp.209-216. 1997   DOI
13 Carl Erikson, Polygonal Simplification: An Overview. UNC Chapel Hill Computer Science Technical Report TR96-016. 1996
14 David P. Luebke, A Developer's Survey of Polygonal Simplification Algorithms. IEEE Computer Graphics&Applications. vol. 21, no. 3, pp. 24-35, 2001   DOI   ScienceOn
15 Schroeder, W. J. Zarge, J. A. and Lorensen, W. E., Decimation of triangle meshes. In ACM Computer Graphics(SIGGRAPH'92 Proceedings), vol. 26, pp. 55-64, 1992   DOI
16 Michael Garland, Paul S. Heckbert. Simplifying Surfaces with Color and Texture using Quadric Error Metrics. IEEE Visualization'98, pp. 263-270, Oct. 1998   DOI
17 Leach, G., Improving Worst-Case Optimal Delaunay Triangulation Algorithms, Department of Computer Science, Royal Melbourne Institute of Technology, Melborne, Australia, June 15, 1992
18 A. Chohen, I. Daubechies, Ten Lectures on Wavelets. CBMS-NSF Ser, App. Math.. 61. Philadelphia:SIAM, 1992