Skip to main content

A Method to Convert a Gregory Patch and a Rational Boundary Gregory Patch to a Rational Bézier Patch and Its Applications

  • Conference paper
CG International ’90

Abstract

A Gregory patch and a rational boundary Gregory patch have characteristics such that any n-sided loop is interpolated smoothly and that many patches can be generated to connect smoothly with each other. However, since the mathematical form of these patches is different from conventional surface patches such as the Bézier patch, no algorithm was known to subdivide them. The subdivision algorithm that could be applied to other surface patches could not be applied to them.

This paper proves that the bicubic Gregory patch can be converted to a bi-7th degree rational Bézier patch and moreover, that the bicubic rational boundary Gregory patch can be converted to a bi-11th degree rational Bézier patch. Because these rational Bézier patches can be subdivided, by using this conversion algorithm, we have developed a method to get the intersection curves between a Gregory patch or a rational boundary Gregory patch and a plane. The rational Bézier patch is also a good medium for transferring Gregory patch data to other systems.

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

  • Bajaj C.L., Hoffmann C.M., Lynch R.E. and Hopcroft J.E.H. (1988), “Tracing surface intersections”, Computer Aided Geometric Design, 5 (4): 285–307

    Article  MATH  MathSciNet  Google Scholar 

  • Barnhill R.E., Farin G., Jordan M. and Piper B.R. (1987), “Surface/surface intersection”, Computer Aided Geometric Design, 4 (1–2): 3–16

    Article  MATH  MathSciNet  Google Scholar 

  • Beeker E. (1986), “Smoothing of shapes designed with free-form surfaces” Computer-Aided Design, 18 (4): 224–232

    Article  Google Scholar 

  • Chen J.J. and Ozsoy T.M. (1988), “Predictor-corrector type of intersection algorithm for C 2 parametric surfaces”, Computer-Aided Design, 20 (6): 347–352

    Article  MATH  Google Scholar 

  • Chiyokura H. and Kimura F. (1983), “Design of Solids with Free Form Surfaces”, Computer Graphics, 17 (3): 289–298

    Article  Google Scholar 

  • Chiyokura H. (1988), Solid Modelling with DESIGNBASE, Addison-Wesley, Reading, MA

    Google Scholar 

  • Chiyokura H., Takamura T., Konno K. and Harada T. (1990), “Gl Surface Interpolation over Irregular Meshes with Rational Curves”, In: Farin G. (ed) Frontiers in Geometric Modeling, SI AM, Philadelphia, PA, to appear

    Google Scholar 

  • Cohen E., Lyche T. and Riesenfeld R. (1980), “Discrete B-Splines and Subdivision Techniques in Computer-Aided Geometric Design and Computer Graphics”, Computer Graphics and Image Processing, 14 (2): 87–111

    Article  Google Scholar 

  • de Casteljau P. (1959), “Outillages méthodes calcul”, Technical Report, A. Citroen, Paris

    Google Scholar 

  • de Casteljau P. (1963), “Courbes et surfaces à poles”, Technical Report, A. Citroen, Paris

    Google Scholar 

  • Dokken T. (1985), “Finding intersection of B-spline represented geometries using recursive subdivision techniques”, Computer Aided Geometric Design, 2 (1–3): 189–195

    Article  MATH  Google Scholar 

  • Hearn A.C. (1987), REDUCE USER’S MANUAL Version 3.3, RAND, Santa Monica, CA

    Google Scholar 

  • Houghton E.G., Emnett R.F., Factor J.D. and Sabharwal C.L. (1985), “Implementation of a divide-and-conquer method for intersection of parametric surfaces”, Computer Aided Geometric Design, 2 (1–3): 173–183

    Article  MATH  Google Scholar 

  • Koparkar P.A. and Mudur S.P. (1986), “Generation of continuous smooth curves resulting from operations on parametric surface patches”, Computer-Aided Design, 18 (4): 193–206

    Article  Google Scholar 

  • McCalla T.R. (1967), Introduction to Numerical Methods and FORTRAN Programming, John Wiley amp; Sons, New York, NY

    MATH  Google Scholar 

  • Peng Q.S. (1984), “An Algorithm for finding the intersection Line between two B-spline Surfaces”, Computer-Aided Design, 16 (4): 191–196

    Article  Google Scholar 

  • Schwartz A.J. (1987), “Subdividing Bézier Curves and Surfaces”, In: Farin G. (ed) Geometric Modeling: Algorithm and New Trends, SIAM, Philadelphia, PA, pp. 55–66

    Google Scholar 

  • Smith B., Rinaudot G.R., Reed K.A. and Wright T. (1988), Initial Graphics Exchange Specification (IGES) Version 4-0, National Bureau of Standaards, U.S. Department of Commerce, Gaithersburg, MD

    Google Scholar 

  • Tan S.T. and Chan K.C. (1986), “Generation of high order surfaces over arbitrary polyhedral meshs” Computer-Aided Design, 18 (8): 411–423

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Tokyo

About this paper

Cite this paper

Takamura, T., Ohta, M., Toriya, H., Chiyokura, H. (1990). A Method to Convert a Gregory Patch and a Rational Boundary Gregory Patch to a Rational Bézier Patch and Its Applications. In: Chua, TS., Kunii, T.L. (eds) CG International ’90. Springer, Tokyo. https://doi.org/10.1007/978-4-431-68123-6_32

Download citation

  • DOI: https://doi.org/10.1007/978-4-431-68123-6_32

  • Publisher Name: Springer, Tokyo

  • Print ISBN: 978-4-431-68125-0

  • Online ISBN: 978-4-431-68123-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics