Surface algorithms using bounds on derivatives (Q1095571): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-8396(86)90005-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989513862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of curve and surface methods in CAGD / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical guide to splines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of a divide-and-conquer method for intersection of parametric surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational techniques for processing parametric surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4113353 / rank
 
Normal rank

Latest revision as of 12:36, 18 June 2024

scientific article
Language Label Description Also known as
English
Surface algorithms using bounds on derivatives
scientific article

    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