Bicubic patches for approximating non-rectangular control-point meshes
Computer Aided Geometric Design
G1 interpolation of generally unrestricted cubic Bézier curves
Computer Aided Geometric Design - Special issue: Topics in CAGD
Errata: G1 interpolation of generally unrestricted cubic Bézier curves
Computer Aided Geometric Design
Interpolation on surfaces using minimum norm networks
Computer Aided Geometric Design
Fundamentals of computer aided geometric design
Fundamentals of computer aided geometric design
Degenerate polynomial patches of degree 4 and 5 used for geometrically smooth interpolation in R3
Computer Aided Geometric Design
SIAM Journal on Numerical Analysis
G2 interpolation of free form curve networks by biquintic Gregory patches
Computer Aided Geometric Design - Special issue: in memory of John Gregory
Degenerate Be´zier patches with continuous curvature
Computer Aided Geometric Design
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Bezier and B-Spline Techniques
Bezier and B-Spline Techniques
Design of solids with free-form surfaces
SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques
Curve networks compatible with G2 surfacing
Computer Aided Geometric Design
Constructive G1 connection of multiple freeform pipes in arbitrary poses
Computer Aided Geometric Design
Hi-index | 0.00 |
A key problem when interpolating a network of curves occurs at vertices: an algebraic condition, called the vertex enclosure constraint, must hold wherever an even number of curves meet. This paper recasts the vertex enclosure constraint in terms of the local geometry of the curve network. This allows formulating a new geometric constraint, related to Euler's Theorem on local curvature. The geometric constraint implies the vertex enclosure constraint and is equivalent to it where four curve segments meet without forming an X. Also the limiting case of collinear curve tangents is analyzed.