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

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5037922
Language Label Description Also known as
default for all languages
No label defined
    English
    Improved algorithms for the projection of points on NURBS curves and surfaces
    scientific article; zbMATH DE number 5037922

      Statements

      Improved algorithms for the projection of points on NURBS curves and surfaces (English)
      0 references
      0 references
      30 June 2006
      0 references
      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.
      0 references
      Projection
      0 references
      minimal distance
      0 references
      nearest point
      0 references
      subdivision
      0 references
      convex hull property
      0 references
      non-uniform rational B-spline (NURBS) curve or surface
      0 references

      Identifiers