Abstract
Two simplification algorithms are proposed for automatic decimation of polygonal models, and for generating their LODs. Each algorithm orders vertices according to their priority values and then removes them iteratively. For setting the priority value of each vertex, exploiting normal field of its one-ring neighborhood, we introduce a new measure of geometric fidelity that reflects well the local geometric features of the vertex. After a vertex is selected, using other measures of geometric distortion that are based on normal field deviation and distance measure, it is decided which of the edges incident on the vertex is to be collapsed for removing it. The collapsed edge is substituted with a new vertex whose position is found by minimizing the local quadric error measure. A comparison with the state-of-the-art algorithms reveals that the proposed algorithms are simple to implement, are computationally more efficient, generate LODs with better quality, and preserve salient features even after drastic simplification. The methods are useful for applications such as 3D computer games, virtual reality, where focus is on fast running time, reduced memory overhead, and high quality LODs.
Article PDF
Similar content being viewed by others
References
Hussain M. Fast decimation of polygonal models. In Proc. ISVC 2008, Part I, LNCS 5358, Springer-Verlag, Las Vegas, USA, Dec. 2–4, 2008, pp.119–128.
Cohen D S, Alliez P, Desbrun M. Variational shape approximation. ACM Trans. Graphics, 2004, 23(3): 905–914.
Luebke D. A survey of polygonal simplification algorithms. Technical Report TR97-045, Department of Computer Science, University of North Carolina, December, 1997.
Cignoni P, Montani C, Scopigno R. A comparison of mesh simplification algorithms. Computer & Graphics, 1998, 22(1): 37–54.
Garland M. Quadric-based polygonal surface simplification [Ph.D. Dissertation]. Carnegie Mellon University, May 1999.
Lindstrom P. Model simplification using image and geometry-based metrics [Ph.D. Dissertation]. Georgia Institute of Technology, November 2000.
Oliver M K, Hélio P. A comparative evaluation of metrics for fast mesh simplification. Computer Graphics Forum, June 2006, 25(2): 197–210.
Garland M, Heckbert P S. Surface simplification using quadric error metric. In Proc. SIGGRAPH'97, Los Angeles, USA, August 2–8, 1997, pp.209–216.
Lindstrom P, Turk G. Fast and memory efficient polygonal simplification. In Proc. IEEE Visualization'98, NC, USA, Oct. 18–23, 1998, pp.279–286.
Kim S J, Kim C H, Levin D. Surface simplification using a discrete curvature norm. Computers & Graphics, 2002, 26(5): 657–663.
Yan J, Shi P, Zhang D. Mesh simplification with hierarchical shape analysis and iterative edge contraction. Trans. Visualization and Computer Graphics, 2004, 10(2): 142–151.
Yoshizawa S, Belyaev A, Seidel H P. Fast and robust detection of crest lines on meshes. In Proc. ACM Symp. Solid and Physical Modeling'05, Wales, UK, June 2–4, 2005, 227–232.
Brodsky D, Watson B. Model simplification through refinement. In Proc. Conference Graphics Interface, Quebec, Canada, May 15–17, 2000, pp.221–228.
Ramsey S D, Bertram M, Hansen C. Simplification of arbitrary polyhedral meshes. In Proc. Conference Computer Graphics and Imaging, Hawaii, USA, August 13-15, 2003, pp.221–228.
Southern R, Marais P, Blake E. Generic memoryless polygonal simplification. In Proc. Int. Conf. Computer Graphics, Virtual Reality, Visualization and Interaction in Africa, Cape Town, South Africa, Nov. 5–7, 2001, pp.7–15.
Hussain M, Okada Y. LOD modelling of polygonal models. Machine Graphics and Vision, 2005, 14(3): 325–343.
Hussain M, Okada Y, Niijima K. Efficient and feature-preserving triangular mesh decimation. Journal of WSCG, 12(1): 2004, pp.167–174.
Erikson C, Manocha D. GAPS: General and automatic polygonal simplification. In Proc. ACM Symposium on Interactive 3D Graphics'99, Georgia, USA, April 26–28, 1999, pp.79–88.
Alliez P, Laurent N, Sanson H, Schmitt F. Mesh approximation using a volume-based metric. In Proc. Pacific Graphics Conference, Seoul, Korea, Oct. 5–7, 1999, pp.292–301.
Park I, Shirani S, Capson D W. Mesh simplification using an area-based distortion measure. Journal of Mathematical Modelling and Algorithms, 2006, 5(3): 309–329.
Tang H, Shu H Z, Dillenseger J L, Bao X D, Luo L M. Moment-based metrics for mesh simplification. Computers & Graphics, 2007, 31(5): 710–718.
Guskov I, Sweldens W, Schroeder P. Multiresolution signal processing for meshes. In Proc. SIGGRAPH'99, Los Angeles, USA, August 8–13, 1999, pp.325–334.
Fu J H. Convergence of curvatures in secant approximations. Jouranl of Differential Geometry, 1993, 37: 177–190.
Chen H K, Chen R M, Fahn C S, Tsai J J, Lin M B. A linear time algorithm for high quality mesh simplification. In Proc. the 6th IEEE International Symp. Multimedia Software Engineering'04, Miami, USA, Dec. 13–15, 2004, pp.169–176.
Chen H K, Fahn C S, Tsai J J, Chen R M, Lin M B. Generating high-quality discrete LOD meshes for 3D computer games in linear time. Multimedia Systems, March 2006, 11(5): 480–494.
Wu J, Kobbelt L. Fast mesh decimation by multiple-choice techniques. In Proc. Int. Fall Workshop on Vision, Modeling, and Visualization'02, Erlangen, Germany, Nov. 20–22, 2002, pp.241–248.
Cignoni P, Rocchini C, Scopigno R. Metro: Measuring error on simplified surfaces. Computer Graphics Forum, 1998, 17(2): 167–174.
Cignoni P. Metro tool. 2007, http://vcg.sourceforge.net/tiki-index.php?page=Metro.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hussain, M. Efficient Simplification Methods for Generating High Quality LODs of 3D Meshes. J. Comput. Sci. Technol. 24, 604 (2009). https://doi.org/10.1007/s11390-009-9249-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11390-009-9249-9