Skip to main content

Shape Representations with Blossoms and Buds

  • Conference paper

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

Abstract

Polynomials, either on their own or as components of splines, play a fundamental role for shape representations in computer-aided geometric design (CAGD) and computer graphics. This paper shows that any polynomial p(t) of degree dn can be represented in the form of a blossom of another polynomial b(t) of degree d evaluated off the diagonal at the linear functions X j (t), j=1, ..., n, chosen under some conditions expressed in terms of the elementary symmetric functions. The polynomial b(t) is called a bud of the polynomial p(t). An algorithm for finding a bud b(t) of a given polynomial p(t) is presented. Successively, a bud of b(t) can be computed and so on, to form a sequence of representations. The information represented by the original polynomial is preserved in its buds. This scheme can be used for encoding/decoding geometric design information.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bartels, R.H., Beatty, J.C., Barsky, B.A.: An Introduction to Splines for Use in Computer Graphics and Geometric Modeling. Morgan Kaufmann, San Francisco (1987)

    MATH  Google Scholar 

  2. Boehm, W., Farin, G., Kahmann, J.: A Survey of Curve and Surface Methods in CAGD. Computer Aided Geometric Design 1, 1–60 (1984)

    Article  MATH  Google Scholar 

  3. de Casteljau, P.: Shape Mathematics and CAD. Kogan Page, London (1986)

    Google Scholar 

  4. Farin, G.: Curves and Surfaces for CAGD: A Practical Guide, 5th edn. Academic Press, London (2002)

    Google Scholar 

  5. Goldman, R.N., Lyche, T. (eds.): Knot Insertion and Deletion Algorithms for B-Spline Curves and Surfaces. SIAM, Philadelphia (1993)

    MATH  Google Scholar 

  6. Ramshaw, L.: Blossoming: A Connect-the-Dots Approach to Splines. Digital Equipment Corporation, SRC Report, June 21 (1987)

    Google Scholar 

  7. Stefanus, L.Y.: Blossoming off the Diagonal. Ph.D. Thesis, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada (1991)

    Google Scholar 

  8. Stefanus, L.Y., Goldman, R.N.: Discrete Convolution Schemes. In: Lyche, T., Schumaker, L.L. (eds.) Mathematical Methods in Computer Aided Geometric Design II. Academic Press, London (1992)

    Google Scholar 

  9. Stefanus, L.Y., Goldman, R.N.: On the Linear Independence of the Bivariate Discrete Convolution Blending Functions. Australian Computer Science Communications 20(3), 231–244 (1998)

    MathSciNet  Google Scholar 

  10. Stefanus, L.Y.: Surface Representations using Blossoms and Buds (in preparation)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stefanus, L.Y. (2006). Shape Representations with Blossoms and Buds. In: Kim, MS., Shimada, K. (eds) Geometric Modeling and Processing - GMP 2006. GMP 2006. Lecture Notes in Computer Science, vol 4077. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11802914_28

Download citation

  • DOI: https://doi.org/10.1007/11802914_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36711-6

  • Online ISBN: 978-3-540-36865-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics