Selective Degree Elevation for Multi‐Sided Bézier Patches

  title={Selective Degree Elevation for Multi‐Sided B{\'e}zier Patches},
  author={J. Smith and S. Schaefer},
  journal={Computer Graphics Forum},
This paper presents a method to selectively elevate the degree of an S‐Patch of arbitrary dimension. We consider not only S‐Patches with 2D domains but 3D and higher‐dimensional domains as well, of which volumetric cage deformations are a subset. We show how to selectively insert control points of a higher degree patch into a lower degree patch while maintaining the polynomial reproduction order of the original patch. This process allows the user to elevate the degree of only one portion of the… Expand
Multi-sided Bézier surfaces over concave polygonal domains
A new multi-sided, control point based surface representation is introduced, based on the Generalized Bezier patch, which permits domains with concave angles and supports a more general control point structure, where independent “half-Bezier” interpolants, or ribbons, are blended together. Expand
A Multi‐sided Bézier Patch with a Simple Control Structure
A new n‐sided surface scheme is presented, that generalizes tensor product Bézier patches, that is defined over a convex polygonal domain and computed from generalized barycentric coordinates. Expand
Efficient Culling Techniques for Interactive Deformable NURBS Surfaces on GPU
In this paper, different interactive culling strategies for NURBS surfaces are presented and analyzed, and an implementation of these strategies using current GPUs is presented, achieving real-time and interactive rendering rates of complex parametric models. Expand
Phong Tessellation and PN Polygons for Polygonal Models
A generalisation of the associated quadratic normal field is given as well as a simple algorithm for evaluating the polygonal extensions for a polygon with vertex normals on the GPU. Expand
Splines for Meshes with Irregularities
This paper reviews and categorizes techniques for splines on meshes with irregularities, of particular interest are quad-dominant meshes that can have n 6= 4 valent interior points and T-junctions where quad-strips end. Expand
Generalized Barycentric Coordinates in Computer Graphics and Computational Mechanics


Cubic mean value coordinates
The method builds on an existing transfinite interpolant over a continuous domain, which in turn extends the classical mean value interpolant, and re-derive the interpolant from the mean value property of biharmonic functions, and proves that it indeed matches the gradient constraints when the boundary is piece-wise linear. Expand
A multisided generalization of Bézier surfaces
A class of surface patch representations that unify and generalize triangular and tensor product Bézier surfaces by allowing patches to be defined over any convex polygonal domain; hence, S-patches may have any number of boundary curves. Expand
Harmonic coordinates for character articulation
It is shown that harmonic coordinates are the first system of generalized barycentric coordinates that are non-negative even in strongly concave situations, and their magnitude falls off with distance as measured within the cage. Expand
Free-form deformation of solid geometric models
A technique is presented for deforming solid geometric models in a free-form manner based on trivariate Bernstein polynomials, and provides the designer with an intuitive appreciation for its effects. Expand
Quadratic serendipity finite elements on polygons using generalized barycentric coordinates
We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n-gon, our construction produces 2nExpand
Maximum Entropy Coordinates for Arbitrary Polytopes
This paper introduces a new generalization of barycentric coordinates that stems from the maximum entropy principle, which is guaranteed to be positive inside any planar polygon, and can be evaluated efficiently by solving a convex optimization problem with Newton's method. Expand
Mean value coordinates for closed triangular meshes
This paper generalizes mean value coordinates from closed 2D polygons to closed triangular meshes and shows that these coordinates are continuous everywhere and smooth on the interior of P, showing their usefulness in constructing volumetric textures and surface deformation. Expand
Pointwise radial minimization: Hermite interpolation on arbitrary domains
A new kind of Hermite interpolation on arbitrary domains, matching derivative data of arbitrary order on the boundary, and minimizing over derivatives of polynomials of arbitrary odd degree is proposed. Expand
B-Form Basics.
Abstract : The basic facts about the B(arycentric, -ernstein, -ezier) form of a multivariate polynomial are recorded and, in part, proved. These include: evaluation (de Casteliau's algorithm),Expand
Mean value coordinates for arbitrary planar polygons
It is shown that mean value coordinates are in fact well-defined for arbitrary planar polygons without self-intersections, and they are particularly useful for interpolating data that is given at the vertices of the polygons. Expand