Improved algorithms for the projection of points on NURBS curves and surfaces

DOI10.1016/J.CAGD.2006.01.007MaRDI QIDQ2495955zbMATH OpenOpenAlexFDO

Authors Ilijas Selimovic

Publication date 30 June 2006

Published in Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cagd.2006.01.007

zbMATH Keywords

convex hull propertyminimal distancenearest pointnon-uniform rational B-spline (NURBS) curve or surfaceProjectionsubdivision

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Computer-aided design (modeling of curves and surfaces) (65D17)

Review text

An algorithm for the computation of points lying on a nonuniform rational B-spline (NURBS) curve or surface in the minimum distance from the given points is presented. The procedure of the suggested calculation is based on subdividing the curve or surface at interior knots and excluding the segments, which do not contain the solution. The decision of segment excluding is made according to a new elimination criterion, which is described in this paper. The endpoint interpolation and the convex hull property of NURBS curves and surfaces is used in the new elimination criteria. Additionally, the tangent cones are used in the elimination criteria for surfaces. The presented elimination criterion is compared with the common one and the numbers of necessary subdivisions, which have to be carried out during the tests of curve and surface are given.

Recommendations

• Point inversion and projection for nurbs curve and surface: control polygon approach
• A second order algorithm for orthogonal projection onto curves and surfaces
• scientific article; zbMATH DE number 822292
• Research of whole fairing and approximation algorithm of NURBS curve
• Optimization of a NURBS representation

Cites work

• Hodographs and normals of rational curves and surfaces
• scientific article; zbMATH DE number 981250 (Why is no real title available?)
• Loop detection in surface patch intersections
• Optimization. Algorithms and consistent approximations
• Point inversion and projection for nurbs curve and surface: control polygon approach

Cited in

(18)

• Computing the minimum distance between two Bézier curves
• A geometric orthogonal projection strategy for computing the minimum distance between a point and a spatial parametric curve
• On the Bertrand pairs of open non-uniform rational B-spline curves
• Hybrid second-order iterative algorithm for orthogonal projection onto a parametric surface
• Hybrid second order method for orthogonal projection onto parametric curve in \(n\)-dimensional Euclidean space
• Point inversion and projection for nurbs curve and surface: control polygon approach
• A second-order algorithm for curve orthogonal projection onto parametric surface
• Parameterization of planar curves immersed in triangulations with application to finite elements
• An improved algorithm on minimum distance splitting between the NURBS surfaces
• Improved projection for CAD's of R ³
• scientific article; zbMATH DE number 1210204 (Why is no real title available?)
• Efficient offset trimming for planar rational curves using biarc trees
• scientific article; zbMATH DE number 1780134 (Why is no real title available?)
• Optimizing equiareality of NURBS surfaces using composite Möbius transformations
• On non-uniform rational B-splines curve fitting based on the least control points
• On NURBS algorithms using tangent cones
• A torus patch approximation approach for point projection on surfaces
• Assessment of methods for computing the closest point projection, penetration, and gap functions in contact searching problems

This page was built for publication: Improved algorithms for the projection of points on NURBS curves and surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2495955)