Skip to main content
SpringerLink
Log in

Local, Polynomial G 1 PN Quads

  • Conference paper
Advances in Visual Computing (ISVC 2014)

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

Included in the following conference series:

  • 3623 Accesses

Abstract

In this paper, we introduce the concept of local, polynomial G 1 PN quads. These are degree bi-5 polynomial surface patches in Bernstein-Bézier form. As the classic PN patch, ours interpolates the vertices of a quadrilateral control polygon and is orthogonal to a normal specified at each vertex. In contrast to the original concept, the proposed quad is orthogonal to four (continuous) normal fields — one defined at each boundary. Each of these normal fields and the corresponding patch boundary are uniquely determined by the data at two adjacent vertices of the control polygon. Thus, the patch construction is local in the sense that it is based solely on the information provided at the four control vertices. In this way, it is easy to stitch together multiple quads to construct a manifold G 1 continuous surface of arbitrary topological type. In contrast to other approaches, vertices at which 3 or more than 4 patches meet do not require special treatment.

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

Access this chapter

Log in via an institution
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. Vlachos, A., Peters, J., Boyd, C., Mitchell, J.L.: Curved PN Triangles. In: Symposium on Interactive 3D Graphics, pp. 159–166 (2001)

    Google Scholar 

  2. Zorin, D., Schröder, P.: Subdivision for Modeling and Animation. In: ACM SIGGRAPH 2000 Course Notes (2000)

    Google Scholar 

  3. Gregory, J.: Smooth Interpolation Without Twist Constraints. Computer Aided Geometric Design, 71–87 (1974)

    Google Scholar 

  4. Nielson, G.: A Transfinite, Visually Continuous, Triangular Interpolant. SIAM Geometric Modeling, 235–246 (1987)

    Google Scholar 

  5. Chiyokura, H., Kimura, F.: Design of Solids with Free-form Surfaces. In: Proceedings of SIGGRAPH, pp. 289–298 (1983)

    Google Scholar 

  6. Fan, J., Peters, J.: On Smooth Bicubic Surfaces from Quad Meshes. In: ISVC, pp. 87–96 (2008)

    Google Scholar 

  7. Jüttler, B., Sampoli, M.: Hermite Interpolation by Piecewise Polynomial Surfaces with Rational Offsets. Computer Aided Geometric Design 17, 361–385 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Mao, Z., Ma, L., Tan, W.: A Modified Nielson’s Side-Vertex Triangular Mesh Interpolation Scheme. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3480, pp. 776–785. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Boubekeur, T., Reuter, P., Schlick, C.: Scalar Tagged PN Triangles. In: EUROGRAPHICS (2005)

    Google Scholar 

  10. Dyken, C., Reimers, M., Seland, J.: Real-Time GPU Silhouette Refinement using Adaptively Blended Bezier Patches. Comput. Graph. Forum 27, 1–12 (2008)

    Article  Google Scholar 

  11. Nagata, T.: Simple local interpolation of surfaces using normal vectors. Computer Aided Geometric Design 22, 327–347 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  12. Boubekeur, T., Alexa, M.: Phong Tessellation. In: SIGGRAPH Asia, pp. 1–5 (2008)

    Google Scholar 

  13. Boschiroli, M., Fünfzig, C., Romani, L., Albrecht, G.: A Comparison of Local Parametric C 0 Bézier Interpolants for Triangular Meshes. Computers & Graphics 35, 20–34 (2011)

    Article  Google Scholar 

  14. Herron, G.: Smooth Closed Surfaces with Discrete Triangular Interpolants. Computer Aided Geometric Design 2, 297–306 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  15. Walton, D., Meek, D.: A Triangular G1 Patch from Boundary Curves. Computer-Aided Design 28, 113–123 (1996)

    Article  Google Scholar 

  16. Fünfzig, C., Müller, K., Hansford, D., Farin, G.: PNG1 Triangles for Tangent Plane Continuous Surfaces on the GPU. Graphics Interface, 219–226 (2008)

    Google Scholar 

  17. Loop, C., Schaefer, S., Ni, T., Castaño, I.: Approximating Subdivision Surfaces with Gregory Patches for Hardware Tessellation. ACM Trans. Graph. 28, 151:1–151:9 (2009)

    Google Scholar 

  18. Mann, S., Loop, C., Lounsbery, M., Meyers, D., Painter, J., DeRose, T., Sloan, K.: A Survey of Parametric Scattered Data Fitting Using Triangular Interpolants. In: Curve and Surface Design, pp. 145–172. SIAM (1992)

    Google Scholar 

  19. Boschiroli, M., Fünfzig, C., Romani, L., Albrecht, G.: G 1 Rational Blend Interpolatory Schemes: A Comparative Study. Graphical Models 74, 29–49 (2012)

    Article  Google Scholar 

  20. Loop, C.: Smooth Spline Surfaces over Irregular Meshes. In: ACM SIGGRAPH, pp. 303–310 (1994)

    Google Scholar 

  21. Myles, A., Yeo, Y.I., Peters, J.: GPU Conversion of Quad Meshes to Smooth Surfaces. In: ACM Symposium on Solid and Physical Modeling, pp. 321–326 (2008)

    Google Scholar 

  22. Hoschek, J., Lasser, D.: Fundamentals of Computer Aided Geometric Design. AK Peters (1993)

    Google Scholar 

  23. Edwards Jr., C.H.: Advanced Calculus of Several Variables. Dover Books on Mathematics (1994)

    Google Scholar 

Download references

Authors
  1. Chavdar Papazov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Nevada at Reno, USA

    George Bebis

  2. NASA Ames Research Center, Moffett Field, CA, USA

    Richard Boyle

  3. Lawrence Berkeley National Laboratory, Berkeley, CA, USA

    Bahram Parvin

  4. Desert Research Institute, Reno, NV, USA

    Darko Koracin

  5. The University of Texas at Dallas, 75080, Richardson, TX, USA

    Ryan McMahan

  6. NextGen Interactions, 27604, Raleigh, NC, USA

    Jason Jerald

  7. Indiana University, 46202, Indianapolis, IN, USA

    Hui Zhang

  8. Microsoft Research, 1 Microsoft Way, 98052, Redmond, WA, USA

    Steven M. Drucker

  9. University of Delaware, 19716-2712, Newark, DE, USA

    Chandra Kambhamettu

  10. Intel Corp., 95054, Santa Clara, CA, USA

    Maha El Choubassi

  11. Computer Graphics and Interactive Media Lab, Department of Computer Science, University of Houston, 77004, Houston, TX, USA

    Zhigang Deng

  12. NVIDIA, 34788, Leesburg, FL, USA

    Mark Carlson

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Papazov, C. (2014). Local, Polynomial G 1 PN Quads. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2014. Lecture Notes in Computer Science, vol 8887. Springer, Cham. https://doi.org/10.1007/978-3-319-14249-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-14249-4_7

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-14248-7

  • Online ISBN: 978-3-319-14249-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation