Clustering based hierarchical level-of-detail with bounded error

Abstract

With the fast development of virtual reality(VR),many people notice that it will add the reality to the VR system if we can use different levels of detail(LOD) of 3D models to implement the VR system. In the field of 3D computer graphics, we usually use polygons to compose a 3D model. The more polygons we could use, the more detail we could see. The aim of LOD generation is to retain the important visual characteristics of the original object, and generate a whole series of simplifications. in this paper, we will propose a new algorithm to solve this LOD problem. It is clustering-based and uses pair-wise mesh merging techniques to generate new meshes. During the merging process, we still consider some clustering constraints in order topreserve geometry primitives. This algorithm is well proved and tested. It is an efficient and fast algorithm,and has good reduction rate.