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 integers to represent the surface topology. We also introduce a new scheme to encode and decode the hierarchy of meshes generated by the simplification algorithm. This scheme can be used for progressive transmission and compression of meshes.
منابع مشابه
Stellar Mesh Simplification Using Probabilistic Optimization
This paper introduces the Stellar Simplification scheme, a fast implementation of the Four–Face Cluster algorithm. In this scheme, a probabilistic optimization heuristic substitutes the priority queue of the original algorithm, which results in a 40% faster algorithm with the same order of distortion. This implementation uses a very concise data structure which consists only of two arrays of in...
متن کاملAssessment of mesh simplification algorithm quality
This paper describes a method to compare an original mesh and its simplified representation. Meshes considered here contain geometric features as well as other surface attributes such as material colors, texture, temperature, and radiation, etc. Many simplification algorithms have been presented in literature. In this paper we present a new method to assess mesh simplification algorithm quality...
متن کاملA comparison of mesh simplification algorithms
In many applications the need for an accurate simplification of surface meshes is becoming more and more urgent. This need is not only due to rendering speed reasons, but also to allow fast transmission of 3D models in network-based applications. Many different approaches and algorithms for mesh simplification have been proposed in the last few years. We present a survey and a characterization ...
متن کاملFast Mesh Simplification for Progressive Transmission
A very fast mesh simplification algorithm based on halfedge collapse is proposed in this work with a focus on progressive graphic transmission applications. We generalize the Quadric Error Metric (QEM) method to accommodate new topological operations. A flatness criterion is combined with the defined metric to preserve the visual quality of simplified meshes. We further adopt the vertex-based p...
متن کاملStreaming Simplification of Tetrahedral Meshes
Unstructured tetrahedral meshes are commonly used in scientific computing to represent scalar, vector, and tensor fields in three dimensions. Visualization of these meshes can be difficult to perform interactively due to their size and complexity. By reducing the size of the data, we can accomplish real-time visualization necessary for scientific analysis. We propose a two-step approach for str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003