Abstrak

Kembali

In this paper we have proposed a specific method of simplification of three dimensional (3D) graphical models (polygonal meshes). Many applications in computer graphics require highly detailed complex models. However, the level of detail actually necessary may vary considerably. To control processing time, it is often desirable to use approximations in place of excessively detailed models. We have developed a simplification algorithm which can produce quality approximations of polygonal meshes. The algorithm uses iterative contractions of vertex pairs to simplify models. Our algorithm can produce good approximations of polygonal surface models which is one of the fastest algorithms available for producing quality approximations and capable of simplifying graphical models of reasonably high complexity. Besides these we have found a new scope of preserving 3D shape at boundary area while simplifying the polygonal meshes.