Skip to main content

Methods for Approximating Loop Subdivision Using Tessellation Enabled GPUs

  • Conference paper
Advances in Visual Computing (ISVC 2012)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 7431))

Included in the following conference series:

Abstract

Subdivision surfaces provide a powerful alternative to polygonal rendering. The availability of tessellation supported hardware presents an opportunity to develop algorithms that can render subdivision surfaces in realtime. We discuss the performance of approximating Loop Subdivision surfaces using tessellation-enabled GPUs in terms of speed and quality of rendering for these methods as well as the implementation strategy. We also propose a novel one pass unified rendering setup for all three methods. Subdivision using the Loop method supports arbitrary triangle meshes and provides for easy transition from polygonal rendering of triangles to the parametric domain. Majority of graphics software applications, especially game engines, render polygons as triangles. The objectives of this paper are to evaluate the performance of smooth rendering algorithms developed to take advantage of tessellator enabled GPUs, provide an easy transition from polygonal to parametric rendering and propose an optimal way to achieve multi-level rendering dependent on performance and visual needs of the application.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Luebke, D., Humphreys, G.: How gpus work. Computer 40, 96–100 (2007)

    Article  Google Scholar 

  2. Kautz, J.: Hardware lighting and shading: A survey. In: Computer Graphics Forum, vol. 23, pp. 85–112. Wiley Online Library (2004)

    Google Scholar 

  3. Akenine-Moller, T., Haines, E.: Real-time rendering. AK (2002)

    Google Scholar 

  4. Kry, P., James, D., Pai, D.: Eigenskin: real time large deformation character skinning in hardware. In: Proceedings of the 2002 ACM SIGGRAPH/Eurographics Symposium on Computer Animation, pp. 153–159. ACM (2002)

    Google Scholar 

  5. Baran, I., Popović, J.: Automatic rigging and animation of 3d characters. In: ACM SIGGRAPH Papers, p. 72. ACM (2007)

    Google Scholar 

  6. Loop, C.: Smooth Subdivision Surfaces Based on Triangles. Master’s Thesis, University of Utah 1, 1–74 (1987)

    Google Scholar 

  7. Vlachos, A., Peters, J., Boyd, C., Mitchell, J.: Curved PN triangles. In: Proceedings of the 2001 Symposium on Interactive 3D Graphics, pp. 159–166. ACM (2001)

    Google Scholar 

  8. Walton, D.J., Meek, D.S.: A triangular G1 patch from boundary curves. Computer-Aided Design 28, 113–123 (1996)

    Article  Google Scholar 

  9. Boubekeur, T., Schlick, C.: Approximation of subdivision surfaces for interactive applications. In: ACM Siggraph Sketch Program (2007)

    Google Scholar 

  10. Boubekeur, T., Schlick, C.: Qas: Real-time quadratic approximation of subdivision surfaces (2007)

    Google Scholar 

  11. Fünfzig, C., Müller, K., Hansford, D., Farin, G.: PNG1 triangles for tangent plane continuous surfaces on the GPU. In: GI 2008: Proceedings of Graphics Interface 2008, pp. 219–226. Canadian Information Processing Society, Toronto (2008)

    Google Scholar 

  12. Loop, C., Schaefer, S.: Approximating Catmull-Clark subdivision surfaces with bicubic patches. ACM Transactions on Graphics (TOG) 27, 1–11 (2008)

    Article  Google Scholar 

  13. Loop, C., Schaefer, S., Ni, T., Castaño, I.: Approximating subdivision surfaces with gregory patches for hardware tessellation. ACM Transactions on Graphics (TOG) 28, 1–9 (2009)

    Article  Google Scholar 

  14. Seidel, H.: Polar forms and triangular B-spline surfaces. Computing in Euclidean Geometry, 235–286 (1992)

    Google Scholar 

  15. Li, G., Ren, C., Zhang, J., Ma, W.: Approximation of Loop Subdivision Surfaces for Fast Rendering. IEEE Transactions on Visualization and Computer Graphics (2010)

    Google Scholar 

  16. Farin, G.: Curves and Surfaces for Computer-Aided Geometric Design — A Practical Guide, 5th edn. The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling, 499 pages. Morgan Kaufmann Publishers, Academic Press (2002)

    Google Scholar 

  17. Gregory, J.A.: Smooth interpolation without twist constraints. Computer Aided Geometric Design, 71–87 (1974)

    Google Scholar 

  18. Chiyokura, H., Takamura, T., Konno, K., Harada, T.: G1 surface interpolation over irregular meshes with rational curves. NURBS for Curve and Surface Design, 15–34 (1990)

    Google Scholar 

  19. Cignoni, P., Rocchini, C., Scopigno, R.: Metro: measuring error on simplified surfaces. In: Computer Graphics Forum, vol. 17, pp. 167–174. Wiley Online Library (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Amresh, A., Femiani, J., Fünfzig, C. (2012). Methods for Approximating Loop Subdivision Using Tessellation Enabled GPUs. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2012. Lecture Notes in Computer Science, vol 7431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33179-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33179-4_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33178-7

  • Online ISBN: 978-3-642-33179-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics