Surface algorithms using bounds on derivatives (Q1095571)

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 4028719
Language Label Description Also known as
default for all languages
No label defined
    English
    Surface algorithms using bounds on derivatives
    scientific article; zbMATH DE number 4028719

      Statements

      Surface algorithms using bounds on derivatives (English)
      0 references
      0 references
      0 references
      0 references
      1986
      0 references
      The given paper draws a general conclusion about three main algorithms important mostly for their surface application. The mentioned algorithms can be applied for calculation of piecewise linear approximations, all- size-boxes and surface/surface intersections. The best results are achieved by handling all parametric \(C^ 2\) surfaces. These algorithms are related by theorems from approximation theory concerning the maximum deviation possible for an approximation to a surface. Bounds on the partial derivatives have to be known. The generalization of these theorems enables one to work with parametric geometry and shows how to get the necessary bounds.
      0 references
      0 references
      computer aided geometric design
      0 references
      piecewise linear approximations
      0 references
      all- size-boxes
      0 references
      surface/surface intersections
      0 references
      algorithms
      0 references
      parametric geometry
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references