A weak condition for the convexity of tensor-product Bézier and B-spline surfaces
|
|
- Merilyn Alexander
- 6 years ago
- Views:
Transcription
1 A weak condition for the convexity of tensor-product Bézier B-spline surfaces Michael S. Floater SINTEF-SI P.O. Box 124, Blindern 0314 Oslo Norway September 1993 Abstract. A sufficient condition for a tensor-product Bézier surface to be convex is presented. The condition does not require that the control surface itself is convex which is known to be a very restrictive property anyway. The convexity condition is generalised to C 1 tensor-product B-spline surfaces. Keywords. convexity, Bézier surface, B-spline surface, tensor-product 1. Introduction It was shown by Chang & Davis (1984) that if the control polygon (defined as the piecewise linear interpolant to the control points) of a Bézier triangle surface is convex then so is the Bézier surface itself. This work led to a good deal of research in this area, surveys papers have been written by Goodman (1989) Dahmen (1991). The condition has been generalised to higher dimensional domains higher dimensional functions. Weaker conditions have been found, for example by Chang & Feng (1984). Meanwhile the tensor-product Bézier surface seems to have been somewhat neglected. Apparently, the only existing convexity condition is Theorem 1, due to Cavaretta & Sharma (1990), which is an analogy of Chang & Davis s result for triangles. Yet this condition is unrealistic in most situations. To put this paper in context we now briefly describe Theorem 1 its weakness. The tensor-product Bézier surface with control points p i,j IR is defined as m n S(x,y) = B i,m (x)b j,n (y)p i,j (1) for x [0, 1], y [0, 1] where B i,k (t) = ( ) k t i (1 t) k i i is the ith Bernstein basis function of degree k. The surface (or function) S is said to be of degree m n we assume that m 1, n 1. The control surface Ŝ(x,y) corresponding to S is the piecewise bilinear surface interpolating the control points p i,j at the abscissae (i/m,j/n). More precisely let Ŝ(x,y) = (i + 1 mx)(j + 1 ny)p i,j + (mx i)(j + 1 ny)p i+1,j + (i + 1 mx)(ny j)p i,j+1 + (mx i)(ny j)p i+1,j+1 1
2 for Thus i m x i + 1 m, Ŝ j n y j + 1, 0 i m 1, 0 j n 1. n ( i m, j ) = p i,j, 0 i m, 0 j n, n Ŝ is bilinear on each rectangle of a regular subdivision of [0, 1] [0, 1], see Goodman (1989). The following theorem was proved by Cavaretta Sharma (1990). Theorem 1. If Ŝ is convex then S is convex. The condition that Ŝ is convex is simple to formulate it has a pleasing geometric interpretation. But unfortunately it rules out the vast majority of surfaces. Indeed, if Ŝ is to be convex, S must be a translational surface, as pointed out by Dahmen (1991). The function S is said to be translational if it can be expressed in the form S(x,y) = f(x) + g(y). To see that S is translational whenever Ŝ is convex, observe that within each rectangular patch, Ŝxx = Ŝyy = 0 which in turn implies that Ŝ xy = mn(p i,j p i+1,j p i,j+1 + p i+1,j+1 ) = 0. So Ŝ is not only bilinear but also linear in each patch. By successively adding the above expression together using different indices, one also finds It follows that S(x,y) = p 0,0 p i,0 p 0,j + p i,j = 0. m B i,m (x)p i,0 + n B j,n (y)p 0,j p 0,0 (2) every row of control points is a translation of any other row; hence the name. It was this deficiency that motivated this paper. Is it possible to derive a weaker condition for the convexity of S in terms of the p i,j which at least does not dem that S is translational? The answer is yes we present the new convexity condition in Theorem 2, Section 2. Though lacking somewhat in elegance, perhaps, the condition in Theorem 2 bears a resemblance to the improved condition of Chang & Feng (1984) for triangles. By this we mean that we work directly with the Hessian matrix rather than use degree raising. The main difficulty with tensor-product surfaces is that the three partial second derivatives are polynomials of different degrees, unlike in the Bézier triangle case. We overcome this obstacle by artificially reducing the degrees as necessary so as to obtain the same degree throughout (compare (7) with (10)). If one wanted to carry out a computation to see whether the condition in Theorem 2 was satisfied, one would use the alternative form Theorem 2. Theorems 2 2 apply only when the degree of S is at least 2 in both variables. In the remaining cases, m = 1 n = 1, we present convexity conditions in Theorem 3. We complete Section 2 with a description of 2
3 a simple example of a convex polynomial for which Theorem 2 is valid while Theorem 1 is not. An analogous condition, Theorem 6, for the convexity of a C 1 (non-uniform) B-spline surface is presented in Section 4. The proof uses de Boor points in place of de Casteljau points. Definitions for B-spline surfaces are given in Section A convexity condition for Bézier surfaces The cases m = 1 or n = 1 will be covered later in this section. For now we will assume that m 2 n 2. Recall that a C 2 function S(x,y) of two variables is convex iff its Hessian matrix [ Sxx S xy S xy S yy ] is positive semi-definite for all x y. This is equivalent to the property S xx λ S xy λ 1 λ 2 + S yy λ 2 2 0, (3) for any λ 1,λ 2 IR any x, y. Thus we seek a condition on p i,j to ensure that (3) holds. It is also well known from linear algebra that the inequality holds for all λ 1,λ 2 IR iff Thus the convexity of S is equivalent to aλ bλ 1 λ 2 + cλ 2 2 0, (4) a 0, c 0, ac b 2. (5) S xx 0, S yy 0, S xx S yy S 2 xy. (6) We shall derive convexity conditions in the form of (5). By using the identity B i,k(x) = k(b i 1,k 1 (x) B i,k 1 (x)), see Farin (1988), one can write the second derivatives of S as Bézier surfaces: where m 2 S xx (x,y) = S xy (x,y) = S yy (x,y) = m 1 n B i,m 2 (x)b j,n (y)a i,j, n 1 B i,m 1 (x)b j,n 1 (y)b i,j, m n 2 B i,m (x)b j,n 2 (y)c i,j, a i,j =m(m 1)(p i,j 2p i+1,j + p i+2,j ), b i,j =mn(p i,j p i+1,j p i,j+1 + p i+1,j+1 ), c i,j =n(n 1)(p i,j 2p i,j+1 + p i,j+2 ). 3 (7) (8)
4 Now in order to combine the left h side of (3) into a single Bézier surface, we introduce the de Casteljau points (Farin, 1988). The de Casteljau point p r,s i,j (x,y), a function of x y, is defined recursively as p 0,0 i,j (x,y) = p i,j, for all other r {0,...,m}, s {0,...,n}, p r,s i,j p r,s i,j (x,y) =(1 x)pr 1,s i,j (x,y) + xp r 1,s i+1,j (x,y), (x,y) =(1 y)pr,s 1 i,j (x,y) + yp r,s 1 i,j+1 (x,y). (9) The order of evaluation does not matter; the de Casteljau points are unique despite there being a choice of the two definitions in (9). Then it is well known that S(x,y) = p m,n 0,0 (x,y) = m r n s B i,m r (x)b j,n s (y)p r,s i,j (x,y). We can then express the three second derivatives of S in terms of Bernstein polynomials of degree m 2 n 2: S xx (x,y) = S xy (x,y) = S yy (x,y) = m 2 m 2 m 2 n 2 n 2 n 2 B i,m 2 (x)b j,n 2 (y)a 0,2 i,j (y), B i,m 2 (x)b j,n 2 (y)b 1,1 i,j (x,y), B i,m 2 (x)b j,n 2 (y)c 2,0 i,j (x). (10) Then (3) becomes where m 2 n 2 B i,m 2 (x)b j,n 2 (y)d i,j (x,y) 0 d i,j (x,y) = λ 2 1a 0,2 i,j (y) + 2λ 1λ 2 b 1,1 i,j (x,y) + λ2 2c 2,0 i,j (x). Because the basis functions are non-negative it is thus sufficient to show that d i,j (x,y) 0 (11) for all x y in [0, 1] for all i {0,...,m 2}, j {0,...,n 2}. Our goal is now to reduce (11) to a set of inequalities not involving x y. We take advantage of the fact that a 0,2 i,j (y) b1,1 i,j (x,y) are linear combinations of de Casteljau points of lower degree in y. From the second equation in (9) one finds b 1,1 i,j a 0,2 i,j (y) =(1 y)a0,1 i,j (y) + ya0,1 i,j+1 (y), (x,y) =(1 y)b1,0 i,j (x) + yb1,0 i,j+1 (x). 4
5 Therefore d i,j (x,y) =(1 y)(λ 2 1a 0,1 i,j (y) + 2λ 1λ 2 b 1,0 i,j (x) + λ2 2c 2,0 i,j (x)) so a sufficient condition for (11) to hold is that for l {0, 1}. Similarly we may employ + y(λ 2 1a 0,1 i,j+1 (y) + 2λ 1λ 2 b 1,0 i,j+1 (x) + λ2 2c 2,0 i,j (x)) λ 2 1a 0,1 i,j+l (y) + 2λ 1λ 2 b 1,0 i,j+l (x) + λ2 2c 2,0 i,j (x) 0, b 1,0 i,j+l (x) =(1 x)b i,j+l + xb i+1,j+l, c 2,0 i,j (x) =(1 x)c1,0 i,j (x) + xc1,0 i+1,j (x), to prove that the following four inequalities are sufficient. λ 2 1a 0,1 i,j+l (y) + 2λ 1λ 2 b i+k,j+l + λ 2 2c 1,0 i+k,j (x) 0, for k,l {0, 1}. Finally, by using the linear interpolations it is sufficient that the sixteen conditions a 0,1 i,j+l (y) =(1 y)a i,j+l + ya i,j+l+1, c 1,0 i+k,j (x) =(1 x)c i+k,j + xc i+k+1,j, λ 2 1a i,j+l+s + 2λ 1 λ 2 b i+k,j+l + λ 2 2c i+k+r,j 0, (12) for k,l,r,s {0, 1} are satisfied. Due to the equivalence of (4) (5) we have the equivalent conditions a i,j+l+s 0, c i+k+r,j 0, a i,j+l+s c i+k+r,j b 2 i+k,j+l, for i = 0,...,m 2, j = 0,...,n 2 k,l,r,s {0, 1}. We have thus proved the following theorem. Theorem 2. Let S be the Bézier surface (1) suppose that m 2 n 2. If a i,j 0 for,...,m 2,,...,n, (13) c i,j 0 for,...,m,,...,n 2, (14) a i,j+l+s c i+k+r,j b 2 i+k,j+l for,...,m 2,,...,n 2, k,l,r,s {0,1}, (15) where the terms a i,j, b i,j, c i,j are defined in (8), then S is convex. There is some cancellation in the inequalities in practice one would define A i,j =p i,j 2p i+1,j + p i+2,j, B i,j =p i,j p i+1,j p i,j+1 + p i+1,j+1, C i,j =p i,j 2p i,j+1 + p i,j+2. 5
6 y 1 j/n 0 0 i/m 1 x Figure 1. For fixed i j each inequality only involves points in a 3 3 subgrid. Then, since a i,j =m(m 1)A i,j, b i,j =mnb i,j, c i,j =n(n 1)C i,j, we can express Theorem 2 in an alternative form. Theorem 2. Let S be the Bézier surface (1) suppose that m 2 n 2. If A i,j 0 C i,j 0 for,...,m 2,,...,n, for,...,m,,...,n 2, A i,j+l+s C i+k+r,j KB 2 i+k,j+l for,...,m 2,,...,n 2, k,l,r,s {0,1}, where then S is convex. K = mn (m 1)(n 1), The conditions in Theorem 2 are local in the sense that they are inequalities which only involve control points in the vicinity of p i,j. Indeed each inequality of the form (13) (14) involves three consecutive control points along a horizontal or vertical mesh line respectively, while inequality (15) involves six control points lying within a 3 3 subgrid; see Figure 1. If one insists on a condition which is not only local but also independent of the degree, we can use the fact that K 4 whenever m 2 n 2 replace K by 4 in Theorem 2. There are essentially only three different configurations of the elements a i,j, b i,j, c i,j in inequality (15). These are shown in Figure 2. The others are symmetries of these three. Rotation reflection in horizontal vertical mesh lines give four configurations of types (i) (iii) eight of type (ii) resulting in 16 altogether (there are 16 permutations of the 6
7 c i,j c i+1,j c i+1,j a i,j+1 b i,j b i,j b i,j j i a i,j j i a i,j j i (i) (ii) (iii) Figure 2. The three configurations of the elements in inequality (15) of Theorem 2. indices k, l, r, s in (15)). The total number of inequalities of type (13) is (m 1)(n+1), of type (14) is (m + 1)(n 1) of type (15) is 16(m 1)(n 1). Note that the conditions of Theorem 2 are necessary if S of degree 2 2 is quadratic rather than merely biquadratic. If S is of the form S(x,y) = A + Bx + Cy + Dx 2 + 2Exy + Fy 2, (16) then S xx, S xy, S yy are constant then from (7), S xx = a 0,0 = a 0,1 = a 0,2, S xy = b 0,0 = b 0,1 = b 1,0 = b 1,1, S yy = c 0,0 = c 1,0 = c 2,0. Therefore from (6) if S is convex then (13 15) hold. In the cases m = 1 or n = 1 the theorem is is no longer relevant. Indeed if S is to be convex when m = 1, for example, we are back to the translational case, as defined in Section 1. If (6) is to hold, we must have S xy = 0 since S xx = 0. So S must be translational it merely remains to get a condition for when S yy 0. But from (7) it is sufficient that c i,j 0 for all i j. Further, due to the form (2) of S we only need c i,j 0 when i = 0. This the other cases are summarised below. Theorem 3. Let S be the Bézier surface (1) suppose that either m = 1 or n = 1 or both. (i) If S is convex then S is translational. (ii) Suppose m = 1, n > 1. If S is translational, if c 0,j 0 for all j {0,...,n 2}, then S is convex. (iii) Suppose m > 1, n = 1. If S is translational, if a i,0 0 for all i {0,...,m 2}, then S is convex. (iv) Suppose m = 1, n = 1. S is convex iff S is translational iff S is linear. Finally, we present an example of a convex function for which Theorem 2 applies while Theorem 1 does not. This is a special case of S being quadratic. Example. Let S(x,y) = A + Bx + Cy + Dx 2 + 2Exy + Fy 2, where A, B, C are arbitrary D 0, F 0, DF E 2. Now if E 0, S is not translational so the condition of Theorem 1 is not satisfied. Meanwhile, from (6) 7
8 it follows that S is convex since S is also quadratic, the conditions of Theorem 2 are satisfied as explained earlier. 3. B-spline definitions Following the notation of Farin (1988), consider the tensor-product B-spline surface of degree m n containing L 1 L 2 polynomial patches (some of which may be null). It is specified by the knot sequences {u 0 u L1 +2m 2}, {v 0 v L2 +2n 2} the control points p i,j IR for i = 0,...,L 1 +m 1, j = 0,...,L 2 +n 1. The surface is defined by S(u,v) = L 1 +m 1 L 2 +n 1 N i,m (u)n j,n (v)p i,j (17) for u m 1 u u L1 +m 1, v n 1 v v L2 +n 1, where N i,m (u) is the ith basis function of degree m over the u knot sequence. We will assume that the multiplicity of any u/v knot is less than m/n so that S is C 1. N i,m (u) is only nonzero in the interval [u i 1,u i+m ] likewise for N j,n (v). The basis functions can be defined recursively by the Mansfield, de Boor, Cox recursion, see de Boor (1972): for k {1,...,m}, ( u ui 1 N i,k (u) = u i+k 1 u i 1 N i,0 = ) N i,k 1 (u) + ( ui+k u u i+k u i { 1, if ui 1 u < u i ; 0, otherwise. ) N i+1,k 1 (u) In order to obtain the results in Section 4 we need to define the de Boor algorithm the de Boor points. We can treat each (non-null) knot-rectangle separately so from now on we will assume that u I u < u I+1 v J v < v J+1 where I J are chosen arbitrarily such that m 1 I < L 1 +m 1, n 1 J < L 2 +n 1. The surface S(u,v) in this rectangle can be defined recursively by the de Boor algorithm, due to de Boor (1972). By considering the support of the basis functions one can deduce that the only control points which influence the surface in this rectangle are p i,j IR for i = I m + 1,...,I + 1, j = J n + 1,...,J + 1. Thus S(u,v) = I+1 J+1 i=i m+1 j=j n+1 N i,m (u)n i,n (v)p i,j. Now let p 0,0 i,j (u,v) = p i,j for i = I m + 1,...,I + 1, j = J n + 1,...,J + 1. Then define the functions αi,m(u), k βj,n(v) l p k,l i,j (u,v) as α k i,m(u) = (u u i 1 )/(u i+m k u i 1 ) (18) β l j,n(v) = (v v j 1 )/(v j+n l v j 1 ) (19) p k,l i,j (u,v) = (1 αk i,m(u))p k 1,l i 1,j (u,v) + αk i,m(u)p k 1,l i,j (u, v) (20) 8
9 or p k,l i,j (u,v) = (1 βl j,n(v))p k,l 1 i,j 1 (u,v) + βl j,n(v)p k,l 1 i,j (u, v) (21) for k = 0,...,m, l = 0,...,n, (k,l) (0, 0), i = I m + k + 1,...,I + 1, j = J n+k+1,...,j +1. Then it can be shown that S(u,v) = p m,n I+1,J+1 (u,v), see Farin (1988). The intermediate points p k,l i,j (u,v) in the recursive scheme are known as de Boor points. The order in which one evaluates the de Boor points does not matter (one may use either (20) or (21) if k 1 l 1). More generally, for any r {0,...,m}, s {0,...,n}, we have S(u,v) = I+1 J+1 i=i m+1+r j=j n+1+s N i,m r (u)n j,n s (v)p r,s i,j (u,v). Thus at a given point (u,v), S can be regarded pointwise as a B-spline surface of degree (m r) (n s) with control points p r,s i,j (u,v). We will make use of this property in the next section. 4. Convexity of B-spline surfaces In this section we generalise Theorem 2 to C 1 tensor-product B-splines of degree at least 2 where the multiplicity of each u/v knot is less than the degree m/n. The main difference is that we work with de Boor points instead of de Casteljau points. The proof of convexity within each rectangular patch is otherwise essentially the same. To show that we can work with each polynomial patch separately, we recall the following theorem; see Dahmen (1991). Theorem 4 (Dahmen). Given a convex domain Ω IR 2 which is the (essentially) disjoint union of convex tiles Ω i, then any function f C 1 (Ω) for which f Ω i is convex must be convex. In order to obtain a convexity condition for tensor-product B-spline surfaces, we will require formulas for the second derivatives of S. It is a stard result in spline theory that derivatives of B-splines can be expressed as B-splines themselves. In particular the second derivatives of S can be expressed in this form: where S uu (u,v) = S uv (u,v) = S vv (u,v) = L 1 +m 1 i=2 L 1 +m 1 i=1 L 1 +m 1 L 2 +n 1 L 2 +n 1 j=1 L 2 +n 1 j=2 9 N i,m 2 (u)n j,n (v)a i,j N i,m 1 (u)n j,n 1 (v)b i,j N i,m (u)n j,n 2 (v)c i,j
10 ( pi,j p i 1,j a i,j =m(m 1) p ) i 1,j p i 2,j /(u m+i 2 u i 1 ), u i+m 1 u i 1 u i+m 2 u i 2 b i,j =mn p i,j p i 1,j p i,j 1 + p i 1,j 1 (u i+m 1 u i 1 )(v j+n 1 v j 1 ), ( pi,j p i,j 1 c i,j =n(n 1) p ) i,j 1 p i,j 2 /(v n+j 2 v j 1 ). v j+n 1 v j 1 v j+n 2 v j 2 Note that under the assumption made on the knots, the above expressions are always valid; there is no division by zero. Now suppose (u,v) [u I,u I+1 ] [v J,v J+1 ] for some I, J. Referring to Section 3, one can use the de Boor points to re-express the above identities as S uu (u,v) = S uv (u,v) = S vv (u,v) = I+1 J+1 i=i m+3 j=j n+3 I+1 J+1 i=i m+3 j=j n+3 I+1 J+1 i=i m+3 j=j n+3 Then S(u,v) is convex iff for all λ 1,λ 2 IR, where I+1 J+1 i=i m+3 j=j n+3 N i,m 2 (u)n j,n 2 (v)a 0,2 i,j (v) N i,m 2 (u)n j,n 2 (v)b 1,1 i,j (u,v) N i,m 2 (u)n j,n 2 (v)c 2,0 i,j (u) N i,m 2 (u)n j,n 2 (v)d i,j (u,v) 0 d i,j (u,v) = λ 2 1a 0,2 i,j (v) + 2λ 1λ 2 b 1,1 i,j (u,v) + λ2 2c 2,0 i,j (u). Since the basis functions are non-negative, it is thus sufficient to show that (22) d i,j (u,v) 0 (23) for all (u,v) [u I,u I+1 ] [v J,v J+1 ] for all i {I m + 3,...,I + 1}, j {J n + 3,...,J + 1}. Now we follow a similar approach as in Section 2. One can reduce (23) to a set of inequalities not involving u v. First we express a 0,2 i,j the v variable. Thus, from (21), we find noting that S uv is of degree n 1 in v, (v) b1,1 i,j a 0,2 i,j (v) = (1 β2 j,n(v))a 0,1 i,j 1 (v) + β2 j,n(v)a 0,1 i,j (v) b 1,1 i,j (u,v) =(1 β1 j,n 1(v))b 1,0 i,j 1 (u) + β1 j,n 1(v)b 1,0 i,j (u) =(1 β 2 j,n(v))b 1,0 i,j 1 (u) + β2 j,n(v)b 1,0 i,j (u), 10 (u,v) as linear interpolations in
11 by the definition of the β terms, (19). Thus a sufficient condition is that for l {0, 1}. Further we observe that Therefore, it is sufficient that for k, l {0, 1}. Finally by applying λ 2 1a 0,1 i,j l (v) + 2λ 1λ 2 b 1,0 i,j l (u) + λ2 2c 2,0 i,j (u) 0, b 1,0 i,j l (u) =(1 α1 i,m 1(u))b i 1,j l + α 1 i,m 1(u)b i,j l =(1 α 2 i,m(u))b i 1,j l + α 2 i,m(u)b i,j l, c 2,0 i,j (u) = (1 α2 i,m(u))c 1,0 i 1,j (u) + α2 i,m(u)c 1,0 i,j (u). λ 2 1a 0,1 i,j l (v) + 2λ 1λ 2 b i k,j l + λ 2 2c 1,0 i k,j (u) 0, a 0,1 i,j l (v) = (1 β1 j,n(v))a i,j l 1 + β 1 j,n(v)a i,j l c 1,0 i k,j (u) = (1 α1 i,m(u))c i k 1,j + α 1 i,m(u)c i k,j. we arrive at the sixteen sufficient conditions: λ 2 1a i,j l s + 2λ 1 λ 2 b i k,j l + λ 2 2c i k r,j 0, for k,l,r,s {0, 1} in analogy with the Bézier case in Section 2. We have proved the following lemma concerning S [u I,u I+1 ] [v J,v J+1 ]. Lemma 5. Let S be the B-spline surface (17) suppose that m 2 n 2. Choose I,J IN such that m 1 I < L 1 + m 1, n 1 J < L 2 + n 1 suppose that u I < u I+1 v J < v J+1. If a i,j 0 for i=i m+3,...,i+1, j=j n+1,...,j+1, c i,j 0 a i,j l s c i k r,j b 2 i k,j l for i=i m+1,...,i+1, j=j n+3,...,j+1, for i=i m+3,...,i+1, j=j n+3,...,j+1, k,l,r,s {0,1}, where the terms a i,j, b i,j, c i,j are defined in (22), then S is convex on the subdomain [u I,u I+1 ] [v J,v J+1 ]. We now have a condition for S to be convex in the subdomain [u I,u I+1 ] [v J,v J+1 ]. Using the fact that S is C 1 applying Theorem 4, we can simply combine all the conditions in Lemma 5 (many of which are repeated) to obtain a condition for the convexity of S over the whole domain [u m 1,u L1 m+1] [v n 1,v L2 m+1]. We have thus proved the following theorem. 11
12 Theorem 6. Let S be the B-spline surface (17) suppose that m 2 n 2. If a i,j 0 c i,j 0 for i=2,...,l 1 +m 1,,...,L 2 +n 1, for,...,l 1 +m 1, j=2,...,l 2 +n 1, a i,j l s c i k r,j b 2 i k,j l for i=2,...,l 1 +m 1, j=2,...,l 2 +n 1, k,l,r,s {0,1}, where the terms a i,j, b i,j, c i,j are defined in (22), then S is convex. Acknowledgement. The author wishes to thank the referee for helpful comments in particular for pointing out that the convexity conditions in Theorem 2 are necessary when the surface is quadratic. 5. References C. de Boor (1972) On calculating with B-splines, J. Approx. Theory, 6, A. S. Cavaretta & A. Sharma (1990) Variation diminishing properties convexity for the tensor product Bernstein operator, to appear. G. Chang & P. J. Davis (1984) The convexity of Bernstein polynomials over triangles, J. Approx. Theory, 40, G. Chang & Y. Feng (1984) An improved condition for the convexity of Bernstein-Bézier surfaces over triangles, Computer-Aided Geom. Design, 1, W. Dahmen (1991) Convexity Bernstein-Bézier polynomials, Curves Surfaces, P. J. Laurent, A. Le Méhauté, L. L. Schumaker (eds.), Academic Press, Boston, 1, G. Farin (1988) Curves surfaces for computer aided geometric design, Academic Press, San Diego. T. N. T. Goodman (1989) Shape preserving representations, Mathematical Methods in Computer-Aided Geom. Design, T. Lyche & L. L. Schumaker (eds.), Academic Press, Boston, 1,
and the crooked shall be made straight, and the rough ways shall be made smooth; Luke 3:5
ecture 8: Knot Insertion Algorithms for B-Spline Curves and Surfaces and the crooked shall be made straight, and the rough ways shall be made smooth; uke 3:5. Motivation B-spline methods have several advantages
More informationRational Bezier Surface
Rational Bezier Surface The perspective projection of a 4-dimensional polynomial Bezier surface, S w n ( u, v) B i n i 0 m j 0, u ( ) B j m, v ( ) P w ij ME525x NURBS Curve and Surface Modeling Page 97
More informationOn the deviation of a parametric cubic spline interpolant from its data polygon
Computer Aided Geometric Design 25 (2008) 148 156 wwwelseviercom/locate/cagd On the deviation of a parametric cubic spline interpolant from its data polygon Michael S Floater Department of Computer Science,
More informationDiscrete Coons patches
Computer Aided Geometric Design 16 (1999) 691 700 Discrete Coons patches Gerald Farin a,, Dianne Hansford b,1 a Computer Science and Engineering, Arizona State University, Tempe, AZ 85287-5406, USA b NURBS
More informationThe Essentials of CAGD
The Essentials of CAGD Chapter 6: Bézier Patches Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book www.farinhansford.com/books/essentials-cagd c 2 Farin & Hansford The
More informationSurfaces for CAGD. FSP Tutorial. FSP-Seminar, Graz, November
Surfaces for CAGD FSP Tutorial FSP-Seminar, Graz, November 2005 1 Tensor Product Surfaces Given: two curve schemes (Bézier curves or B splines): I: x(u) = m i=0 F i(u)b i, u [a, b], II: x(v) = n j=0 G
More informationLecture 25: Bezier Subdivision. And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10
Lecture 25: Bezier Subdivision And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10 1. Divide and Conquer If we are going to build useful
More informationCurves and Surfaces for Computer-Aided Geometric Design
Curves and Surfaces for Computer-Aided Geometric Design A Practical Guide Fourth Edition Gerald Farin Department of Computer Science Arizona State University Tempe, Arizona /ACADEMIC PRESS I San Diego
More information08 - Designing Approximating Curves
08 - Designing Approximating Curves Acknowledgement: Olga Sorkine-Hornung, Alexander Sorkine-Hornung, Ilya Baran Last time Interpolating curves Monomials Lagrange Hermite Different control types Polynomials
More informationRemark. Jacobs University Visualization and Computer Graphics Lab : ESM4A - Numerical Methods 331
Remark Reconsidering the motivating example, we observe that the derivatives are typically not given by the problem specification. However, they can be estimated in a pre-processing step. A good estimate
More informationSung-Eui Yoon ( 윤성의 )
CS480: Computer Graphics Curves and Surfaces Sung-Eui Yoon ( 윤성의 ) Course URL: http://jupiter.kaist.ac.kr/~sungeui/cg Today s Topics Surface representations Smooth curves Subdivision 2 Smooth Curves and
More information09 - Designing Surfaces. CSCI-GA Computer Graphics - Fall 16 - Daniele Panozzo
9 - Designing Surfaces Triangular surfaces A surface can be discretized by a collection of points and triangles Each triangle is a subset of a plane Every point on the surface can be expressed as an affine
More informationCurve and Surface Basics
Curve and Surface Basics Implicit and parametric forms Power basis form Bezier curves Rational Bezier Curves Tensor Product Surfaces ME525x NURBS Curve and Surface Modeling Page 1 Implicit and Parametric
More informationAdaptive and Smooth Surface Construction by Triangular A-Patches
Adaptive and Smooth Surface Construction by Triangular A-Patches Guoliang Xu Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences, Beijing, China Abstract
More informationA generalized conversion matrix between non-uniform B-spline and Bézier representations with applications in CAGD
A generalized conversion matrix between non-uniform B-spline and Bézier representations with applications in CAGD Giulio Casciola, Lucia Romani Department of Mathematics, University of Bologna, P.zza di
More informationA new 8-node quadrilateral spline finite element
Journal of Computational and Applied Mathematics 195 (2006) 54 65 www.elsevier.com/locate/cam A new 8-node quadrilateral spline finite element Chong-Jun Li, Ren-Hong Wang Institute of Mathematical Sciences,
More informationA C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions
A C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions Nira Dyn Michael S. Floater Kai Hormann Abstract. We present a new four-point subdivision scheme that generates C 2 curves.
More informationQuasi-Quartic Trigonometric Bézier Curves and Surfaces with Shape Parameters
Quasi-Quartic Trigonometric Bézier Curves and Surfaces with Shape Parameters Reenu Sharma Assistant Professor, Department of Mathematics, Mata Gujri Mahila Mahavidyalaya, Jabalpur, Madhya Pradesh, India
More informationPS Geometric Modeling Homework Assignment Sheet I (Due 20-Oct-2017)
Homework Assignment Sheet I (Due 20-Oct-2017) Assignment 1 Let n N and A be a finite set of cardinality n = A. By definition, a permutation of A is a bijective function from A to A. Prove that there exist
More informationOn an approach for cubic Bézier interpolation
Second International Conference Modelling and Development of Intelligent Systems Sibiu - Romania, September 29 - October 02, 2011 On an approach for cubic Bézier interpolation Dana Simian, Corina Simian
More informationPreferred directions for resolving the non-uniqueness of Delaunay triangulations
Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation
More informationMA 323 Geometric Modelling Course Notes: Day 28 Data Fitting to Surfaces
MA 323 Geometric Modelling Course Notes: Day 28 Data Fitting to Surfaces David L. Finn Today, we want to exam interpolation and data fitting problems for surface patches. Our general method is the same,
More informationUsing Farin points for rational Bézier surfaces
Computer Aided Geometric Design 16 (1999) 817 835 Using Farin points for rational Bézier surfaces Holger Theisel 1 University of Rostock, Computer Science Department, P.O. Box 999, 18051 Rostock, Germany
More informationOn the Dimension of the Bivariate Spline Space S 1 3( )
On the Dimension of the Bivariate Spline Space S 1 3( ) Gašper Jaklič Institute of Mathematics, Physics and Mechanics University of Ljubljana Jadranska 19, 1000 Ljubljana, Slovenia Gasper.Jaklic@fmf.uni-lj.si
More informationRational Bezier Curves
Rational Bezier Curves Use of homogeneous coordinates Rational spline curve: define a curve in one higher dimension space, project it down on the homogenizing variable Mathematical formulation: n P(u)
More informationLecture 9: Introduction to Spline Curves
Lecture 9: Introduction to Spline Curves Splines are used in graphics to represent smooth curves and surfaces. They use a small set of control points (knots) and a function that generates a curve through
More informationFigure 5.1: Spline and ducks.
Chapter 5 B-SPLINE CURVES Most shapes are simply too complicated to define using a single Bézier curve. A spline curve is a sequence of curve segments that are connected together to form a single continuous
More informationA C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions
A C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions Nira Dyn School of Mathematical Sciences Tel Aviv University Michael S. Floater Department of Informatics University of
More information3D Modeling Parametric Curves & Surfaces. Shandong University Spring 2013
3D Modeling Parametric Curves & Surfaces Shandong University Spring 2013 3D Object Representations Raw data Point cloud Range image Polygon soup Surfaces Mesh Subdivision Parametric Implicit Solids Voxels
More informationCS130 : Computer Graphics Curves (cont.) Tamar Shinar Computer Science & Engineering UC Riverside
CS130 : Computer Graphics Curves (cont.) Tamar Shinar Computer Science & Engineering UC Riverside Blending Functions Blending functions are more convenient basis than monomial basis canonical form (monomial
More informationSPLINE APPROXIMATION VIA THE CONTROL POLYGON
SPLINE APPROXIMATION VIA THE CONTROL POLYGON by Håkon Mørk THESIS for the degree of MASTER S DEGREE IN APPLIED MATHEMATICS AND MECHANICS (Master i Anvendt matematikk og mekanikk) Faculty of Mathematics
More informationApproximation of 3D-Parametric Functions by Bicubic B-spline Functions
International Journal of Mathematical Modelling & Computations Vol. 02, No. 03, 2012, 211-220 Approximation of 3D-Parametric Functions by Bicubic B-spline Functions M. Amirfakhrian a, a Department of Mathematics,
More informationCHAPTER 6 Parametric Spline Curves
CHAPTER 6 Parametric Spline Curves When we introduced splines in Chapter 1 we focused on spline curves, or more precisely, vector valued spline functions. In Chapters 2 and 4 we then established the basic
More informationComputer Graphics Curves and Surfaces. Matthias Teschner
Computer Graphics Curves and Surfaces Matthias Teschner Outline Introduction Polynomial curves Bézier curves Matrix notation Curve subdivision Differential curve properties Piecewise polynomial curves
More informationGeneralised Mean Averaging Interpolation by Discrete Cubic Splines
Publ. RIMS, Kyoto Univ. 30 (1994), 89-95 Generalised Mean Averaging Interpolation by Discrete Cubic Splines By Manjulata SHRIVASTAVA* Abstract The aim of this work is to introduce for a discrete function,
More informationParametric Curves. University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell
Parametric Curves University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Parametric Representations 3 basic representation strategies: Explicit: y = mx + b Implicit: ax + by + c
More informationFurther Graphics. Bezier Curves and Surfaces. Alex Benton, University of Cambridge Supported in part by Google UK, Ltd
Further Graphics Bezier Curves and Surfaces Alex Benton, University of Cambridge alex@bentonian.com 1 Supported in part by Google UK, Ltd CAD, CAM, and a new motivation: shiny things Expensive products
More informationParametric Surfaces. Michael Kazhdan ( /657) HB , FvDFH 11.2
Parametric Surfaces Michael Kazhdan (601.457/657) HB 10.6 -- 10.9, 10.1 FvDFH 11.2 Announcement OpenGL review session: When: Wednesday (10/1) @ 7:00-9:00 PM Where: Olin 05 Cubic Splines Given a collection
More informationBézier Splines. B-Splines. B-Splines. CS 475 / CS 675 Computer Graphics. Lecture 14 : Modelling Curves 3 B-Splines. n i t i 1 t n i. J n,i.
Bézier Splines CS 475 / CS 675 Computer Graphics Lecture 14 : Modelling Curves 3 n P t = B i J n,i t with 0 t 1 J n, i t = i=0 n i t i 1 t n i No local control. Degree restricted by the control polygon.
More informationDerivative. Bernstein polynomials: Jacobs University Visualization and Computer Graphics Lab : ESM4A - Numerical Methods 313
Derivative Bernstein polynomials: 120202: ESM4A - Numerical Methods 313 Derivative Bézier curve (over [0,1]): with differences. being the first forward 120202: ESM4A - Numerical Methods 314 Derivative
More informationEfficient Degree Elevation and Knot Insertion for B-spline Curves using Derivatives
Efficient Degree Elevation and Knot Insertion for B-spline Curves using Derivatives Qi-Xing Huang a Shi-Min Hu a,1 Ralph R Martin b a Department of Computer Science and Technology, Tsinghua University,
More informationFreeform Curves on Spheres of Arbitrary Dimension
Freeform Curves on Spheres of Arbitrary Dimension Scott Schaefer and Ron Goldman Rice University 6100 Main St. Houston, TX 77005 sschaefe@rice.edu and rng@rice.edu Abstract Recursive evaluation procedures
More informationFebruary 2017 (1/20) 2 Piecewise Polynomial Interpolation 2.2 (Natural) Cubic Splines. MA378/531 Numerical Analysis II ( NA2 )
f f f f f (/2).9.8.7.6.5.4.3.2. S Knots.7.6.5.4.3.2. 5 5.2.8.6.4.2 S Knots.2 5 5.9.8.7.6.5.4.3.2..9.8.7.6.5.4.3.2. S Knots 5 5 S Knots 5 5 5 5.35.3.25.2.5..5 5 5.6.5.4.3.2. 5 5 4 x 3 3.5 3 2.5 2.5.5 5
More informationREGULAR GRAPHS OF GIVEN GIRTH. Contents
REGULAR GRAPHS OF GIVEN GIRTH BROOKE ULLERY Contents 1. Introduction This paper gives an introduction to the area of graph theory dealing with properties of regular graphs of given girth. A large portion
More informationClosest Points, Moving Surfaces, and Algebraic Geometry
Closest Points, Moving Surfaces, and Algebraic Geometry Jan B. Thomassen, Pål H. Johansen, and Tor Dokken Abstract. This paper presents a method for computing closest points to a given parametric surface
More informationGeneralized barycentric coordinates
Generalized barycentric coordinates Michael S. Floater August 20, 2012 In this lecture, we review the definitions and properties of barycentric coordinates on triangles, and study generalizations to convex,
More informationReading. Parametric surfaces. Surfaces of revolution. Mathematical surface representations. Required:
Reading Required: Angel readings for Parametric Curves lecture, with emphasis on 11.1.2, 11.1.3, 11.1.5, 11.6.2, 11.7.3, 11.9.4. Parametric surfaces Optional Bartels, Beatty, and Barsky. An Introduction
More informationDesign considerations
Curves Design considerations local control of shape design each segment independently smoothness and continuity ability to evaluate derivatives stability small change in input leads to small change in
More informationINTERPOLATION BY QUARTIC SPLINE
INTERPOLATION BY QUARTIC SPLINE K.K.Nigam 1, Y.P. Dubey 2, Brajendra Tiwari 3, Anil Shukla 4 1 Mathematics Deptt., LNCT Jabalpur, MP, (India) 2 Sarswati Institution of Engg. & Technology, Jabalpur MP,
More informationComputergrafik. Matthias Zwicker Universität Bern Herbst 2016
Computergrafik Matthias Zwicker Universität Bern Herbst 2016 Today Curves NURBS Surfaces Parametric surfaces Bilinear patch Bicubic Bézier patch Advanced surface modeling 2 Piecewise Bézier curves Each
More informationNeed for Parametric Equations
Curves and Surfaces Curves and Surfaces Need for Parametric Equations Affine Combinations Bernstein Polynomials Bezier Curves and Surfaces Continuity when joining curves B Spline Curves and Surfaces Need
More informationCS 475 / CS Computer Graphics. Modelling Curves 3 - B-Splines
CS 475 / CS 675 - Computer Graphics Modelling Curves 3 - Bézier Splines n P t = i=0 No local control. B i J n,i t with 0 t 1 J n,i t = n i t i 1 t n i Degree restricted by the control polygon. http://www.cs.mtu.edu/~shene/courses/cs3621/notes/spline/bezier/bezier-move-ct-pt.html
More informationNon-Uniform Recursive Doo-Sabin Surfaces (NURDSes)
Non-Uniform Recursive Doo-Sabin Surfaces Zhangjin Huang 1 Guoping Wang 2 1 University of Science and Technology of China 2 Peking University, China SIAM Conference on Geometric and Physical Modeling Doo-Sabin
More informationImportant Properties of B-spline Basis Functions
Important Properties of B-spline Basis Functions P2.1 N i,p (u) = 0 if u is outside the interval [u i, u i+p+1 ) (local support property). For example, note that N 1,3 is a combination of N 1,0, N 2,0,
More informationPACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS
PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed
More informationA general matrix representation for non-uniform B-spline subdivision with boundary control
A general matrix representation for non-uniform B-spline subdivision with boundary control G. Casciola a, L. Romani a a Department of Mathematics, University of Bologna, P.zza di Porta San Donato 5, 40127
More informationParameterization. Michael S. Floater. November 10, 2011
Parameterization Michael S. Floater November 10, 2011 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to generate from point
More informationDimensions of Spline Spaces over 3D Hierarchical T-Meshes
Journal of Information & Computational Science 3: 3 (2006) 487 501 Available at http://www.joics.com Dimensions of Spline Spaces over 3D Hierarchical T-Meshes Xin Li, Jiansong Deng, Falai Chen Department
More informationQuadratic and cubic b-splines by generalizing higher-order voronoi diagrams
Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams Yuanxin Liu and Jack Snoeyink Joshua Levine April 18, 2007 Computer Science and Engineering, The Ohio State University 1 / 24
More informationECE 600, Dr. Farag, Summer 09
ECE 6 Summer29 Course Supplements. Lecture 4 Curves and Surfaces Aly A. Farag University of Louisville Acknowledgements: Help with these slides were provided by Shireen Elhabian A smile is a curve that
More informationInteractive Graphics. Lecture 9: Introduction to Spline Curves. Interactive Graphics Lecture 9: Slide 1
Interactive Graphics Lecture 9: Introduction to Spline Curves Interactive Graphics Lecture 9: Slide 1 Interactive Graphics Lecture 13: Slide 2 Splines The word spline comes from the ship building trade
More informationParametric Curves. University of Texas at Austin CS384G - Computer Graphics
Parametric Curves University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Parametric Representations 3 basic representation strategies: Explicit: y = mx + b Implicit: ax + by + c
More informationp y = 0 x c Figure : Stereographic projection. r p p y = 0 c p Figure : Central projection. Furthermore, we will discuss representations of entire sph
Circle and Sphere as rational splines Claudia Bangert and Hartmut Prautzsch Universitat Karlsruhe, Fakultat fur Informatik D-8 Karlsruhe, Germany corresponding author, e-mail: prau@ira.uka.de Abstract
More informationKai Hormann, N. Sukumar. Generalized Barycentric Coordinates in Computer Graphics and Computational Mechanics
Kai Hormann, N. Sukumar Generalized Barycentric Coordinates in Computer Graphics and Computational Mechanics Contents Chapter 1 Multi-Sided Patches via Barycentric Coordinates 1 Scott Schaefer 1.1 INTRODUCTION
More information2D Spline Curves. CS 4620 Lecture 13
2D Spline Curves CS 4620 Lecture 13 2008 Steve Marschner 1 Motivation: smoothness In many applications we need smooth shapes [Boeing] that is, without discontinuities So far we can make things with corners
More informationConvergence of C 2 Deficient Quartic Spline Interpolation
Advances in Computational Sciences and Technology ISSN 0973-6107 Volume 10, Number 4 (2017) pp. 519-527 Research India Publications http://www.ripublication.com Convergence of C 2 Deficient Quartic Spline
More informationParameterization for curve interpolation
Working title: Topics in Multivariate Approximation and Interpolation 101 K. Jetter et al., Editors c 2005 Elsevier B.V. All rights reserved Parameterization for curve interpolation Michael S. Floater
More informationPositivity Preserving Interpolation of Positive Data by Rational Quadratic Trigonometric Spline
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn:2319-765x. Volume 10, Issue 2 Ver. IV (Mar-Apr. 2014), PP 42-47 Positivity Preserving Interpolation of Positive Data by Rational Quadratic
More informationOn-Line Geometric Modeling Notes REFINEMENT
On-Line Geometric Modeling Notes REFINEMENT Kenneth I Joy Visualization and Graphics Research Group Department of Computer Science University of California, Davis Overview Bézier curves, B-spline curves
More informationComputergrafik. Matthias Zwicker. Herbst 2010
Computergrafik Matthias Zwicker Universität Bern Herbst 2010 Today Curves NURBS Surfaces Parametric surfaces Bilinear patch Bicubic Bézier patch Advanced surface modeling Piecewise Bézier curves Each segment
More informationDeficient Quartic Spline Interpolation
International Journal of Computational Science and Mathematics. ISSN 0974-3189 Volume 3, Number 2 (2011), pp. 227-236 International Research Publication House http://www.irphouse.com Deficient Quartic
More informationC 1 Quintic Spline Interpolation Over Tetrahedral Partitions
C 1 Quintic Spline Interpolation Over Tetrahedral Partitions Gerard Awanou and Ming-Jun Lai Abstract. We discuss the implementation of a C 1 quintic superspline method for interpolating scattered data
More informationSpline curves. in polar and Cartesian coordinates. Giulio Casciola and Serena Morigi. Department of Mathematics, University of Bologna, Italy
Spline curves in polar and Cartesian coordinates Giulio Casciola and Serena Morigi Department of Mathematics, University of Bologna, Italy Abstract. A new class of spline curves in polar coordinates has
More informationCurves and Surfaces. Shireen Elhabian and Aly A. Farag University of Louisville
Curves and Surfaces Shireen Elhabian and Aly A. Farag University of Louisville February 21 A smile is a curve that sets everything straight Phyllis Diller (American comedienne and actress, born 1917) Outline
More informationAdvanced Graphics. Beziers, B-splines, and NURBS. Alex Benton, University of Cambridge Supported in part by Google UK, Ltd
Advanced Graphics Beziers, B-splines, and NURBS Alex Benton, University of Cambridge A.Benton@damtp.cam.ac.uk Supported in part by Google UK, Ltd Bezier splines, B-Splines, and NURBS Expensive products
More informationSpline Methods Draft. Tom Lyche and Knut Mørken
Spline Methods Draft Tom Lyche and Knut Mørken 24th May 2002 2 Contents 1 Splines and B-splines an introduction 3 1.1 Convex combinations and convex hulls..................... 3 1.1.1 Stable computations...........................
More informationSpline Methods Draft. Tom Lyche and Knut Mørken
Spline Methods Draft Tom Lyche and Knut Mørken January 5, 2005 2 Contents 1 Splines and B-splines an Introduction 3 1.1 Convex combinations and convex hulls.................... 3 1.1.1 Stable computations...........................
More informationSpline Methods Draft. Tom Lyche and Knut Mørken. Department of Informatics Centre of Mathematics for Applications University of Oslo
Spline Methods Draft Tom Lyche and Knut Mørken Department of Informatics Centre of Mathematics for Applications University of Oslo January 27, 2006 Contents 1 Splines and B-splines an Introduction 1 1.1
More informationA Practical Review of Uniform B-Splines
A Practical Review of Uniform B-Splines Kristin Branson A B-spline is a convenient form for representing complicated, smooth curves. A uniform B-spline of order k is a piecewise order k Bezier curve, and
More informationConstruct Piecewise Hermite Interpolation Surface with Blending Methods
Construct Piecewise Hermite Interpolation Surface with Blending Methods Xiao-Shan Gao and Ming Li Institute of System Sciences, AMSS, Academia Sinica Beijing 100080, China (xgao,mli)@mmrc.iss.ac.cn Abstract
More informationDiscrete Cubic Interpolatory Splines
Publ RIMS, Kyoto Univ. 28 (1992), 825-832 Discrete Cubic Interpolatory Splines By Manjulata SHRIVASTAVA* Abstract In the present paper, existence, uniqueness and convergence properties of a discrete cubic
More informationKnot Insertion and Reparametrization of Interval B-spline Curves
International Journal of Video&Image Processing and Network Security IJVIPNS-IJENS Vol:14 No:05 1 Knot Insertion and Reparametrization of Interval B-spline Curves O. Ismail, Senior Member, IEEE Abstract
More informationLinear Precision for Parametric Patches
Department of Mathematics Texas A&M University March 30, 2007 / Texas A&M University Algebraic Geometry and Geometric modeling Geometric modeling uses polynomials to build computer models for industrial
More information3D Modeling Parametric Curves & Surfaces
3D Modeling Parametric Curves & Surfaces Shandong University Spring 2012 3D Object Representations Raw data Point cloud Range image Polygon soup Solids Voxels BSP tree CSG Sweep Surfaces Mesh Subdivision
More informationParametric curves. Brian Curless CSE 457 Spring 2016
Parametric curves Brian Curless CSE 457 Spring 2016 1 Reading Required: Angel 10.1-10.3, 10.5.2, 10.6-10.7, 10.9 Optional Bartels, Beatty, and Barsky. An Introduction to Splines for use in Computer Graphics
More informationOn the graphical display of Powell-Sabin splines: a comparison of three piecewise linear approximations
On the graphical display of Powell-Sabin splines: a comparison of three piecewise linear approximations Hendrik Speleers Paul Dierckx Stefan Vandewalle Report TW515, January 008 Ò Katholieke Universiteit
More informationNatural Quartic Spline
Natural Quartic Spline Rafael E Banchs INTRODUCTION This report describes the natural quartic spline algorithm developed for the enhanced solution of the Time Harmonic Field Electric Logging problem As
More information2D Spline Curves. CS 4620 Lecture 18
2D Spline Curves CS 4620 Lecture 18 2014 Steve Marschner 1 Motivation: smoothness In many applications we need smooth shapes that is, without discontinuities So far we can make things with corners (lines,
More informationlecture 10: B-Splines
9 lecture : -Splines -Splines: a basis for splines Throughout our discussion of standard polynomial interpolation, we viewed P n as a linear space of dimension n +, and then expressed the unique interpolating
More informationE-learning solutions in curve and surface design Corina DanaSimian
First International Conference Modelling and Development of Intelligent Systems Sibiu - Romania, 22-25 October, 2009 Wasp based algorithms and applications Corina DanaSimian Abstract aim aim of this of
More informationAn Introduction to B-Spline Curves
An Introduction to B-Spline Curves Thomas W. Sederberg March 14, 2005 1 B-Spline Curves Most shapes are simply too complicated to define using a single Bézier curve. A spline curve is a sequence of curve
More informationCOMPUTER AIDED GEOMETRIC DESIGN. Thomas W. Sederberg
COMPUTER AIDED GEOMETRIC DESIGN Thomas W. Sederberg January 31, 2011 ii T. W. Sederberg iii Preface This semester is the 24 th time I have taught a course at Brigham Young University titled, Computer Aided
More informationBS-Patch: Constrained Bezier Parametric Patch
BS-Patch: Constrained Bezier Parametric Patch VACLAV SKALA, VIT ONDRACKA Department of Computer Science and Engineering University of West Bohemia Univerzitni 8, CZ 06 14 Plzen CZECH REPUBLIC skala@kiv.zcu.cz
More informationAlmost Curvature Continuous Fitting of B-Spline Surfaces
Journal for Geometry and Graphics Volume 2 (1998), No. 1, 33 43 Almost Curvature Continuous Fitting of B-Spline Surfaces Márta Szilvási-Nagy Department of Geometry, Mathematical Institute, Technical University
More information(Spline, Bezier, B-Spline)
(Spline, Bezier, B-Spline) Spline Drafting terminology Spline is a flexible strip that is easily flexed to pass through a series of design points (control points) to produce a smooth curve. Spline curve
More informationCentral issues in modelling
Central issues in modelling Construct families of curves, surfaces and volumes that can represent common objects usefully; are easy to interact with; interaction includes: manual modelling; fitting to
More informationAn introduction to interpolation and splines
An introduction to interpolation and splines Kenneth H. Carpenter, EECE KSU November 22, 1999 revised November 20, 2001, April 24, 2002, April 14, 2004 1 Introduction Suppose one wishes to draw a curve
More informationLocal Approximation by Splines with Displacement of Nodes
ISSN 1055-1344, Siberian Advances in Mathematics, 013, Vol. 3, No. 1, pp. 69 75. c Allerton Press, Inc., 013. Original Russian Text c Yu. S. Volkov, E. V. Strelkova, and V. T. Shevaldin, 011, published
More informationA New Class of Quasi-Cubic Trigonometric Bezier Curve and Surfaces
A New Class of Quasi-Cubic Trigonometric Bezier Curve and Surfaces Mridula Dube 1, Urvashi Mishra 2 1 Department of Mathematics and Computer Science, R.D. University, Jabalpur, Madhya Pradesh, India 2
More information= f (a, b) + (hf x + kf y ) (a,b) +
Chapter 14 Multiple Integrals 1 Double Integrals, Iterated Integrals, Cross-sections 2 Double Integrals over more general regions, Definition, Evaluation of Double Integrals, Properties of Double Integrals
More information