Skip to main content

Bounding the Distance between a Loop Subdivision Surface and Its Limit Mesh

  • Conference paper
Advances in Geometric Modeling and Processing (GMP 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4975))

Included in the following conference series:

  • 2759 Accesses

Abstract

Given a control mesh of a Loop subdivision surface, by pushing the control vertices to their limit positions, a limit mesh of the Loop surface is obtained. Compared with the control mesh, the limit mesh is a tighter linear approximation in general, which inscribes the limit surface. We derive an upper bound on the distance between a Loop subdivision surface patch and its limit triangle in terms of the maximum norm of the mixed second differences of the initial control vertices and a constant that depends only on the valence of the patch’s extraordinary vertex. A subdivision depth estimation formula for the limit mesh approximation is also proposed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Loop, C.T.: Smooth Subdivision Surfaces Based on Triangles. M.S. Thesis, Department of Mathematics, University of Utah (1987)

    Google Scholar 

  2. Lanquetin, S., Neveu, M.: A Priori Computation of the Number of Surface Subdivision Levels. In: Proceedings of International Conference on Computer Graphics and Vision 2004 (Graphicon 2004), pp. 87–94 (2004)

    Google Scholar 

  3. Wang, H., Sun, H., Qin, K.: Estimating Recursion Depth for Loop Subdivision. International Journal of CAD/CAM 4(1), 11–18 (2004)

    Google Scholar 

  4. Wu, X., Peters, J.: Interference Detection for Subdivision Surfaces. Computer Graphics Forum 23(3), 577–585 (2004)

    Article  Google Scholar 

  5. Wu, X., Peters, J.: An Accurate Error Measure for Adaptive Subdivision Surfaces. In: Proceedings of International Conference on Shape Modeling and Applications 2005 (SMI 2005), pp. 51–56 (2005)

    Google Scholar 

  6. Huang, Z.: Estimating Error Bounds and Subdivision Depths for Loop Subdivision Surfaces. Technical report, Peking University (2007), http://www.graphics.pku.edu.cn/hzj/pub/tr-loop-2007.pdf

  7. Huang, Z., Wang, G.: Distance Between a Catmull-Clark Subdivision Surface and Its Limit Mesh. In: Proceedings of the 2007 ACM Symposium on Solid and Physical Modeling (SPM 2007), pp. 233–240 (2007)

    Google Scholar 

  8. Hoppe, H., DeRose, T., Duchamp, T., Halstead, M., Jin, H., McDonald, J., Schweitzer, J., Stuetzle, W.: Piecewise Smooth Surface Reconstruction. In: Proceedings of SIGGRAPH 1994, pp. 295–302. ACM, New York (2004)

    Google Scholar 

  9. Stam, J.: Evaluation of Loop Subdivision Surfaces. In: Subdivision for Modeling and Animation, SIGGRAPH 1999 Course Notes (1999)

    Google Scholar 

  10. Lai, M.J.: Fortran Subroutines For B-Nets of Box Splines on Three- and Four-Directional Meshes. Numerical Algorithms 2, 33–38 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  11. Farin, G.: Curves and Surfaces for CAGD — A Practical Guide, 5th edn. Morgan Kaufmann Publishers, San Francisco (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Falai Chen Bert Jüttler

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, Z., Wang, G. (2008). Bounding the Distance between a Loop Subdivision Surface and Its Limit Mesh. In: Chen, F., Jüttler, B. (eds) Advances in Geometric Modeling and Processing. GMP 2008. Lecture Notes in Computer Science, vol 4975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79246-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79246-8_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79245-1

  • Online ISBN: 978-3-540-79246-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics