ACM Transactions on Graphics (TOG)
Functional composition algorithms via blossoming
ACM Transactions on Graphics (TOG)
Fundamentals of computer aided geometric design
Fundamentals of computer aided geometric design
Computing a chain of blossoms, with application to products of splines
Computer Aided Geometric Design
An optimal algorithm for expanding the composition of polynomials
ACM Transactions on Graphics (TOG)
On the curvature of curves and surfaces defined by normalforms
Computer Aided Geometric Design
Curve reconstruction from unorganized points
Computer Aided Geometric Design
Point inversion and projection for NURBS curve and surface: control polygon approach
Computer Aided Geometric Design
Fitting B-spline curves to point clouds by curvature-based squared distance minimization
ACM Transactions on Graphics (TOG)
A counterexample on point inversion and projection for NURBS curve
Computer Aided Geometric Design
Approximate computation of curves on B-spline surfaces
Computer-Aided Design
A torus patch approximation approach for point projection on surfaces
Computer Aided Geometric Design
A second order algorithm for orthogonal projection onto curves and surfaces
Computer Aided Geometric Design
Improved algorithms for the projection of points on NURBS curves and surfaces
Computer Aided Geometric Design
Constructing G1 continuous curve on a free-form surface with normal projection
International Journal of Computer Mathematics
Hi-index | 0.00 |
This paper proposes an algorithm for calculating the orthogonal projection of parametric curves onto B-spline surfaces. It consists of a second order tracing method with which we construct a polyline to approximate the pre-image curve of the orthogonal projection curve in the parametric domain of the base surface. The final 3D approximate curve is obtained by mapping the approximate polyline onto the base surface. The Hausdorff distance between the exact orthogonal projection curve and the approximate curve is controlled under the user-specified distance tolerance. And the continuity of the approximate curve is @e"T-G^1, where @e"T is the user-specified angle tolerance. Experiments demonstrate that our algorithm is faster than the existing first order algorithms.