Paper
1 August 1990 Shape-preserving interpolating subdivision
Alain Le Mehaute, Florencio I. Utreras
Author Affiliations +
Proceedings Volume 1251, Curves and Surfaces in Computer Vision and Graphics; (1990) https://doi.org/10.1117/12.19734
Event: Electronic Imaging: Advanced Devices and Systems, 1990, Santa Clara, CA, United States
Abstract
We introduce a subdivision algorithm for shape preserving function interpolation in 111 and JR2 . The method is based on iterative knot insertion and guarantees preservation of convexity. Starting from data points, a sequence of piecewise linear function is generated. The sequence can be shown to be convergent to a C1 function. The process is specially suitted for curve and surface generation in CAGD since it is local and the computation can be stopped whenever the desired visual effect is attained.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Alain Le Mehaute and Florencio I. Utreras "Shape-preserving interpolating subdivision", Proc. SPIE 1251, Curves and Surfaces in Computer Vision and Graphics, (1 August 1990); https://doi.org/10.1117/12.19734
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Visualization

Computer graphics

Computer vision technology

Machine vision

Information operations

Tin

Argon

RELATED CONTENT

Computing global coverings
Proceedings of SPIE (August 01 1990)
Curves and surfaces in computer vision
Proceedings of SPIE (August 01 1990)
Knot insertion algorithms for splines (Invited Paper)
Proceedings of SPIE (February 01 1992)
Knot removal for scattered data
Proceedings of SPIE (February 01 1992)
Address chain code: a new line drawing encoding scheme
Proceedings of SPIE (November 01 1992)

Back to Top