A survey of curve and surface methods in CAGD
Computer Aided Geometric Design
Curves and surfaces in computer aided geometric design
Curves and surfaces in computer aided geometric design
Curves and surfaces for computer aided geometric design (3rd ed.): a practical guide
Curves and surfaces for computer aided geometric design (3rd ed.): a practical guide
Fundamentals of computer aided geometric design
Fundamentals of computer aided geometric design
The NURBS book
Advanced surface fitting techniques
Computer Aided Geometric Design
Bezier and B-Spline Techniques
Bezier and B-Spline Techniques
Shape Interrogation for Computer Aided Design and Manufacturing
Shape Interrogation for Computer Aided Design and Manufacturing
A second order algorithm for orthogonal projection onto curves and surfaces
Computer Aided Geometric Design
Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2)
Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2)
Interpolation by geometric algorithm
Computer-Aided Design
Efficient linear system solvers for mesh processing
IMA'05 Proceedings of the 11th IMA international conference on Mathematics of Surfaces
Local progressive-iterative approximation format for blending curves and patches
Computer Aided Geometric Design
Cubic B-spline curve approximation by curve unclamping
Computer-Aided Design
Technical Section: An extended iterative format for the progressive-iteration approximation
Computers and Graphics
B-spline surface fitting by iterative geometric interpolation/approximation algorithms
Computer-Aided Design
Geometric point interpolation method in R3 space with tangent directional constraint
Computer-Aided Design
Computer Graphics in China: Convergence analysis for B-spline geometric interpolation
Computers and Graphics
Hi-index | 0.00 |
We introduce a novel method to interpolate a set of data points as well as unit tangent vectors or unit normal vectors at the data points by means of a B-spline curve interpolation technique using geometric algorithms. The advantages of our algorithm are that it has a compact representation, it does not require the magnitudes of the tangent vectors or normal vectors, and it has C^2 continuity. We compare our method with the conventional curve interpolation methods, namely, the standard point interpolation method, the method introduced by Piegl and Tiller, which interpolates points as well as the first derivatives at every point, and the piecewise cubic Hermite interpolation method. Examples are provided to demonstrate the effectiveness of the proposed algorithms.