1 August 1990 Symmetric algorithms for curves and surfaces
Author Affiliations +
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.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Hans-Peter Seidel, "Symmetric algorithms for curves and surfaces", Proc. SPIE 1251, Curves and Surfaces in Computer Vision and Graphics, (1 August 1990); doi: 10.1117/12.19727; http://dx.doi.org/10.1117/12.19727
PROCEEDINGS
12 PAGES


SHARE
KEYWORDS
Algorithms

Computer graphics

Computer vision technology

Machine vision

Visualization

Image segmentation

Silicon

Back to Top