Mesh Simplification Using Four-Face Clusters
نویسنده
چکیده
In this paper we introduce a new algorithm for simplification of polygonal meshes. It generates a variable resolution structure called hierarchical 4-K mesh. This structure is a powerful representation for non-uniform level of detail that, among other things, allows simple and efficient extraction of conforming meshes.
منابع مشابه
3d Face Correspondence Based on Uniform Mesh Resampling Combined with Mesh Simplification
This present study, proposes a new 3D face correspondence method. A uniform mesh re-sampling algorithm is combined with mesh simplification algorithm to make correspondence between vertices of prototypical 3D faces. Uniform mesh re-sampling algorithm is developed to obtain the same topology between 3D faces with different structures. A global error metrics is proposed and mesh simplification is...
متن کاملOrganization and Simplification of High-Resolution 3D City Facades
This paper describes an approach for the organization and simplification of high-resolution geometry and imagery data for 3D buildings for interactive city navigation. At the highest level of organization, building data are inserted into a global hierarchy that supports the large-scale storage of cities around the world. This structure also provides fast access to the data suitable for interact...
متن کاملFast Stellar Mesh Simplification
This paper introduces Stellar Simplification, a fast implementation of the Four–Face Cluster algorithm. In our version of this mesh simplification scheme, we adopt a probabilistic heuristic that substitutes the priority queue of the original algorithm. This made our version, in average, 40% faster. In our implementation, we adopt a very concise data structure which uses only two arrays of integ...
متن کاملMesh simplification using ellipsoidal schema for isotropic quantization of face-normal vectors
In this paper, we present a method for simplification of arbitrary 3D meshes that is based on Isotropic Quantization of face-normal vectors. There are three stages. Firstly, a codebook that contains the unique face-normal vectors of the 3D mesh is generated using our Ellipsoidal Schema. Secondly, the polygons of the mesh are grouped into patches: based on the codebook vectors and the locality i...
متن کاملAn Effective Feature-Preserving Mesh Simplification Scheme Based on Face Constriction
A new mesh simplification scheme that uses the face constriction process is presented. By introducing a statistical measure that can distinguish triangles having vertices of high local roughness from triangles in flat regions into our weight-ordering equation, along with other heuristics, our scheme can better preserve visually important features in the original mesh. To improve the shape quali...
متن کامل