Rational Interpolants with Tension Parameters

Size: px
Start display at page:

Download "Rational Interpolants with Tension Parameters"

Transcription

1 Ratonal Interpolants wt Tenson Parameters Gulo Cascola and Luca Roman Abstract. In ts paper we present a NURBS verson of te ratonal nterpolatng splne wt tenson ntroduced n [2], and we extend our proposal to te rectangular topology case. In partcular we present some ratonal nterpolatng tecnques tat enable us to reconstruct sape-preservng bvarate NURBS and allow us to nteractvely modfy te resultng surface by a set of tenson parameters. 1. Introducton Lookng at te story of CAGD n ndustry, t appears tat te need for compatble formats to excange data among dfferent systems led to te ntroducton of NURBS representaton, wc s even today, te current ndustry standard. However, even f NURBS s te most mportant entty n ndustral applcatons, n all commercal software packages te wegts are not used wen approxmatng or nterpolatng wt NURBS. Ts s because te desred range of values tat tey sould attan s rater restrctve (wegts sould be postve, bounded away from zero and also ave a reasonable upper bound n standard form). However, te man reason for te lmted use of nterpolatng NURBS s tat treatng wegts and control ponts as unknowns mmedately requres te soluton of a nonlnear problem. Terefore, te lterature s extremely poor n te feld of ratonal nterpolaton, snce very few autors ave tred to face all te dffcultes tat arse. Furtermore, as NURBS representaton can only be used to a very lmted extent for actual modellng purposes, te only excepton mgt be to style an applcaton were te wegts are used as farng or sculptng parameters. Tese consderatons motvated te researc reported n ts paper, were we propose a unvarate/bvarate nterpolatng NURBS, wose wegts are used as tenson parameters. Te unvarate form s te NURBS verson of te ratonal nterpolatng splne wt tenson orgnally proposed n [2] and [3] n order to mprove classcal polynomal tenson metods. In fact, wle te most famous nterpolatng splnes wt tenson, te so-called ν-splnes [5,6], are lmted to te parametrc case, our proposal works effcently bot n non-parametrc and parametrc cases. However, as our am s smply to underlne te possblty of applyng an

2 42 G.Cascola and L.Roman nterpolatng metod wt tenson propertes to non-parametrc sets of ponts, we wll lmt our attenton to te scalar formulaton only. In te same way, wen we present te extenson of ts proposal to te bvarate case, we address our attenton to non-parametrc ratonal nterpolatng tecnques of a rectangular set of ponts, wle stressng tat, n comparson to te few oter tenson metods proposed up to now, our soluton s gly flexble for geometrc modellng purposes and can be mplemented n a NURBS-based CAD system wt a really low computatonal cost. 2. Pecewse Ratonal Cubc Interpolant wt Tenson Defnton 1. Let (x, F ), = 0,..., N (wt x 0 < x 1 <... < x N ) be nterpolatng ponts and let D, = 0,..., N, denote frst dervatve values defned at te knots x. Ten a pecewse ratonal cubc nterpolatng functon c(x) C 1 [x 0,x N ] s defned for x [x, x +1 ], = 0,..., N 1, by te followng expresson c (x) = F R 0,3(x) + G R 1,3(x) + H R 2,3(x) + F +1 R 3,3(x) (1) were G := F + D 3w, H := F +1 D +1 3 λ j B j,3 (x) 3w (wt = x +1 x ) and Rj,3 (x) = j = 0,..., 3 are te ratonal bass functons (x), k=0 λ k B k,3 defned va te postve wegts λ 0 = λ 3 := 1, λ 1 = λ 2 := w and te cubc Bernsten polynomals Bj,3 (x), j = 0,..., 3. Here w s a tenson parameter for te sngle pece c (x),.e., f w, c (x) converges unformly to te lnear nterpolant on [x, x +1 ]. Addtonally, wen all te tenson parameters w, = 0,..., N 1, are ncreased, te ratonal splne c(x) converges unformly to a C 1 pecewse lnear nterpolant; tese pecewse ratonal cubc Bézer functons can be represented as NURBS, tat s on a sngle knot partton wt trple knots, and n te specal case of equal tenson parameters, wt double knots. Note tat, assumng te dervatve values D, = 1,..., N 1, to be degrees of freedom, and computng tem by te mposton of C 2 -contnuty condtons, c(x) C[x 2 0,x N ], see [2,3]. Remark 1. In te parametrc formulaton, ts proposal as te fundamental property tat te curve parameterzaton s good for any coce of te tenson parameters, as tese nfluence bot bass functons and control ponts. Now, wrtng (1) n te equvalent form c (x) = F ϕ 0,3(x) + D ϕ 1,3(x) + D +1 ϕ 2,3(x) + F +1 ϕ 3,3(x), (2)

3 Ratonal Interpolants wt Tenson 43 we can see c (x) as te ratonal cubc Hermte nterpolant, were ϕ 0,3(x) = R0,3(x) + R1,3(x), ϕ 1,3(x) = 3w R1,3(x) ϕ 2,3(x) = 3w R2,3(x), ϕ 3,3(x) = R2,3(x) + R3,3(x) are ratonal cubc Hermte bass functons. Wen w = 1, Rj,3 (x) j = 0,..., 3 become te cubc Bernsten polynomals Bj,3 (x) j = 0,..., 3, ϕ j,3 (x) j = 0,..., 3 become te cubc Hermte bass functons, and c(x) te well-known pecewse cubc Hermte nterpolant. Te latter represents te only tenson metod mplemented n commercal modellng systems. But, wle t requres te cangng of te modulus of te dervatves assgned at te gven nterpolatng ponts n order to aceve tenson effects on te resultng curve, te ratonal pecewse cubc Hermte nterpolatng tecnque we propose allows local/global tenson effects, wtout cangng te gven data set. 3. Bvarate Ratonal Interpolatng Functons wt Tenson In ts secton we ntroduce some metods tat allow us to reconstruct te sngle-valued surface nterpolant of a gven rectangular set of ponts and to modfy te resultng sape, eter locally or globally, usng te so-called tenson parameters Composton of bcubc partally blended tenson patces Te frst metod we present s a transfnte nterpolatng metod. After defnng a network of ratonal cubc Hermte nterpolatng functons, by assumng te values z,j, = 0,..., M, j = 0,..., N, and te frst dervatves f,j x, f y,j, = 0,., M, j = 0,..., N, correspondng to te rectangular grd ponts (x, y j ), = 0,..., M, j = 0,..., N (wt x 0 < x 1 <... < x M and y 0 < y 1 <... < y N ), we suggest blendng te four ntersectng ratonal cubcs formng te boundary of eac ndvdual patc usng te partally bcubc Coons tecnque (see [1]). Defnton 2. Te (, j) t bcubc partally blended Coons patc S,j (x, y), assumng values z,k and dervatves f,k x, f y,k, =, + 1, k = j, j + 1 correspondng to te four corners of te doman [x, x +1 ] [y j, y j+1 ], can be defned by te matrx form: (3) S,j (x, y) = [ 1 ϕ 0,3(x) ϕ 3,3(x) ] 0 S (x,yj ) S (x,yj+1 ) 1 S (x,y) S (x,y j ) S (x,y j+1 ) ϕ j 0,3 (y) (4) S (x+1,y) S (x+1,y j ) S (x+1,y j+1 ) ϕ j 3,3 (y) were w = w j = 1, j so tat ϕ s,3(x) and ϕ j s,3 (y), s = 0, 3 are te cubc Hermte blendng functons and S(x, y j ), S(x, y j+1 ), S(x, y), S(x +1, y)

4 44 G.Cascola and L.Roman denote, te ratonal cubcs wt tenson defned on te sdes of [x, x +1 ] [y j, y j+1 ] usng (2) wt F D D +1 F +1 w S(x, y j ) z,j f x,j f x +1,j z +1,j ω,j S(x, y j+1 ) z,j+1 f x,j+1 f x +1,j+1 z +1,j+1 ω,j+1 S(x, y) z,j f y,j f y,j+1 z,j+1 τ,j S(x +1, y) z +1,j f y +1,j f y +1,j+1 z +1,j+1 τ +1,j. Remark 2. Te composton S(x, y) of te partally blended Coons patces S,j (x, y), = 0,..., M 1, j = 0,..., N 1, nerts all te propertes of te network of boundary curves. Terefore t s caracterzed by a set of M (N +1) tenson parameters ω,j, = 0,..., M 1, j = 0,..., N, n te x drecton and by a set of (M + 1) N tenson parameters τ,j, = 0,..., M, j = 0,..., N 1 n te y drecton, wc ensure local/global tenson effects (see Fg. 1 and Fg. 2 left for examples of local tenson). Proposton 3. Te composton S(x, y) defned above s a C 1 -contnuous degree-seven pecewse ratonal surface wt sape-preservng propertes wen nterpolatng to monotonc and convex data sets. Proof: To prove tat S(x, y) s made of degree-seven ratonal patces, t s suffcent to make te boolean sum form (4) explct; te result mmedatly follows f we note tat a ratonal cubc wt tenson can be smplfed as a cubc over a quadratc (ts s due to te equalty of ts central wegts). Snce te boundary curves are C 1 -contnuous and te blendng functons satsfy te condtons (ϕ s,3) (x ) = (ϕ s,3) (x +1 ) = 0 and (ϕ j s,3 ) (y j ) = (ϕ j s,3 ) (y j+1 ) = 0, s = 0, 3, = 0,..., M 1, j = 0,..., N 1, contnuty of cross-boundary dervatves s automatcally satsfed. Furtermore, from te tenson and sape-preservng propertes of te network of boundary curves (proved n [2,3]), te correspondng tenson and sape-preservng propertes on te transfnte nterpolatng surface S(x, y) trvally follow Composton of bcubcally blended tenson patces Te bcubc partally blended Coons patc defned above s easy to use n a desgn envronment, snce only te four boundary curves are needed. However, a more flexble composte C 1 Coons surface can be developed f, togeter wt te boundary curves, te cross-boundary dervatves, nterpolatng to te tangent vectors and twst vectors assgned n te 2 2 grd ponts, are gven.

5 Ratonal Interpolants wt Tenson 45 Defnton 4. Te (, j) t bcubcally blended surface patc S,j (x, y), = 0,..., M 1, j = 0,..., N 1, assumng te values z,k and te dervatves f,k x, f y,k, f xy,k, n te 2 2 grd ponts (x, y k ), =, + 1, k = j, j + 1, can be defned by te matrx form: S,j (x, y) = [ 1 ϕ 0,3(x) ϕ 3,3(x) ϕ 1,3(x) ϕ 2,3(x) ] (5) 0 S (x,yj ) S (x,yj+1 ) S y (x,y j ) S y (x,y j+1 ) 1 S (x,y) S (x,y j ) S (x,y j+1 ) S y (x,y j ) S y (x,y j+1 ) ϕ j 0,3 (y) S (x+1,y) S (x+1,y j ) S (x+1,y j+1 ) S y (x +1,y j ) S y (x +1,y j+1 ) ϕ j 3,3 S(x x,y) S(x x,y j ) S(x x,y j+1 ) S xy (x,y j ) S xy (y), (x,y j+1 ) ϕ j S(x x +1,y) S(x x +1,y j ) S(x x +1,y j+1 ) S xy (x +1,y j ) S xy 1,3 (y) (x +1,y j+1 ) ϕ j 2,3 (y) were w = w j = 1, j and S(x, y j ), S(x, y j+1 ), S(x, y), S(x +1, y) denote te ratonal cubcs wt tenson defned above, nterpolatng to te corner data and tangent vectors, wle S y (x, y j ), S y (x, y j+1 ), S x (x, y), S x (x +1, y) denote te ratonal cubcs wt tenson nterpolatng to tangent and twst vectors, defned by (2) wt S y (x, y j ) f y,j f xy,j S y (x, y j+1 ) f y,j+1 f xy,j+1 S x (x, y) f x,j f xy,j S x (x +1, y) f x +1,j f xy +1,j F D D +1 F +1 w f xy +1,j f y +1,j ω,j f xy +1,j+1 f y +1,j+1 ω,j+1 f xy,j+1 f,j+1 x τ,j +1,j+1 f+1,j+1 x τ +1,j. f xy Remark 3. As asserted above, te composton S(x, y) of te bcubcally blended Coons patces S,j (x, y), = 0,..., M 1, j = 0,..., N 1 s a degree-seven pecewse ratonal surface, wc nerts all te propertes of te network of boundary curves (see Fg. 3 left, Fg. 4). In ts case, usng a network of C 2 boundary curves, we are able to obtan a C 2 surface. Remark 4. Wle n te prevous metod only two of te cubc Hermte bass functons are used (as te name bcubc partally blended suggests), ts tme, we ave to use all four cubc Hermte blendng functons n bot te coordnate drectons to obtan a patc tat ncorporates crossboundary dervatves as well. Excangng te used cubc Hermte blendng functons wt te four ratonal cubc Hermte polynomals defned n (3), and settng all tenson parameters n x and y drectons, respectvely equal to ŵ and w, we can aceve a global tenson control of te nterpolatng surface n te coordnate drectons (see Fg. 2 rgt).

6 46 G.Cascola and L.Roman 3.3. C 1 -joned tenson patces Te tensor-product surface of te ratonal cubcs wt tenson defned n Secton 2 s not useful because any one of te sape parameters controls te tenson on te entre correspondng strp of te surface. Te two Coons tecnques proposed n Sects. 3.1 and 3.2 can descrbe a muc rcer varety of nterpolatng NURBS surfaces tan do tensor-product surfaces and, addtonally, tey can ensure local tenson effects. However, tey cannot be represented n a bcubc degree NURBS form. Sarfraz s metod [7] (wc seems to be te only one presented n te lterature up to now) can provde an nterpolatory surface wt local tenson propertes, but t cannot be descrbed n a NURBS form because t uses a ratonal bcubc degree representaton wt functonal wegts. Moreover, ts computaton s too tme-consumng to be useful n a geometrc modellng system. Tese consderatons prompted us to look for an alternatve strategy wc could generate a ratonal Hermte nterpolatng C 1 surface, wt a bcubc degree NURBS representaton and a local tenson capablty. Snce a ratonal bcubc C 1 surface, nterpolatng to a gven set of (M + 1) (N + 1) data and dervatve values, can always be vewed as a collecton of M N ratonal C 1 Hermte bcubc patces tat are peced togeter, we are able to stretc a specfed patc of te orgnal surface and, usng te followng condtons, to keep te C 1 -contnuty wt te adjacent patces. Proposton 5. Let S,j (x, y) and S +1,j (x, y) be two degree-(m, n) ratonal Bézer patces respectvely, wt postve wegts {λ,j }, {λ+1,j } and control ponts {c,j }, {c+1,j } k = 0,..., m, l = 0,..., n, defned over te domans [x, x +1 ] [y j, y j+1 ] and [x +1, x +2 ] [y j, y j+1 ]. C 1 suffcent condtons between te two adjacent C 0 -contnuous ratonal patces S,j (x, y) and S +1,j (x, y), along te common boundary S,j (x +1, y), are λ +1,j = x +1 x λ,j k,n 1 + λ,j c +1,j = c,j k,n + x +1 x k,n λ,j 0,n λ,j k,n 1 λ +1,j ( x +1 λ,j x 0,n 1 + λ+1,j 0,1 ), k = 1,..., m, (c,j k,n c,j k,n 1 ), k = 0,..., m, (6) were x = x +1 x and λ +1,j 0,1 s an arbtrary postve constant. Proof: Usng te notaton proposed n [4], C 1 -contnuty between te ratonal patces S,j and S +1,j s equvalent to te condton (D x T +1,j (x, y)) x=x+1 = (D x T,j (x, y)) x=x+1 + σt,j (x +1, y), (7) were T,j (x, y), T +1,j (x, y) represent te omogeneus coordnate systems of te patces S,j (x, y), S +1,j (x, y), respectvely, and D x denotes te frst partal dervatve along te x drecton. Te constant σ s a free

7 Ratonal Interpolants wt Tenson 47 parameter snce we are consderng a ratonal C 1 -contnuty between te two patces S,j and S +1,j, wle te coeffcent of te term D x T,j s fxed equal to 1. Ts derves from consderng te patces n te classcal postonal contnuty C 0 (and not n te ratonal one), wc requres te equalty of wegts and control ponts on te common boundary curve: λ,j k,n = λ +1,j k,0, k = 0,..., m, c,j k,n = c +1,j k,0, k = 0,..., m. (8) Now, followng [4], f we derve te C 1 suffcent condtons between adjacent C 0 -contnuous rectangular ratonal Bézer patces, we obtan, for k = 0,..., m, te explct condtons 1 (λ +1,j x λ,j k,n ) = 1 (λ,j +1 x k,n λ,j k,n 1 ) + σλ,j k,n, 1 (λ +1,j x c +1,j λ,j k,n c,j k,n ) = 1 (λ,j +1 x k,n c,j k,n λ,j k,n 1 c,j k,n 1 ) + σλ,j k,n c,j k,n. Hence, assumng λ +1,j 0,1 = x +1 λ,j x 0,n 1 + (1 + x +1 + σ x x +1 )λ,j 0,n as a free parameter (snce t depends on σ) and, substtutng te resultng expresson for σ n te remanng prevous equatons, we fnd (6). Remark 5. Note tat wen λ,j = λ +1,j = 1 for k = 0,..., m, and l = 0,..., n, σ must be 0. In ts case te patces S,j and S +1,j are non ratonal and condtons (6) become classcal C 1 -contnuty condtons [1]. Snce our am s to be able to stretc a patc of a composton of M N ratonal C 1 Hermte bcubc patces, keepng te nterpolaton and te C 1 -contnuty wt all te patces around, from now on we wll consder condtons (6) wt m = n = 3. Addtonally, snce ratonal bcubc tensor-product surfaces are a well-known class of C 1 -contnuous NURBS surfaces, we focalze an example of our strategy on te Hermte nterpolatng surface S,j (x, y) = 3 3 k=0 l=0 c,j R k,3(x)r j l,3 (y), = 0,..., M 1 j = 0,..., N 1 wt {λ,j } =0,...,3 = [1, ν j, ν j, 1] T [1, µ, µ, 1]. Now, snce te tenson parameters µ, = 0,..., M 1 and ν j, j = 0,..., N 1 nfluence te entre strps [x, x +1 ] [y 0, y N ], = 0,..., M 1 and [x 0, x M ] [y j, y j+1 ], j = 0,..., N 1, respectvely, n order to obtan a local tenson control on a specfed ratonal Hermte patc S,j (x, y), we defne two new tenson parameters µ, ν j on te sdes of ts rectangular boundary. Ten we recompute te patc S,j (x, y) as a tensor-product, and explot te degree of freedom caracterzng condtons (6), to adjust te wegts and control ponts of te frst rng of egt patces contaned n te negbourood of

8 48 G.Cascola and L.Roman S,j, n order to mantan C 1 -contnuty. If we consder (for smplcty of presentaton) x = x +1, as, n our case, λ,j 0,3 = λ,j 3,3 = 1, C1 -contnuty condtons (6) assume te smplfed expressons λ +1,j = λ,j k,2 + λ,j k,3 (µ + λ +1,j 0,1 ), k = 1,..., 3, k,3 + λ,j k,2 (c,j k,3 c,j k,2 ), k = 0,..., 3, (9) c +1,j = c,j λ +1,j were λ +1,j 0,1 s taken as equal to µ + µ +1 µ. Ten, f after takng te boundary wegts λ +1,j = λ,j k,2 +λ,j k,3 (µ +µ +1 ), k = 1,..., 3, we repeat ts computaton n te drectons ( 1, j), (, j 1), (, j + 1), adjustng te wegt λ +1,j+1 1,1 as te product of λ +1,j 3,1 by λ,j+1 1,3, and te oter tree corner wegts λ 1,j+1 1,2, λ 1,j 1 2,2, λ +1,j 1 2,1 n te same way, te frst condton (9) s automatcally satsfed for eac patc around te (, j) t. Afterwards, by computng te correspondng control ponts accordng to te second condton (9), we are able to keep te C 1 -contnuty of te surface, even f we ave modfed te wegts of te (, j) t patc, causng a tenson on t (see Fg. 3 rgt). 4. Conclusons Te ratonal cubc nterpolatng metod proposed n [2,3] as been converted nto standard NURBS form and appled to obtan sape control on rectangular NURBS Hermte nterpolatory surfaces. Usng te tecnques descrbed, we ave obtaned a number of dfferent ways of acevng sape control on tese knds of surfaces, always mantanng C 1 -contnuty. In fact, comparng te followng fgures wt Fg. 1 left (wc was bult wt global values ω := ω,j = 1, j, τ := τ,j = 1, j), we can see tat t s possble to apply tenson: along a curve segment, causng te segment to tend to a stragt lne by ncreasng sape parameter ω,j for a specfed couple of ndces, j (Fg. 1 rgt, were ω 3,4 = 4); along a network curve, causng te wole curve to tend to a polygon by ncreasng sape parameters ω 0,j,..., ω M 1,j for one j {0,..., N} (Fg. 2 left sows ts for ω 0,4 = = ω 5,4 = 4); along x drecton (Fg. 2 rgt corresponds to te blendng tenson parameters ŵ = 4, w = 1); on a sngle patc. Ts s done by applyng bot nterval tensons at ts four sdes (Fg. 3 left represents te bcubcally blended tenson metod wt parameters (4,4), wle Fg. 3 rgt te ratonal bcubc tensor-product wt global parameters (2,2), were te C 1 -jon tecnque as been appled wt parameters µ 3 = ν 3 = 3); on te wole surface (Fg. 4 left sows ts for te global value ω := ω,j = 4,, j, τ := τ,j = 4, j);

9 Ratonal Interpolants wt Tenson 49 Fg. 1. left: no tenson - rgt: tenson along S([x 3, x 4 ], y 4 ). Fg. 2. left: tenson along S(x, y 4 ) - rgt: tenson along x drecton. Fg. 3. left: tenson on patc S 3,3 - rgt: tenson on patc S 3,3. everywere except on a specfed patc (Fg. 4 rgt sows ts usng a global tenson (4,4) and a local tenson (1,1) on patc S 3,3 ). 5. Future Work We ntend to extend tese metods to te parametrc case n order to be able to apply te ratonal G 1 -contnuty condtons (nstead of te C 1 - contnuty ntroduced n 3.3) wc wll gve us extra degrees of freedom.

10 50 G.Cascola and L.Roman Fg. 4. left: global tenson - rgt: global tenson except on patc S 3,3. Acknowledgments. Ts researc was supported by MURST, Cofn2000, and by Unversty of Bologna Funds for selected researc topcs. References 1. Farn, G., Curves and Surfaces for CAGD, Fft Edton, Academc Press Gregory, J. A., Sape preservng splne nterpolaton, Computer Aded Desgn 18 (1986), Gregory, J. A., and M. Sarfraz, A ratonal cubc splne wt tenson, Computer Aded Geometrc Desgn 7 (1990), Lu, D., GC 1 Contnuty condtons between two adjacent ratonal Bézer surface patces, Computer Aded Geometrc Desgn 7 (1990), Nelson, G. M., Some pecewse polynomal alternatves to splnes under tenson, n Computer Aded Geometrc Desgn, R. E. Barnll, R. F. Resenfeld (ed.), Academc Press, 1974, Nelson, G. M., Rectangular ν-splnes, IEEE Computer Grapcs & Applcatons, (feb. 1986), Sarfraz, M., Desgnng of curves and surfaces usng ratonal cubcs, Computer & Grapcs 17 (1993), Gulo Cascola Dep. of Matematcs - Unversty of Bologna P.zza d P. S.Donato 5, Bologna, Italy cascola@dm.unbo.t Luca Roman Dep. of Pure and Appled Matematcs - Unversty of Padova Va G. Belzon 7, Padova, Italy roman@dm.unbo.t

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

A Newton-Type Method for Constrained Least-Squares Data-Fitting with Easy-to-Control Rational Curves

A Newton-Type Method for Constrained Least-Squares Data-Fitting with Easy-to-Control Rational Curves A Newton-Type Method for Constraned Least-Squares Data-Fttng wth Easy-to-Control Ratonal Curves G. Cascola a, L. Roman b, a Department of Mathematcs, Unversty of Bologna, P.zza d Porta San Donato 5, 4017

More information

Shape Preserving Positive and Convex Data Visualization using Rational Bi-cubic Functions

Shape Preserving Positive and Convex Data Visualization using Rational Bi-cubic Functions Shape Preservng Postve and Conve Data Vsualzaton usng Ratonal B-cubc unctons Muhammad Sarfraz Malk Zawwar Hussan 3 Tahra Sumbal Shakh Department of Informaton Scence Adala Campus Kuwat Unverst Kuwat E-mal:

More information

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme Mathematcal and Computatonal Applcatons Artcle A Fve-Pont Subdvson Scheme wth Two Parameters and a Four-Pont Shape-Preservng Scheme Jeqng Tan,2, Bo Wang, * and Jun Sh School of Mathematcs, Hefe Unversty

More information

Interpolation of the Irregular Curve Network of Ship Hull Form Using Subdivision Surfaces

Interpolation of the Irregular Curve Network of Ship Hull Form Using Subdivision Surfaces 7 Interpolaton of the Irregular Curve Network of Shp Hull Form Usng Subdvson Surfaces Kyu-Yeul Lee, Doo-Yeoun Cho and Tae-Wan Km Seoul Natonal Unversty, kylee@snu.ac.kr,whendus@snu.ac.kr,taewan}@snu.ac.kr

More information

Shape Control of the Cubic Trigonometric B-Spline Polynomial Curve with A Shape Parameter

Shape Control of the Cubic Trigonometric B-Spline Polynomial Curve with A Shape Parameter Internatonal Journal of Scences & Appled esearch www.jsar.n Shape Control of the Cubc Trgonometrc B-Splne Polynomal Curve wth A Shape Parameter Urvash Mshra* Department of Mathematcs, Mata Gujr Mahla Mahavdyalaya,

More information

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

More information

Interpolatory Subdivision Curves with Local Shape Control

Interpolatory Subdivision Curves with Local Shape Control Interpolatory Subdvson Curves wth Local Shape Control Carolna Beccar Dept. of Mathematcs Unversty of Padova va G.Belzon 7, 35131 Padova, Italy beccar@math.unpd.t Gulo Cascola Dept. of Mathematcs Unversty

More information

Research Article Quasi-Bézier Curves with Shape Parameters

Research Article Quasi-Bézier Curves with Shape Parameters Hndaw Publshng Corporaton Appled Mathematcs Volume 3, Artcle ID 739, 9 pages http://dxdoorg/55/3/739 Research Artcle Quas-Bézer Curves wth Shape Parameters Jun Chen Faculty of Scence, Nngbo Unversty of

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

Priority queues and heaps Professors Clark F. Olson and Carol Zander

Priority queues and heaps Professors Clark F. Olson and Carol Zander Prorty queues and eaps Professors Clark F. Olson and Carol Zander Prorty queues A common abstract data type (ADT) n computer scence s te prorty queue. As you mgt expect from te name, eac tem n te prorty

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Prof. Feng Liu. Spring /24/2017

Prof. Feng Liu. Spring /24/2017 Prof. Feng Lu Sprng 2017 ttp://www.cs.pd.edu/~flu/courses/cs510/ 05/24/2017 Last me Compostng and Mattng 2 oday Vdeo Stablzaton Vdeo stablzaton ppelne 3 Orson Welles, ouc of Evl, 1958 4 Images courtesy

More information

Reading. 14. Subdivision curves. Recommended:

Reading. 14. Subdivision curves. Recommended: eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.-6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton

More information

Investigations of Topology and Shape of Multi-material Optimum Design of Structures

Investigations of Topology and Shape of Multi-material Optimum Design of Structures Advanced Scence and Tecnology Letters Vol.141 (GST 2016), pp.241-245 ttp://dx.do.org/10.14257/astl.2016.141.52 Investgatons of Topology and Sape of Mult-materal Optmum Desgn of Structures Quoc Hoan Doan

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

Modelling of curves and surfaces in polar. and Cartesian coordinates. G.Casciola and S.Morigi. Department of Mathematics, University of Bologna, Italy

Modelling of curves and surfaces in polar. and Cartesian coordinates. G.Casciola and S.Morigi. Department of Mathematics, University of Bologna, Italy Modellng of curves and surfaces n polar and Cartesan coordnates G.Cascola and S.Morg Department of Mathematcs, Unversty of Bologna, Italy Abstract A new class of splne curves n polar coordnates has been

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

Wavefront Reconstructor

Wavefront Reconstructor A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes

More information

Vectorization of Image Outlines Using Rational Spline and Genetic Algorithm

Vectorization of Image Outlines Using Rational Spline and Genetic Algorithm 01 Internatonal Conference on Image, Vson and Computng (ICIVC 01) IPCSIT vol. 50 (01) (01) IACSIT Press, Sngapore DOI: 10.776/IPCSIT.01.V50.4 Vectorzaton of Image Outlnes Usng Ratonal Splne and Genetc

More information

Machine Learning. K-means Algorithm

Machine Learning. K-means Algorithm Macne Learnng CS 6375 --- Sprng 2015 Gaussan Mture Model GMM pectaton Mamzaton M Acknowledgement: some sldes adopted from Crstoper Bsop Vncent Ng. 1 K-means Algortm Specal case of M Goal: represent a data

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

A Geometric Approach for Multi-Degree Spline

A Geometric Approach for Multi-Degree Spline L X, Huang ZJ, Lu Z. A geometrc approach for mult-degree splne. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 27(4): 84 850 July 202. DOI 0.007/s390-02-268-2 A Geometrc Approach for Mult-Degree Splne Xn L

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

More information

Cubic Spline Interpolation for. Petroleum Engineering Data

Cubic Spline Interpolation for. Petroleum Engineering Data Appled Mathematcal Scences, Vol. 8, 014, no. 10, 5083-5098 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.1988/ams.014.4484 Cubc Splne Interpolaton for Petroleum Engneerng Data * Samsul Arffn Abdul Karm

More information

ON THE ONE METHOD OF A THIRD-DEGREE BEZIER TYPE SPLINE CURVE CONSTRUCTION

ON THE ONE METHOD OF A THIRD-DEGREE BEZIER TYPE SPLINE CURVE CONSTRUCTION ON THE ONE METHOD O A THIRD-DEGREE EZIER TYPE PLINE URVE ONTRUTION tela O Potapenko L renko I aculty o omputer cences and ybernetcs Taras evcenko Natonal Unversty o Kyv Kyv Ukrane olegstelya@gmalcom lpotapenko@ukrnet

More information

Constructing G 2 Continuous Curve on Freeform Surface with Normal Projection

Constructing G 2 Continuous Curve on Freeform Surface with Normal Projection Chnese Journal of Aeronautcs 3(010 137-144 Chnese Journal of Aeronautcs www.elsever.com/locate/cja Constructng G Contnuous Curve on Freeform Surface wth Normal Projecton Wang Xaopng*, An Lulng, Zhou Lashu,

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

1 Linear and Nonlinear Subdivision Schemes in Geometric Modeling

1 Linear and Nonlinear Subdivision Schemes in Geometric Modeling 1 Lnear and Nonlnear Subdvson Schemes n Geometrc Modelng Nra dyn School of Mathematcal Scences Tel Avv Unversty Tel Avv, Israel e-mal: nradyn@post.tau.ac.l Abstract Subdvson schemes are effcent computatonal

More information

Lecture #15 Lecture Notes

Lecture #15 Lecture Notes Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

A new paradigm of fuzzy control point in space curve

A new paradigm of fuzzy control point in space curve MATEMATIKA, 2016, Volume 32, Number 2, 153 159 c Penerbt UTM Press All rghts reserved A new paradgm of fuzzy control pont n space curve 1 Abd Fatah Wahab, 2 Mohd Sallehuddn Husan and 3 Mohammad Izat Emr

More information

Electrical analysis of light-weight, triangular weave reflector antennas

Electrical analysis of light-weight, triangular weave reflector antennas Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna

More information

The AVL Balance Condition. CSE 326: Data Structures. AVL Trees. The AVL Tree Data Structure. Is this an AVL Tree? Height of an AVL Tree

The AVL Balance Condition. CSE 326: Data Structures. AVL Trees. The AVL Tree Data Structure. Is this an AVL Tree? Height of an AVL Tree CSE : Data Structures AL Trees Neva Cernavsy Summer Te AL Balance Condton AL balance property: Left and rgt subtrees of every node ave egts dfferng by at most Ensures small dept ll prove ts by sowng tat

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

Math Homotopy Theory Additional notes

Math Homotopy Theory Additional notes Math 527 - Homotopy Theory Addtonal notes Martn Frankland February 4, 2013 The category Top s not Cartesan closed. problem. In these notes, we explan how to remedy that 1 Compactly generated spaces Ths

More information

In the planar case, one possibility to create a high quality. curve that interpolates a given set of points is to use a clothoid spline,

In the planar case, one possibility to create a high quality. curve that interpolates a given set of points is to use a clothoid spline, Dscrete Farng of Curves and Surfaces Based on Lnear Curvature Dstrbuton R. Schneder and L. Kobbelt Abstract. In the planar case, one possblty to create a hgh qualty curve that nterpolates a gven set of

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

Harmonic Coordinates for Character Articulation PIXAR

Harmonic Coordinates for Character Articulation PIXAR Harmonc Coordnates for Character Artculaton PIXAR Pushkar Josh Mark Meyer Tony DeRose Bran Green Tom Sanock We have a complex source mesh nsde of a smpler cage mesh We want vertex deformatons appled to

More information

Computer Graphics. - Spline and Subdivision Surfaces - Hendrik Lensch. Computer Graphics WS07/08 Spline & Subdivision Surfaces

Computer Graphics. - Spline and Subdivision Surfaces - Hendrik Lensch. Computer Graphics WS07/08 Spline & Subdivision Surfaces Computer Graphcs - Splne and Subdvson Surfaces - Hendrk Lensch Overvew Last Tme Image-Based Renderng Today Parametrc Curves Lagrange Interpolaton Hermte Splnes Bezer Splnes DeCasteljau Algorthm Parameterzaton

More information

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Accounting for the Use of Different Length Scale Factors in x, y and z Directions 1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

American International Journal of Research in Science, Technology, Engineering & Mathematics

American International Journal of Research in Science, Technology, Engineering & Mathematics Amercan Internatonal Journal of Research n Scence, Technology, Engneerng & Mathematcs Avalable onlne at http://.asr.net ISSN (Prnt): 8-9, ISSN (Onlne): 8-8, ISSN (CD-ROM): 8-69 AIJRSTEM s a refereed, ndexed,

More information

Modeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach

Modeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach Modelng, Manpulatng, and Vsualzng Contnuous Volumetrc Data: A Novel Splne-based Approach Jng Hua Center for Vsual Computng, Department of Computer Scence SUNY at Stony Brook Talk Outlne Introducton and

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

Dimensions of spline spaces over non-rectangular T-meshes

Dimensions of spline spaces over non-rectangular T-meshes Adv Comput Math DOI 0.007/s0444-06-946-4 Dmensons of splne spaces over non-rectangular T-meshes Chao Zeng Meng Wu 2 Fang Deng Jansong Deng Receved: 23 July 205 / Accepted: 9 Aprl 206 Sprnger Scence+Busness

More information

Curve Representation for Outlines of Planar Images using Multilevel Coordinate Search

Curve Representation for Outlines of Planar Images using Multilevel Coordinate Search Curve Representaton for Outlnes of Planar Images usng Multlevel Coordnate Search MHAMMAD SARFRAZ and NAELAH AL-DABBOUS Department of Informaton Scence Kuwat Unversty Adalya Campus, P.O. Box 5969, Safat

More information

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume

More information

Concurrent models of computation for embedded software

Concurrent models of computation for embedded software Concurrent models of computaton for embedded software and hardware! Researcher overvew what t looks lke semantcs what t means and how t relates desgnng an actor language actor propertes and how to represent

More information

Cordial and 3-Equitable Labeling for Some Star Related Graphs

Cordial and 3-Equitable Labeling for Some Star Related Graphs Internatonal Mathematcal Forum, 4, 009, no. 31, 1543-1553 Cordal and 3-Equtable Labelng for Some Star Related Graphs S. K. Vadya Department of Mathematcs, Saurashtra Unversty Rajkot - 360005, Gujarat,

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton

More information

Topology Design using LS-TaSC Version 2 and LS-DYNA

Topology Design using LS-TaSC Version 2 and LS-DYNA Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On Some Entertaining Applications of the Concept of Set in Computer Science Course On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,

More information

Multiblock method for database generation in finite element programs

Multiblock method for database generation in finite element programs Proc. of the 9th WSEAS Int. Conf. on Mathematcal Methods and Computatonal Technques n Electrcal Engneerng, Arcachon, October 13-15, 2007 53 Multblock method for database generaton n fnte element programs

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

An Improved Isogeometric Analysis Using the Lagrange Multiplier Method

An Improved Isogeometric Analysis Using the Lagrange Multiplier Method An Improved Isogeometrc Analyss Usng the Lagrange Mltpler Method N. Valzadeh 1, S. Sh. Ghorash 2, S. Mohammad 3, S. Shojaee 1, H. Ghasemzadeh 2 1 Department of Cvl Engneerng, Unversty of Kerman, Kerman,

More information

KFUPM. SE301: Numerical Methods Topic 8 Ordinary Differential Equations (ODEs) Lecture (Term 101) Section 04. Read

KFUPM. SE301: Numerical Methods Topic 8 Ordinary Differential Equations (ODEs) Lecture (Term 101) Section 04. Read SE3: Numercal Metods Topc 8 Ordnar Dfferental Equatons ODEs Lecture 8-36 KFUPM Term Secton 4 Read 5.-5.4 6-7- C ISE3_Topc8L Outlne of Topc 8 Lesson : Introducton to ODEs Lesson : Talor seres metods Lesson

More information

A Unified, Integral Construction For Coordinates Over Closed Curves

A Unified, Integral Construction For Coordinates Over Closed Curves A Unfed, Integral Constructon For Coordnates Over Closed Curves Schaefer S., Ju T. and Warren J. Abstract We propose a smple generalzaton of Shephard s nterpolaton to pecewse smooth, convex closed curves

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

Intra-Parametric Analysis of a Fuzzy MOLP

Intra-Parametric Analysis of a Fuzzy MOLP Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral

More information

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and

More information

Using Radial Basis Functions to Solve Geodesics Equations for Body Measurements *

Using Radial Basis Functions to Solve Geodesics Equations for Body Measurements * 7659, England, UK Journal of Informaton and Computng Scence Vol. 2, No. 2, 2007, pp. 119-126 Usng Radal Bass Functons to Solve Geodescs Equatons for Body Measurements * R. Ng 1+, G.T.Y. Pong 2 and M. Wong

More information

Kinematics of pantograph masts

Kinematics of pantograph masts Abstract Spacecraft Mechansms Group, ISRO Satellte Centre, Arport Road, Bangalore 560 07, Emal:bpn@sac.ernet.n Flght Dynamcs Dvson, ISRO Satellte Centre, Arport Road, Bangalore 560 07 Emal:pandyan@sac.ernet.n

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

Algorithm for directional projection of parametric curves onto B-spline surfaces

Algorithm for directional projection of parametric curves onto B-spline surfaces Algorthm for drectonal projecton of parametrc curves onto B-splne surfaces Ha-Chuan Song, Jun-Ha Yong To cte ths verson: Ha-Chuan Song, Jun-Ha Yong. Algorthm for drectonal projecton of parametrc curves

More information

Classification / Regression Support Vector Machines

Classification / Regression Support Vector Machines Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM

More information

Constrained Shape Modification of B-Spline curves

Constrained Shape Modification of B-Spline curves Constraned Shape Modfcaton of B-Splne curves Mukul Tul, N. Venkata Reddy and Anupam Saxena Indan Insttute of Technology Kanpur, mukult@tk.ac.n, nvr@tk.ac.n, anupams@tk.ac.n ABSTRACT Ths paper proposes

More information

Review on the Curves and Surfaces Modeling Technology

Review on the Curves and Surfaces Modeling Technology IOSR Journal of Mechancal and Cvl Engneerng (IOSR-JMCE) e-issn: 78-1684,p-ISSN: 30-334X, Volume 15, Issue 6 Ver. II (Nov. - Dec. 018), PP 01-05 www.osrjournals.org WuYze 1, Zhang Xu 1, Qu Kangjan 1, Chen

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

A NOTE ON FUZZY CLOSURE OF A FUZZY SET

A NOTE ON FUZZY CLOSURE OF A FUZZY SET (JPMNT) Journal of Process Management New Technologes, Internatonal A NOTE ON FUZZY CLOSURE OF A FUZZY SET Bhmraj Basumatary Department of Mathematcal Scences, Bodoland Unversty, Kokrajhar, Assam, Inda,

More information

Barycentric Coordinates. From: Mean Value Coordinates for Closed Triangular Meshes by Ju et al.

Barycentric Coordinates. From: Mean Value Coordinates for Closed Triangular Meshes by Ju et al. Barycentrc Coordnates From: Mean Value Coordnates for Closed Trangular Meshes by Ju et al. Motvaton Data nterpolaton from the vertces of a boundary polygon to ts nteror Boundary value problems Shadng Space

More information

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

More information

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? Célne GALLET ENSICA 1 place Emle Bloun 31056 TOULOUSE CEDEX e-mal :cgallet@ensca.fr Jean Luc LACOME DYNALIS Immeuble AEROPOLE - Bat 1 5, Avenue Albert

More information

a tree-dmensonal settng. In te presented approac, we construct te ne mes by renng an exstng coarse mes and updatng te nodes of te ne mes accordng to t

a tree-dmensonal settng. In te presented approac, we construct te ne mes by renng an exstng coarse mes and updatng te nodes of te ne mes accordng to t Parallel Two-Level Metods for Tree-Dmensonal Transonc Compressble Flow Smulatons on Unstructured Meses R. Atbayev a, X.-C. Ca a, and M. Parascvou b a Department of Computer Scence, Unversty of Colorado,

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

Smooth Approximation to Surface Meshes of Arbitrary Topology with Locally Blended Radial Basis Functions

Smooth Approximation to Surface Meshes of Arbitrary Topology with Locally Blended Radial Basis Functions 587 Smooth Approxmaton to Surface eshes of Arbtrary Topology wth Locally Blended Radal Bass Functons ngyong Pang 1,, Weyn a 1, Zhgeng Pan and Fuyan Zhang 1 Cty Unversty of Hong Kong, mewma@ctyu.edu.hk

More information

CHARUTAR VIDYA MANDAL S SEMCOM Vallabh Vidyanagar

CHARUTAR VIDYA MANDAL S SEMCOM Vallabh Vidyanagar CHARUTAR VIDYA MANDAL S SEMCOM Vallabh Vdyanagar Faculty Name: Am D. Trved Class: SYBCA Subject: US03CBCA03 (Advanced Data & Fle Structure) *UNIT 1 (ARRAYS AND TREES) **INTRODUCTION TO ARRAYS If we want

More information

Mathematical Model for Motion Control of Redundant Robot Arms

Mathematical Model for Motion Control of Redundant Robot Arms Mathematcal Model for Moton Control of Redundant Robot Arms EVGENIY KRASTEV Department of Mathematcs and Informatcs Sofa Unversty St. Klment Ohrdsky 5, James Boucher blvd., 1164 Sofa BULGARIA eck@fm.un-sofa.bg

More information

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL) Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,

More information

THE PULL-PUSH ALGORITHM REVISITED

THE PULL-PUSH ALGORITHM REVISITED THE PULL-PUSH ALGORITHM REVISITED Improvements, Computaton of Pont Denstes, and GPU Implementaton Martn Kraus Computer Graphcs & Vsualzaton Group, Technsche Unverstät München, Boltzmannstraße 3, 85748

More information

Line geometry, according to the principles of Grassmann s theory of extensions. By E. Müller in Vienna.

Line geometry, according to the principles of Grassmann s theory of extensions. By E. Müller in Vienna. De Lnengeometre nach den Prnzpen der Grassmanschen Ausdehnungslehre, Monastshefte f. Mathematk u. Physk, II (89), 67-90. Lne geometry, accordng to the prncples of Grassmann s theory of extensons. By E.

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information