Advertisement

Fast and Reliable Decimation of Polygonal Models Based on Volume and Normal Field

  • Muhammad Hussain
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6453)

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.

Keywords

Geometric Deviation Polygonal Model Memory Overhead Vertex Attribute Huge Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Boubekeur, T., Alexa, M.: Mesh simplification by stochastic sampling and topological clustering. Computers and Graphics 33, 241–249 (2009)CrossRefGoogle Scholar
  3. 3.
    Garland, M., Heckbert, P.S.: Surface simplification using quadric error metric. In: Proc. SIGGRAPH 1997, pp. 209–216 (1997)Google Scholar
  4. 4.
    Lindstrom, P., Turk, G.: Evaluation of memoryless simplification. IEEE Transactions on Visualization and Computer Graphics 5, 98–115 (1999)CrossRefGoogle Scholar
  5. 5.
    Hussain, M., Okada, Y.: Lod modelling of polygonal models. Machine Graphics and Vision 14, 325–343 (2005)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Southern, R., Marais, P., Blake, E.: Gems: Generic memoryless polygonal simplification. In: Proc. Computer Graphics, Virtual Reality, Visualization and Interaction, pp. 7–15 (2001)Google Scholar
  8. 8.
    Cohen, D.S., Alliez, P., Desbrun, M.: Variational shape approximation. ACM Transactions on Graphics 23, 905–914 (2004)CrossRefGoogle Scholar
  9. 9.
    Guskov, I., Sweldens, W., Schroeder, P.: Multiresolution signal processing for meshes. In: Proc. SIGGRAPH 1999, pp. 325–334 (1999)Google Scholar
  10. 10.
    Sorkine, O., Cohen-OR, D., Toledo, S.: High-pass quantization for mesh encoding. In: Proc. Symp. on Geometry Processing 2003, pp. 42–51 (2003)Google Scholar
  11. 11.
    Wu, J., Kobbelt, L.: Fast mesh decimation by multiple-choice techniques. In: Proc. Vision, Modeling, and Visualization 2002, pp. 241–248 (2002)Google Scholar
  12. 12.
    Cignoni, P., Rocchini, C., Scopigno, R.: Metro: Measuring error on simplified surfaces. Computer Graphics Forum 17, 167–174 (1998)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Muhammad Hussain
    • 1
  1. 1.Department of Computer Science, College of Computer and Information ScienceKing Saud UniversityKingdom of Saudi Arabia

Personalised recommendations