Skip to main content Accessibility help
×
Hostname: page-component-7479d7b7d-68ccn Total loading time: 0 Render date: 2024-07-11T02:25:23.450Z Has data issue: false hasContentIssue false

6 - Theory and algorithms for nonuniform spline wavelets

Published online by Cambridge University Press:  06 July 2010

N. Dyn
Affiliation:
Tel-Aviv University
D. Leviatan
Affiliation:
Tel-Aviv University
D. Levin
Affiliation:
Tel-Aviv University
A. Pinkus
Affiliation:
Technion - Israel Institute of Technology, Haifa
Get access

Summary

Abstract

We investigate mutually orthogonal spline wavelet spaces on nonuniform partitions of a bounded interval, addressing the existence, uniqueness and construction of bases of minimally supported spline wavelets. The relevant algorithms for decomposition and reconstruction are considered as well as some stability-related questions. In addition, we briefly review the bivariate case for tensor products and arbitrary triangulations. We conclude this chapter with a discussion of some special cases.

Introduction

Splines have become the standard mathematical tool for representing smooth shapes in computer graphics and geometric modeling. Wavelets have been introduced more recently, but are by now well established both in mathematics and in applied sciences like signal processing and numerical analysis. The two concepts are closely related as splines provide some of the most important examples of wavelets. Although there is an extensive literature on cardinal spline wavelets (spline wavelets with uniform knot spacing), see Chui (1992), relatively little has been published about spline wavelets on arbitrary, nonuniform knots, which form the subject of this chapter. These kinds of wavelets, however, are needed for performing operations like decomposition, reconstruction and thresholding on splines given on a nonuniform knot vector, which typically occur in practical applications.

The flexibility of splines in modeling is due to good approximation properties, useful geometric interpretations of the B-spline coefficients, and simple algorithms for adding and removing knots. Full advantage of these capabilities can only be taken on general nonuniform knot vectors, where also multiple knots are allowed.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×