A typical NURBS surface model has a large percentage of superfluous control points that
significantly interfere with the design process. This paper presents an algorithm for eliminating …

The relevant theory of discrete B-splines with associated new algorithms is extended to
provide a framework for understanding and implementing general subdivision schemes for …

We address progressive local refinement of splines defined on axes parallel box-partitions
and corresponding box-meshes in any space dimension. The refinement is specified by a …

The purpose of this paper is to construct some explicit polynomial spline approximation
operators for real-valued functions defined on intervals or on reasonable sets in higher …

In this paper some theory of linear multistep methods for y (r)(x)= f (x, y) is extended to
include smooth, stepsize-dependent coefficients. Treated in particular is the case where …

This paper is the third in a sequence of papers in which a knot removal strategy for splines,
based on certain discrete norms, is developed. In the first paper, approximation methods …

Isogeometric analysis has been proposed as a methodology for bridging the gap between
computer aided design (CAD) and finite element analysis (FEA). Although both the traditional …

In this paper we give results that lead to stable algorithms for computing with trigonometric
splines. In particular we show that certain trigonometric B-splines satisfy a recurrence relation …

In this first chapter, we consider the following fundamental problem: Given a set of points in
the plane, determine a smooth curve that approximates the points. The algorithm for …

This chapter presents an overview of polynomial spline theory, with special emphasis on the
B-spline representation, spline approximation properties, and hierarchical spline refinement…