Convexity-preserving interpolatory subdivision (Q1315804)

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 516606
Language Label Description Also known as
default for all languages
No label defined
    English
    Convexity-preserving interpolatory subdivision
    scientific article; zbMATH DE number 516606

      Statements

      Convexity-preserving interpolatory subdivision (English)
      0 references
      0 references
      0 references
      23 June 1994
      0 references
      The authors present a subdivision algorithm for shape preserving function interpolation in \(\mathbb{R}\) and \(\mathbb{R}^ 2\). This algorithm is a useful and flexible tool for curve and surface generation in computer aided geometric design (CAGD). Complete demonstrations of each case are made. The method is based on iterative knot insertion and guarantees preservation of convexity. The paper is richly illustrated. A simplified algorithm useful on the construction of surfaces is also presented. To illustrate the behaviour of the method to fit data with shape preservation the authors present two numerical examples with corresponding figures.
      0 references
      subdivision algorithm
      0 references
      shape preserving function interpolation
      0 references
      curve and surface generation
      0 references
      computer aided geometric design
      0 references
      iterative knot insertion
      0 references
      preservation of convexity
      0 references
      shape preservation
      0 references
      numerical examples
      0 references

      Identifiers