Advertisement

Subdivision Invariant Polynomial Interpolation

  • Stefanie Hahmann
  • Georges-Pierre Bonneau
  • Alex Yvart
Conference paper
Part of the Mathematics and Visualization book series (MATHVISUAL)

Summary

In previous works a polynomial interpolation method for triangular meshes has been introduced. This interpolant can be used to design smooth surfaces of arbitrary topological type. In a design process, it is very useful to be able to locate the deformation made on a geometric model. The previously introduced interpolant has the so-called strict locality property: when a mesh vertex is changed, only the surface patches containing this vertex are changed. This enables to locate the deformation at the size of the input triangles. Unfortunately this is not sufficient if the designer wants to add some detail at a smaller size than that of the input triangles. In this paper, we propose a modification of our interpolant, that enables to arbitrary refine the input triangulation, without changing the resulting surface. We call this property the subdivision invariance. After refinement of the input triangulation, the modification of one of the vertices will change the shape of the interpolant at the scale of the refined triangulation. In this way, it is possible to add details at an arbitrary fine scale.

Keywords

polynomial interpolation subdivision invariance geometric design 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dyn N., Levin D., and Gregory J. (1990): A butterfly subdivision scheme for surface interpolation with tension control. ACM Transactions on Graphics 9 (2), 160 169Google Scholar
  2. 2.
    Farin G. (1996): Curves and Surfaces for Computer Aided Geometric Design. Academic Press, New York, 4th editionGoogle Scholar
  3. 3.
    Forsey D., Bartels R. (1988): Hierarchical B-spline refinement. In Proceedings of SIGGRAPH 88, ACM SIGGRAPH, 1205–212Google Scholar
  4. 4.
    Goldman R.N. (1983): Subdivision algorithms for Bézier triangles. CAD 15, 159–166Google Scholar
  5. 5.
    Hahmann S., Bonneau G-P. (2000): Triangular G1 interpolation by 4-splitting domain triangles. Computer Aided Geometric Design 17, 731–757MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Hahmann S., Bonneau G-P. (2002): Parametric surfaces over arbitrary triangulations. IEEE Transactions on Visualization and Computer Graphics, to appearGoogle Scholar
  7. 7.
    Hoschek J. and Lasser D. (1993): Fundamentals of Computer Aided Geometric Design. A.K. Peters.Google Scholar
  8. 8.
    Jensen (1987): Assembling triangular and rectangular patches and multivariate splines. In: Farin, G. (ed) Geometric Modeling: Algorithms and new Trends. SIAM, 203–220Google Scholar
  9. 9.
    Loop C. (1994): A G1 triangular spline surface of arbitrary topological type. Computer Aided Geometric Design 11, 303–330MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Piegl L. (1987): On NURBS: a Survey. Computer Graphics and Applications 11 (1), 55 71Google Scholar
  11. 11.
    Piper B.R. (1987): Visually smooth interpolation with triangular Bézier patches. In: Farin, G. (ed) Geometric Modeling: Algorithms and new Trends. SIAM, 221–233Google Scholar
  12. 12.
    Schröder P., Zorin D. (1999): Subdivision for Modeling and Animation. SIG-GRAPH course notes.Google Scholar
  13. 13.
    Shirman L.A., Séquin C.H. (1987): Local surface interpolation with Bézier patches. Computer Aided Geometric Design 4, 279–295MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    Zorin D., Schröder P., and Sweldens W. (1996): Interpolating subdivision for meshes with arbitrary topology. In Proceedings of SIGGRAPH 96, ACM SIG-GRAPH, 189–192Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Stefanie Hahmann
    • 1
  • Georges-Pierre Bonneau
    • 2
  • Alex Yvart
    • 1
  1. 1.Laboratoire LMC-IMAGGrenoble cedex 9France
  2. 2.Laboratoire iMAGIS-GRAVIRINRIAMontbonnotFrance

Personalised recommendations