Symmetric algorithms for curves and surfaces

Hans-Peter Seidel

doi:10.1117/12.19727

1 August 1990 Symmetric algorithms for curves and surfaces

Hans-Peter Seidel

Proceedings Volume 1251, Curves and Surfaces in Computer Vision and Graphics; (1990) https://doi.org/10.1117/12.19727
Event: Electronic Imaging: Advanced Devices and Systems, 1990, Santa Clara, CA, United States

Abstract

Using the concept of synmietric algorithms, we construct a new patch representation for bivariate polynomials: the B-patch. B-patches share many properties with B-spline segments: They are characterized by their control points and by a 3-parameter family of knots. If the knots in each family coincide, we obtain the Bezier representation of a hivariate polynomial over a triangle. Therefore B-patches are a generalization of Bezier patches. B-patches have a de Boor-like evaluation algorithm, and, as in the case of B-spline curves, the control points of a B-patch can be expressed by simpy inserting a sequence of knots into the corresponding polar form. B-patches can be joined smoothly and they have an algorithm for knot insertion that is completely similar to Boehm's algorithm for curves.

Citation Download Citation

Hans-Peter Seidel "Symmetric algorithms for curves and surfaces", Proc. SPIE 1251, Curves and Surfaces in Computer Vision and Graphics, (1 August 1990); https://doi.org/10.1117/12.19727

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available