Paper
1 February 1992 Knot removal for scattered data
Alain Le Mehaute, Yvon Lafranche
Author Affiliations +
Abstract
We present a strategy for reducing the number of knots for the representation of a piecewise polynomial approximation of a function defined on scattered data, without perturbing the approximation more than a given tolerance. The method removes some (or all) of the interior knots. The number and location of these knots are determined automatically. Applications are in approximation of data, data storage, and image reconstruction.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Alain Le Mehaute and Yvon Lafranche "Knot removal for scattered data", Proc. SPIE 1610, Curves and Surfaces in Computer Vision and Graphics II, (1 February 1992); https://doi.org/10.1117/12.135142
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Data storage

Polonium

Computer graphics

Computer vision technology

Machine vision

Tolerancing

Visualization

RELATED CONTENT

Rendering of NURBS curves (Invited Paper)
Proceedings of SPIE (February 01 1992)
Complexity of computing nice viewpoints of objects in space
Proceedings of SPIE (October 23 2000)
Contour lines of a C1 surface defined over a triangulation
Proceedings of SPIE (February 01 1992)
Approximation of sweep surfaces by tensor product NURBS
Proceedings of SPIE (February 01 1992)
Tensor products and hierarchical fitting
Proceedings of SPIE (February 01 1992)
Hierarchical object boundary detection and description
Proceedings of SPIE (August 01 1990)

Back to Top