By Topic

A Convexity-Preserving Grid Refinement Algorithm for Interpolation of Bivariate Functions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
John A. Roulier ; University of Connecticut

This article presents an algorithms to refine bevariate grid data that is convex (and monotonic) along the grid lines so that the refined data exhibits the same convexity (and monotonicity). The algorithm is based on some observations about univariate data and an algorithm for shape-preserving quadratic splines for such data. It can be used as is or with standard surface-path techniques.

Published in:

IEEE Computer Graphics and Applications  (Volume:7 ,  Issue: 1 )