모델 단순화를 위한 오차 측정 방법

Error measure for vertex simplification

  • 김윤정 (이화여자대학교 정보통신학과) ;
  • 이병욱 (이화여자대학교 정보통신학과)
  • Kim Yoonjung (Ewha Womans University Information Electronics) ;
  • Lee Byung-Uk (Ewha Womans University Information Electronics)
  • 발행 : 2005.11.01

초록

이동 통신이나 인터넷 채널과 같이 전송용량이 제한적인 환경에서 3차원 물체에 그래픽의 사용이 빈번해 지면서 3차원 모델을 단순화시켜야할 필요성이 증대되고 있다. 삼각형으로 표현된 3차원 물체의 표면을 단순화시키는 경우, 3차원 공간에서의 꼭지점들 중에서 제일 가까운 점 두 개를 선택하여 반복적으로 데이터를 줄여가는 vertex contraction 방법이 많이 사용되고 있다. 이때 단순화 된 점의 위치를 결정하기 위하여 단순화시 발생하는 오차를 계산하여야 한다. 본 논문에서는 새로운 오차 계산법을 제시하여 원 모델과의 오차가 작게 단순화하는 방법을 제안하고, 이를 3차원 모델 데이터에 적용하여 실제 개선결과를 확인한다.

Simplification of 3D models is becoming necessary with popularity of 3D graphics over mobile or the internet channels with limited channel capacity. Surfaces of a 3D model are usually approximated by a series of triangular meshes, and vertex contraction method is employed widely to minimize the deviation from the original model. Determination of the best position after contraction depends on the calculation of simplification error. We propose a new measure for computing the error so that the simplified model represents the original faithfully. We demonstrate the improved results with real 3D models.

키워드

참고문헌

  1. W. J. Schroeder, J. A. Zarge, and W. E. Lorensen, 'Decimation of Triangle Meshes,'Proceedings of the ACM SIGGRAPH '92, pp. 65-70, 1992 https://doi.org/10.1145/133994.134010
  2. Jarek Rossignac and Paul Borrel, 'Multi-resolution 3D approximations for rendering complex scenes,' Modeling in Computer Graphics: Methods and Applications, pp. 455-465, June 28-July 2 1993
  3. Sun-Jeong Kim, Soo-Kyun Kim, and Chang-Hun Kim. 'Discrete differential error metric for surface simplification,' 10th Pacific Conference on Computer Graphics and Applications, 2002. Proceedings, pp. 276 - 283, Oct. 2002 https://doi.org/10.1109/PCCGA.2002.1167871
  4. Jingqi Yan, Pengfei Shi, and David Zhang, 'Mesh Simplification with Hierachical Shape Analysis and Iterarive Edge Contraction,' IEEE Trans. on Visualization and Computer Graphics, Vol. 10, No. 2, pp. 142 - 151, Mar/Apr 2004 https://doi.org/10.1109/TVCG.2004.1260766
  5. Michael Garland and Paul S. Heckbert, 'Simplifying surface with color and texture using quadric error metrics,' IEEE Visualization 98 Conference Proceedings, pp. 263-269, October 1998 https://doi.org/10.1109/VISUAL.1998.745312
  6. P. Lindstrom and G. Turk., 'Fast and Memory Efficient Polygonal Simplification,' Proceedings of the IEEE Conf. on Visualization '98, pp. 279-286, 1998 https://doi.org/10.1109/VISUAL.1998.745314
  7. H. Hoppe, 'Progressive Meshs,' Proceedings of the ACM SIGGRAPH '96, pp. 99-108, 1996 https://doi.org/10.1145/237170.237216
  8. R. Ronfard, J. Rossignac, and J. Rossignac, 'Full-range approximation of triangulated polyhedra,' Proceedings of the Eurographics, Computer Graphics Forum, vol. 15, no. 3, pp. 67-76, Aug. 1996 https://doi.org/10.1111/1467-8659.1530067
  9. Andre Guziec, 'Surface simplification with variable tolerance,' Second Annual Intl. Symp. On Medical Robotics and Computer Assisted Surgery (MRCAS '95), pp. 132-139, November 1995