Abstract
Fast, reliable, and feature preserving automatic decimation of polygonal models is a challenging task. Exploiting both local volume and normal field variations in a novel way, a two phase decimation algorithm is proposed. In the first phase, a vertex is selected randomly using the measure of geometric fidelity that is based on normal field variation across its one-ring neighborhood. The selected vertex is eliminated in the second phase by collapsing an outgoing half-edge that is chosen by using volume based measure of geometric deviation. The proposed algorithm not only has better speed-quality trade-off but also keeps visually important features even after drastic simplification in a better way than similar state-of-the-art best algorithms; subjective and objective comparisons validate the assertion. This method can simplify huge models efficiently and is useful for applications where computing coordinates and/or attributes other than those attached to the original vertices is not allowed by the application and the focus is on both speed and quality of LODs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yan, J., Shi, P., Zhang, D.: Mesh simplification with hierarchical shape analysis and iterative edge contraction. Transactions on Visualization and Computer Graphics 10, 142–151 (2004)
Boubekeur, T., Alexa, M.: Mesh simplification by stochastic sampling and topological clustering. Computers and Graphics 33, 241–249 (2009)
Garland, M., Heckbert, P.S.: Surface simplification using quadric error metric. In: Proc. SIGGRAPH 1997, pp. 209–216 (1997)
Lindstrom, P., Turk, G.: Evaluation of memoryless simplification. IEEE Transactions on Visualization and Computer Graphics 5, 98–115 (1999)
Hussain, M., Okada, Y.: Lod modelling of polygonal models. Machine Graphics and Vision 14, 325–343 (2005)
Hussain, M.: Efficient simplification methods for generating high quality lods of 3d meshes. Journal of Computer Science and Technology 24, 604–inside back cover (2009)
Southern, R., Marais, P., Blake, E.: Gems: Generic memoryless polygonal simplification. In: Proc. Computer Graphics, Virtual Reality, Visualization and Interaction, pp. 7–15 (2001)
Cohen, D.S., Alliez, P., Desbrun, M.: Variational shape approximation. ACM Transactions on Graphics 23, 905–914 (2004)
Guskov, I., Sweldens, W., Schroeder, P.: Multiresolution signal processing for meshes. In: Proc. SIGGRAPH 1999, pp. 325–334 (1999)
Sorkine, O., Cohen-OR, D., Toledo, S.: High-pass quantization for mesh encoding. In: Proc. Symp. on Geometry Processing 2003, pp. 42–51 (2003)
Wu, J., Kobbelt, L.: Fast mesh decimation by multiple-choice techniques. In: Proc. Vision, Modeling, and Visualization 2002, pp. 241–248 (2002)
Cignoni, P., Rocchini, C., Scopigno, R.: Metro: Measuring error on simplified surfaces. Computer Graphics Forum 17, 167–174 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hussain, M. (2010). Fast and Reliable Decimation of Polygonal Models Based on Volume and Normal Field. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2010. Lecture Notes in Computer Science, vol 6453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17289-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-17289-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17288-5
Online ISBN: 978-3-642-17289-2
eBook Packages: Computer ScienceComputer Science (R0)