Triangular meshes are widely used in computer graphics fields, such as GIS, CAD and VR. Very complex models, with hundreds of thousands of faces, are easily produced by curremt CAD tools, automatic acquisition devices, or by fitting isosurfaces out of volume datasets. Many geometric datasets require a larg amount of disk space. One of the solutions is to compress those large geometric data sets with geometric compression algorithms. On the other hand, a highly complex data representation is not always necessery. For example, a full size model is not required for generation of each frame of an interactive visualization. This has led to substantial research on the surface mesh compression or mesh simplification. We present a method to deal with both issues. It breaks down the triangle meshes into a set of triangle strips and vertex chains. Following that, inter-triangle-strip simplification and intra-triangle-strip simplification are used to simplify the meshes. The method can not only compress the mesh geometry datasets for hard disk storage, but also simplify the meshes for the purposes of rendering and displaying. The results show the validity and efficiency of our method.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.