Partial shape-preserving splines
نویسندگان
چکیده
A complex geometric shape is often a composition of a set of simple ones, which may differ from each other in terms of their mathematical representations and the ways in which they are constructed. One of the necessary requirements in combining these simple shapes is that their original shapes can be preserved as much as possible. In this paper, a set of partial shape-preserving (PSP) spline basis functions is introduced to smoothly combine a collection of shape primitives with flexible blending range control. These spline basis functions can be considered as a kind of generalization of traditional B-spline basis functions, where the shape primitives used are control points or control polygons. The PSP-spline basis functions have all the advantages of the conventional B-spline technique in the sense that they are nonnegative, piecewise polynomial and of property of partition of unity. However, PSP-spline is a more powerful freeform geometric shape design technique in the sense that it is also a kind of shape-preserving spline. In addition, the PSP-spline technique implicitly integrates the weights of shape control primitives into its basis functions, which allows users to design a required geometric shape based on weighted control primitives. Though its basis functions are simply piecewise polynomial functions, it has the same shape design strengths as the rational piecewise polynomial based spline techniques such as NURBS. In particular, when control shape primitives are specified as a set of control points, PSP-spline behaves like a polygon smoother, with which a shape can be designed to approximate the specified control polygon or control mesh smoothly with any required precision. Consequently, a richer set of geometric shapes can be built using a relatively smaller set of control points.
منابع مشابه
Constrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملAlgorithms for shape preserving local approximation with automatic selection of tension parameters
This paper describes the problem of shape preserving approximation for data with speci ed tolerances Using the tool of generalized B splines GB splines for short simple one and three point algorithms of shape preserving local approximation with automatic choice of the tension parameters are de veloped In the two dimensional case tensor products of one dimensional splines are employed The result...
متن کاملOn monotone and convex approximation by splines with free knots
We prove that the degree of shape preserving free knot spline approximation in L p a; b], 0 < p 1 is essentially the same as that of the non-constrained case. This is in sharp contrast to the well known phenomenon we have in shape preserving approximation by splines with equidistant knots and by polynomials. The results obtained are valid both for piecewise polynomials and for smooth splines wi...
متن کاملConvexity Preserving Approximation by Free Knot Splines
In this paper we study the order of shape preserving approximation of functions f in Sobolev space by free knot splines. The main result is that we can preserve k-convexity of f for general k, and retain the optimal order of approximation n ?r at the same time.
متن کاملShape preserving histogram approximation
We present a new method for reconstructing the density function underlying a given histogram. First we analyze the univariate case taking the approximating function in a class of quadratic-like splines with variable degrees. For the analogous bivariate problem we introduce a new scheme based on the Boolean sum of univariate B-splines and show that for a proper choice of the degrees, the splines...
متن کاملShape-preserving interpolation by splines using vector subdivision
We give a local convexity preserving interpolation scheme using parametric 2 C cubic splines with uniform knots produced by a vector subdivision scheme which simultaneously provides the function and its first and second order derivatives. This is also adapted to give a scheme which is both local convexity and local monotonicity preserving when the data values are strictly increasing in the x di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer-Aided Design
دوره 43 شماره
صفحات -
تاریخ انتشار 2011