Return to search

Convexity-Preserving Scattered Data Interpolation

Surface fitting methods play an important role in many scientific fields as well as in computer aided geometric design. The problem treated here is that of constructing a smooth surface that interpolates data values associated with scattered nodes in the plane. The data is said to be convex if there exists a convex interpolant. The problem of convexity-preserving interpolation is to determine if the data is convex, and construct a convex interpolant if it exists.

Identiferoai:union.ndltd.org:unt.edu/info:ark/67531/metadc277609
Date12 1900
CreatorsLeung, Nim Keung
ContributorsRenka, Robert J., Neuberger, John W., Jacob, Roy Thomas, Tate, Stephen B.
PublisherUniversity of North Texas
Source SetsUniversity of North Texas
LanguageEnglish
Detected LanguageEnglish
TypeThesis or Dissertation
Formatviii, 99 leaves: ill., Text
RightsPublic, Copyright, Copyright is held by the author, unless otherwise noted. All rights reserved., Leung, Nim Keung

Page generated in 0.0016 seconds