Korean Journal of Computational Design and Engineering (한국CDE학회논문집)

Society for Computational Design and Engineering (한국CDE학회)
권호 표지

A Compact and Efficient Polygonal Mesh Representation

간결하고 효율적인 폴리곤 메쉬의 표현 구조

  • 박상근 (충주대학교 기계공학과) ;
  • 이상헌 (국민대학교 자동차공학전문대학원)
  • Published : 2004.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

Highly detailed geometric models are rapidly becoming commonplace in computer graphics and other applications. These complex models, which is often represented as complex1 triangle meshes, mainly suffer from the vast memory requirement for real-time manipulation of arbitrary geometric shapes without loss of data. Various techniques have been devised to challenge these problems in views of geometric processing, not a representation scheme. This paper proposes the new mesh structure for the compact representation and the efficient handling of the highly complex models. To verify the compactness and the efficiency, the memory requirement of our representation is first investigated and compared with other existing representations. And then we analyze the time complexity of our data structure by the most critical operation, that is, the enumeration of the so-called one-ring neighborhood of a vertex. Finally, we evaluate some elementary modeling functions such as mesh smoothing, simplification, and subdivision, which is to demonstrate the effectiveness and robustness of our mesh structure in the context of the geometric modeling and processing.

Keywords

References

  1. Zorin, D., Schroeder, P. and Sweldens, W., 'Interactive multiresolution mesh editing,' In SIGGRAPH 97 Conference Proceedings, pp. 259-268, 1997
  2. Lee, S., 'Interactive multiresolution editing of arbitrary meshes,' Computer Graphics Forum, Vol. 18, No. 3, pp. 73-82, 1999 https://doi.org/10.1111/1467-8659.00329
  3. Baumgart, B. G., 'Winged-edge polyhedron representation,' Technical Report STAN-CS-320, Standford University, Computer Science Department, 1972
  4. Campagna, S., Kobbelt, L. and Seidel, H.-P., 'Directed edges: A scalable representation for triangle meshes,' Journal of Graphics Tools, Vol. 3, No.4, pp. 1-11, 1998 https://doi.org/10.1080/10867651.1998.10487494
  5. Hoppe, H., 'Progressive meshes,' In SIGGRAPH 96 Conference Proceedings, pp. 99-108, 1996
  6. Hoppe, H., 'Efficient implementation of progressive meshes,' Computer and Graphics, Vol. 22, No. 1, pp. 27-36, 1998 https://doi.org/10.1016/S0097-8493(97)00081-2
  7. Lee, S. H. and Lee, K. W., 'Partial entity structure: A compact boundary representation for non-manifold geometric modeling,' ASME Journal of Computing & Information Science in Engineering, Vol. 1, No. 4, pp. 356-365, 2001 https://doi.org/10.1115/1.1433486
  8. Woo, T. C., 'A combinational analysis of boundary data structure schemata,' IEEE Comput. Graphics Appl., Vol. 5, No.3, pp. 19-27, 1985 https://doi.org/10.1109/MCG.1985.276337
  9. OpenMesh homepage, http://www.openmesh.org
  10. Welch, W. and Witkin, A., 'Free-form shape design using triangulated surfaces,' In SIGGRAPH 94 Conference Proceedings, pp. 247-256, 1994
  11. Desbrun, M., Meyer, M., Schroder, P. and Barr, A. H., 'Implicit fairing of irregular meshes using diffusion and curvature flow,' In SIGGRAPH 99 Conference Proceedings, pp. 317-324, 1999
  12. Schneider, R. and Kobbelt, L., 'Geometric fair meshes with G1 boundary conditions,' In Proceedings Geometric Modeling and Processing, pp. 251-261, 2000
  13. Vollmer, J., Mencl, R. and Muller, H., 'Improved laplacian smoothing of noisy surface meshes,' In Computer Graphics Forum (Proc. Eurographics), pp. 131-138, 1999
  14. Turk, G., 'Re-tiling polygonal surfaces,' In Computer Graphics (SIGGRAPH 92 Conference Proceedings), Vol. 26, pp. 55-64, 1992
  15. Schroeder, W. J., Zarge, J. A. and Lorensen, W. E., 'Decimation of triangle meshes,' In Computer Graphics (SIGGRAPH 92 Conference Proceedings), Vol. 26, pp. 65-70, 1992
  16. Rossignac, J. and Borrel, P., 'Multi-resolution 3D approximation for rendering complex scenes,' In Second Conference on Geometric Modeling in Computer Graphics, Genova, Italy, pp. 453-465, 1993
  17. Hoppe, H., DeRose, T., Duchamp, T., McDonald, J. and Stuetzle, W., 'Mesh optimization,' In SIGGRAPH 93 Conference Proceedings, pp. 19-26, 1993
  18. Garland, M. and Heckbert, P., 'Surface simplification using quadric error metrics,' In SIGGRAPH 97 Proceedings, pp. 209-216, 1997
  19. Zorin, D., 'Subdivision for modeling and animation,' In SIGGRAPH Course Notes, 2000
  20. Doo, D. and Sabin, M., 'Behavior of recursive subdivision surfaces near extraordinary points,' Computer Aided Design, Vol. 10, pp. 356-360, 1978
  21. Catmul, E. and Clark, J., 'Recursively generated Bspline surfaces on arbitrary topological meshes,' Computer Aided Design, Vol. 10, pp. 350-355, 1978
  22. Kobbelt, L., 'Interpolatory subdivision on open quadrilateral nets with arbitrary topology,' Computer Graphics Forum, Vol. 15, No.3, pp. 409-420, 1996 https://doi.org/10.1111/1467-8659.1530409
  23. Dyn, N., Levin, D. and Gregory, J. A., 'A butterfly subdivision scheme for surface interpolation with tension control,' ACM Transactions on Graphics, Vol. 9, No.2, pp. 160-169, 1990 https://doi.org/10.1145/78956.78958
  24. Loop, C. T., Smooth subdivision surfaces based on triangles, Master's thesis, University of Utah, Department of Mathematics, 1987
  25. Kobbelt, L., '$\sqrt3$Subdivision,' In Computer Graphics Proceedings, Annual Conference Series, 2000
  26. 공창환, 김창헌, 'LOD Renderings과 전송을 위한 Mesh의 Multiresolution 표현,' 한국캐드캠학회 학술발표회 논문집, pp. 177-182, 1998