A study on the mask of interpolatory symmetric subdivision schemes

Size: px
Start display at page:

Download "A study on the mask of interpolatory symmetric subdivision schemes"

Transcription

1 Appled Mathematcs and Computaton 87 (007) A study on the mask of nterpolatory symmetrc subdvson schemes Kwan Pyo Ko a, Byung-Gook Lee a, Gang Joon Yoon b, * a Dvson of Computer and Informaton Engneerng, Dongseo Unversty, Busan 67-76, South Korea b School of Mathematcs, Korea Insttute for Advanced Study, Cheongnyangn dong, Dongdaemun-gu, Seoul 30-7, South Korea Abstract In the work, we rebuld the masks of well-known nterpolatory symmetrc subdvson schemes-bnary n-pont nterpolatory schemes, the ternary 4-pont nterpolatory scheme usng only the symmetry and the necessary condton for smoothness and the butterfly scheme, and the modfed butterfly scheme usng the factorzaton property. Ó 006 Elsever Inc. All rghts reserved. Keywords: Mask; Interpolatory symmetrc subdvson scheme; Ternary scheme; The butterfly scheme. Introducton Subdvson schemes are a very effcent tool for the fast constructon of smooth curves and surfaces from a set of control ponts through teratve refnements. In recent years, subdvson schemes became one of the most popular methods of creatng curves and surfaces n computer aded geometrc desgn (CAGD) and n the anmaton ndustry. Now, they have become a subect of study n ther own rght wth a varety of applcaton to computer graphcs, geometrc modelng and wavelets. Furthermore, schemes have been appled to solve problems n flud flow. Ther popularty s due to the facts that subdvson algorthms are smple to apprehend, sutable for computer applcatons, easy to mplement. Also, the subect of subdvson schemes has an nterdscplnary relaton to wavelet, whch has brought on recprocal mprovement n both the areas. Each subdvson scheme s assocated wth a mask a ¼fa a R : a Z s g, where s = n the curve case and s = n the surface case. The (statonary) subdvson scheme s a process whch recursvely defnes a sequence of control ponts ¼f a : a Zs g by a rule of the form wth a mask a ¼fa g Z s a ¼ a a Mb b ; k f0; ; ;...g; bz s whch s denoted formally by + = S. Then a pont of + s defned by a fnte affne combnaton of ponts n. Here M s an s s nteger matrx such that lm n! M n = 0. The matrx M s called a dlaton * Correspondng author. E-mal addresses: kpko@dongseo.ac.kr (K.P. Ko), lbg@dongseo.ac.kr (B.-G. Lee), yk@kas.re.kr (G.J. Yoon) /$ - see front matter Ó 006 Elsever Inc. All rghts reserved. do:0.06/.amc

2 60 K.P. Ko et al. / Appled Mathematcs and Computaton 87 (007) matrx. Bnary (or dyadc) and ternary subdvson schemes are schemes wth the matrces M =I and M =3I, respectvely, for the s s dentty matrx I. Among subdvson schemes, an nterpolatory subdvson s more ntutve because t preserves the data obtaned at the former stage and refnes new data by nsertng values correspondng to ntermedate ponts. The nserted values are determned by lnear combnatons of values at the neghborng ponts. An nterpolatory symmetrc bnary scheme s one of the most popular subdvson schemes n ther applcatons. Ths results n ts smplcty to use and the tendency that customers feel comfortable for symmetrc obects. Despte ts smplcty, an nterpolatory bnary subdvson scheme has the drawback that n order to create smoother curves or surfaces, t s necessary to enlarge the support of the mask. It s well-known, n general, that the creaton of hghly smooth curves or surfaces n a subdvson scheme and the shortness of the support sze of ts mask are two mutually conflctng requrements, n spte that desgners n CAGD requre subdvson schemes to have ther masks wth a possbly smaller support and to create good smooth curves or surfaces. For example, t was proved n [8] that there s no C nterpolatory bnary subdvson scheme wth a mask supported on [ 3,3] s. There are two approaches to acheve a desred mask: one s to enlarge the sze of the support so that we may allow free parameters n the mask; the other s to fx the sze and fnd specfc values of the mask. There s no unque method of obtanng a mask. Deslaurers and Dubuc [] obtaned the mask of n-pont nterpolatory subdvson rule by polynomal reproducng property. Dyn [3] commented that we can get the mask of 4-pont and 6-pont schemes wth a one parameter by takng a convex combnaton of the two Deslaurers and Dubuc schemes. In the work, we try to fnd smoother possble masks wth the sze fxed by applyng repeatedly some smoothness condtons. Then, we rebuld the masks of nterpolatory symmetrc subdvson schemesbnary n-pont nterpolatory schemes, ternary 4-pont nterpolatory scheme-n Sectons 3 and 4. In Secton 5, we study the butterfly scheme and we observe that n ts stencl, the sums of even masks and odd masks along every vertcal or horzontal lne are the same, whch nduces a factorzaton of the correspondng Laurent polynomal (see Theorem 5). By applyng the observaton, we show that from the same structure of the stencl used n the butterfly scheme, we can obtan the mask of the scheme and the modfed butterfly schemes, as well.. Prelmnares Throughout the work, we consder schemes wth a mask of fnte support. That s, the set f Z s : a 6¼ 0g s fnte. Ths property s useful n the practcal mplementaton because changes n a control pont affect only ts local neghborhood. In ths secton, we consder a subdvson scheme S wth a mask a and a dlaton matrx M. We denote by / 0 the tensor product of the symmetrc hat functon n R s defned by / 0 ðxþ :¼ Ys B ðx Þ for ðx ;...; x s ÞR s ; ðþ ¼ where B s the B-splne of degree (order ) gven as 8 >< þ x; for x ½ ; 0Þ; B ðxþ ¼ x; for x ½0; Š; >: 0; for x R n½ ; Š: The subdvson operator S assocated wth a mask a and a dlaton matrx M s the lnear operator on the space ðz s Þ of all sequences on Z s defned by SvðaÞ :¼ bz s a a Mb vðbþ; v ðz s Þ: Defnton. A subdvson scheme S wth a mask a and a dlaton matrx M converges unformly f for every sequence f 0 ¼ðf 0 a Þ az s wth compact support, there exsts a functon f CðRs Þ such that

3 lm S n f 0 n! a / 0ðM n aþ f ¼ 0; az s where / 0 s the unt hat functon gven n (). And for some sequence, the above functon f s not dentcally zero. The functon f s denoted by S f 0. A unformly subdvson scheme s sad to be C m f for any ntal data the lmt functon has contnuous dervatves up to order m. Let E be a complete set of representatves of the dstnct cosets of Z s =MZ s. Then Z s s the dsont unon of c þ MZ s, c E. Also, t s not dffcult to see that the set fm n a : a Z s, n Ng s dense n R s. Theorem. Let S be a subdvson scheme wth a mask a and a dlaton matrx M. If S converges unformly, then for every c E, we have a c Ma ¼ : ðþ az s Proof. Let f 0 be an ntal data such that S f 0 5 0, and let c E be arbtrarly fxed. From () and Defnton, we can see that lm n! sup az s S n f 0 ðaþ f ðm n aþ ¼ 0: K.P. Ko et al. / Appled Mathematcs and Computaton 87 (007) By the contnuty of f, there are a Z s and m N such that f(m m a) 5 0. For n P max(m,n), we have that S n f 0 ðm n m a þ cþ ¼ bz s a M n m aþc MbS n f 0 ðbþ ¼ bz s a Mbþc S n f 0 ðm n m a bþ: Wth the equaton above, we nduce that f ðm m a þ M n cþ bz s a Mbþc f ðm m a M nþ bþ ¼ f ðm m a þ M n cþ S n f 0 ðm n m a þ cþþ bz s a Mbþc ðs n f 0 ðm n m a bþ f ðm m a M nþ bþþ: On the other hand, snce the support of the mask a s fnte, we can exchange the lmt and the summaton as we take n!. Hence, by the unform convergence of S and the contnuty of f, we obtan that f ðm m aþ¼ bz s a cþmb f ðm m aþ: Snce f(m m a) 5 0, we have, as a consequence, that a cþmb ¼ ; c E: bz s For the case when M s two tmes the s s dentty matrx, Theorem was proved by Cavaretta et al. [], and Dyn [5]. Han and Ja [9] showed that the condton n () wth P az sa a ¼detðMÞ s necessary for the subdvson scheme to converge n the L p -norm. 3. Bnary n-pont nterpolatory symmetrc subdvson scheme A bnary unvarate subdvson scheme s defned n terms of a mask consstng of a sequence of coeffcents a ¼fa : Zg, that s, a unvarate scheme wth a dlaton matrx M =. The scheme s gven by ¼ Z a ; Z:

4 6 K.P. Ko et al. / Appled Mathematcs and Computaton 87 (007) For each scheme S wth a mask a, we defne the symbol aðzþ ¼ a a z a : az The correspondng symbols, called Laurent polynomals, play a effcent role n analyzng the smoothness of a subdvson scheme. Interpolatory subdvson schemes retan the ponts of stage k as a subset of the ponts of stage k +. Thus, the general form of an nterpolatory subdvson scheme s ; þ ¼ a þ : Z From Theorem, we can see that a ¼ a þ ¼ ð3þ and the Laurent polynomal of a convergent subdvson scheme satsfes að Þ ¼0 and aðþ ¼: ð4þ Ths condton guarantees the exstence of a related subdvson scheme for the dvded dfferences of the orgnal control ponts and the exstence of assocated Laurent polynomal a (z) whch can be defned as follows: a ðzþ ¼ z ð þ zþ aðzþ: ð5þ The subdvson S wth symbol a (z) s related to S wth a(z) by the followng theorem. Theorem [5]. Let S denote a subdvson scheme wth symbol a(z) satsfyng (3). Then there exst a subdvson scheme S wth the property d ¼ S d ; where =S k f 0 and d ¼fðd Þ ¼ k ðfþ k f k Þ : Zg. Furthermore, S s a unformly convergent subdvson scheme f and only f S converges unformly to the zero functon for all ntal data f 0 n the sense that k lm k! S f 0 ¼ 0: ð6þ A scheme S satsfyng (6) for all ntal data f 0 s sad to be contractve. ByTheorem, the check of the convergence of S s equvalent to checkng whether S s contractve, whch s equvalent to checkng whether there exsts an nteger L > 0 such that the operator of L teratons of S satsfes k S L k <. Here, how to compute the norm os L k? From the refnement rule of S (two refnement rules) ¼ a ; we have k k 6! a max k k and we can calculate the norm of S: ( ) ksk ¼ max a ; a þ : We defne generatng functon of control pont as F k ðzþ ¼ z :

5 Snce the coeffcent of z n F k+ (z) s and the coeffcent of z n a(z)f k (z )s P a, we have F kþ ðzþ ¼aðzÞF k ðz Þ: Let a ½LŠ ðzþ ¼ Q L ¼0 aðz Þ¼ P a½lš z, F kþl ðzþ ¼ P f kþl z and well-known fact F kþl ðzþ ¼a ½LŠ ðzþf k ðz L Þ, we have the L refnement rules þl ¼ and norm of S L : ( ) ks L k ¼ max a ½LŠ L L : a ½LŠ L K.P. Ko et al. / Appled Mathematcs and Computaton 87 (007) Theorem 3 [5]. Let aðzþ ¼ ðþzþm bðzþ. If the subdvson S m b correspondng to b(z) s convergent, then S a f 0 C m ðrþ for any ntal data f 0. Therefore, we get the fact that a( ) = 0 s the necessary condton for the convergence of a subdvson scheme and a m ( ) = 0 (where we defne a m ðzþ ¼ z aðzþ; a þz 0ðzÞ ¼aðzÞÞ s the necessary condton for C m - smoothness. Now, we try to fnd the masks of bnary nterpolatory symmetrc subdvson schemes usng only the smoothness condtons pont nterpolatory subdvson scheme The nserton rule of a 4-pont nterpolatory symmetrc subdvson scheme s ; þ ¼ a 3 þ a þ a þ þ a 3 þ : The Laurent polynomal of ths scheme s gven as aðzþ ¼a 3 z 3 þ a z þ þ a z þ a 3 z 3 : Here, a = a and a 3 = a 3 by the symmetrc subdvson scheme condton. And n order for the scheme to be C 0 ðrþ, we have necessarly a( ) = 0, that s, a þ a 3 ¼. In ths case, we obtan the Laurent polynomal of S as a ðzþ ¼ z þ z aðzþ ¼a 3z a 3 z þ þ z a 3z þ a 3 z 3 : Applyng the necessary condton for C ðrþ, we have a ( ) = 0. Set a 3 = w, we fnd the mask of the Dyn 4- pont nterpolatory subdvson scheme: w; þ w; þ w; w : Dyn [5] found a range of the parameter w for smoothness that ths scheme generates C -functons for 0<w < / pont nterpolatory subdvson scheme The general form of 6-pont nterploatory subdvson scheme s gven by ; þ ¼ a 5 þ a 3 þ a þ a þ þ a 3 þ þ a 5 þ3 : The correspondng Laurent polynomal of ths scheme s aðzþ ¼a 5 z 5 þ a 3 z 3 þ a z þ þ a z þ a 3 z 3 þ a 5 z 5 :

6 64 K.P. Ko et al. / Appled Mathematcs and Computaton 87 (007) The symmetrc condton nduces that a = a, a 3 = a 3, a 5 = a 5, and the Laurent polynomal can be wrtten by aðzþ ¼a 5 z 5 þ a 3 z 3 þ a z þ þ a z þ a 3 z 3 þ a 5 z 5 : In order for the scheme to converge unformly, we need the condton a( ) = 0, whch nduces the relaton a þ a 3 þ a 5 ¼. The Laurent polynomal of S s a ðzþ ¼ zaðzþ þ z ¼ a 5 z 4 a 5 z 3 þða 5 þ a 3 Þz ða 5 þ a 3 Þz þ þ z ða 3 þ a 5 Þz þða 3 þ a 5 Þz 3 a 5 z 4 þ a 5 z 5 : To generate C -functons, the Laurent polynomal must satsfy a ( ) = 0. It s easly to see that ths s always true n ths case. And the Laurent polynomal of S becomes a ðzþ ¼ za ðzþ þ z ¼ a 5z 3 a 5 z þð3a 5 þ a 3 Þz ð4a 5 þ a 3 Þþ þ 4a 5 þ a 3 z ð4a 5 þ a 3 Þz þð3a 5 þ a 3 Þz 3 a 5 z 4 þ a 5 z 5 : The necessary condton for C -smoothness mples a ( ) = 0,.e., 4a 5 þ 8a 3 þ ¼ 0. Set a 5 = w, then a 3 ¼ 3w, a 6 ¼ 9 þ w, and we have found the mask of 6-pont nterpolatory subdvson scheme: 6 ; þ ¼ wð þ þ3 Þ 6 þ 3w ð þ þ Þþ 9 6 þ w þ þ : We can easly obtan the mask of 4-pont, 6-pont, 8-pont and 0-pont nterpolatory symmetrc subdvson schemes (ISSS) by usng the same process: 4-pont scheme: ½a ; a 3 Š¼ w þ ; w. 6-pont scheme: ½a ; a 3 ; a 5 Š¼ w 3 þ 9 ; 3w 6 3 ; w pont scheme: ½a ;...; a 7 Š¼ 5w 4 þ 75 ; 9w 8 4 þ 5 ; 5w w pont scheme: ½a ;...; a 9 Š¼ 4w 5 þ 5 ; 8w ; 0w þ 49 ; 7w ; w From these masks, Ko et al. [] found out a general formula for the mask of (n + 4)-pont ISSS wth two parameters whch reproduces all polynomals of degree 6 n + and some relatons between the mask of the (n + 4)-pont ISSS and the (n + )-pont Deslaurers and Dubuc schemes. 4. Ternary nterpolatory symmetrc subdvson scheme A ternary subdvson scheme s a unvarate one wth a dlaton matrx M = 3. The scheme s gven by ¼ Z a 3 ; Z: ð7þ And the general rule of a ternary nterpolatory subdvson scheme s 3 ; 3þ ¼ a þ3 ; Z 3þ ¼ a þ3 : Z

7 K.P. Ko et al. / Appled Mathematcs and Computaton 87 (007) Theorem shows that the mask fa g Z of a convergent ternary subdvson scheme S satsfes a 3 ¼ a 3þ ¼ a 3þ ¼ : The Laurent polynomal of a convergent subdvson scheme satsfes aðe p=3 Þ¼aðe 4p=3 Þ¼0 and aðþ ¼3 and there exsts the Laurent polynomal a (z) such that 3z a ðzþ ¼ ð þ z þ z Þ aðzþ: The subdvson S wth symbol a (z) s related to S wth symbol a(z) by the followng theorem. Theorem 4 [0]. Let S denote a subdvson scheme wth symbol a(z) satsfyng (8). Then there exsts a subdvson scheme S wth the property d ¼ S d ; where =S k f 0 and d ¼fðd Þ ¼ 3 k ðfþ k f k Þ : Zg. And S s a unformly convergent subdvson scheme f and only f S 3 converges unformly to the zero functon for all ntal data f 0 k lm k > 3 S f 0 ¼ 0: Furthermore, S generates C m -lmt functons provded that the subdvson scheme S generates C m -lmt functons for some nteger m P. ð8þ 4.. Ternary 4-pont nterpolatory subdvson scheme We present a ternary 4-pont nterplatory subdvson scheme wth three subdvson rules: 3 ; 3þ ¼ a 4 þ a þ a þ þ a 5 þ ; 3þ ¼ a 5 þ a þ a þ þ a 4 þ : The Laurent polynomal of ths scheme s aðzþ ¼a 5 z 5 þ a 4 z 4 þ a z þ a z þ þ a z þ a z þ a 4 z 4 þ a 5 z 5 : Wth the symmetry condton, a(z) can be wrtten by aðzþ ¼a 5 z 5 þ a 4 z 4 þ a z þ a z þ þ a z þ a z þ a 4 z 4 þ a 5 z 5 : To generate C 0 -functons, we requre that a() = 3. And t mples a + a + a 4 + a 5 =. The Laurent polynomal of S 3 s 3 a ðzþ ¼ z aðzþ þ z þ z ¼ a 5z 3 þða 4 a 5 Þz a 4 z þða 5 þ a Þþð a 5 a Þz þða þ a 5 Þz a 4 z 3 þða 4 a 5 Þz 4 þ a 5 z 5 : From the necessary condton for C -smoothness, the mask correspondng to a (z) satsfes the relaton as n (8),.e., 3a 3a 4 +6a 5 =. And the Laurent polynomal of S 3 s 3 a ðzþ ¼ z a ðzþ þ z þ z ¼ 3a 5z þ 3ða 4 a 5 Þþ3ða 5 a 4 Þz þ 3 3 þ a 4 z þ 3ða 5 a 4 Þz 3 þ 3ða 4 a 5 Þz 4 þ 3a 5 z 5 : To generate C -functons, we requre the mask of S to satsfy the condton (8),.e., a 4 þ a 5 ¼. Set 9 a 5 ¼ þ l, we can fnd the mask of ternary 4-pont nterpolatory subdvson scheme: 8 6

8 66 K.P. Ko et al. / Appled Mathematcs and Computaton 87 (007) ; 3þ ¼ 8 þ 6 l 3þ ¼ 8 6 l þ 3 8 þ l þ 7 8 l þ 8 6 l þ 7 8 l þ 3 8 þ l þ 8 þ 6 l Hassan et al. [0] showed that the scheme s C for 5 < l < Bvarate schemes on regular meshes In ths secton, we consder cases when s = and M s two tmes the dentty matrx. In ths case, we may assume that the complete set E of representatves of the dstnct cosets of Z =Z conssts of the vectors (0,0), (,0), (0, ), and (,). For a quad-mesh, consder the refnement rule for a set of pont f R 3, Z þ ; ¼ Z a ; Z : ð9þ þ : In the bvarate case, there are 4 rules (even even, even odd, odd even and odd-odd) dependng on the party of each component of the vector Z. ð ; Þ ¼ ; a ð ; Þ ð ; Þ ; ðþ ; Þ ¼ ; a ðþ ; Þ ð ; Þ ; ð ;þ Þ ¼ ; a ð ;þ Þ ð ; Þ ; ðþ ;þ Þ ¼ ; a ðþ ;þ Þ ð ; Þ : The easest way to extend unvarate to bvarate schemes s to consder tensor-product schemes. For example, usng the mask of Chakn s scheme, we can get the mask of the bvarate bquadratc scheme a ð;þ : ; a ðþ;þ : ; a ð;þþ : ; a ðþ;þþ : : We can also obtan ths mask set by convoluton of sngle quadratc B-splne mask ½ 3 3 Š. 4 4 Š 4 Š; 4 Š 4 3Š; 4 3Š 4 Š; 4 3Š 4 3Š: Doo Sabn presented an algorthm whch generalze the bquadratc B-splne subdvson rule to nclude arbtrary topology. Smlarly, we can get the mask of b-cubc refnement rule through the tensor product of sngle cubc B-splne mask Š a ð;þ : ; a ðþ;þ : ; a ð;þþ : ; a ðþ;þþ : :

9 K.P. Ko et al. / Appled Mathematcs and Computaton 87 (007) Let us consder the topology of a regular trangulaton. We regard the subdvson scheme as operatng on the three-drectonal grd, snce the three-drectonal grd can be regarded also as Z. Let aðzþ ¼aðz ; z Þ¼ P ; a z z be the symbol of a bvarate subdvson scheme S whch s defned on regular trangulatons. From Theorem the mask of a bvarate convergent subdvson scheme S satsfes a a b ¼ ; a fð0; 0Þ; ð0; Þ; ð; 0Þ; ð; Þg: ð0þ bz It follows that the symbol of a bvarate convergent subdvson scheme satsfes: að ; Þ ¼að; Þ ¼að ; Þ ¼0 and að; Þ ¼4: ðþ In contrast to the unvarate case, the necessary condton (0) and the derved condton () on a(z) do not mply a factorzaton of the correspondng symbol n the bvarate case. However, we have the followng: Theorem 5. Let S be a bvarate subdvson scheme wth a compactly supported mask correspondng to ts Laurent polynomal aðz ; z Þ¼ P ;Z a z z. Then we have () for =,, a(z,z ) has + z as a factor f and only f aðz ; z Þ ¼ 0; z¼ () a(z,z ) has + z z as a factor f and only f aðz ; t=z Þ t¼ ¼ 0 equvalently or aðz ; t=z Þ t¼ ¼ 0: ð3þ ðþ Proof. The proof s straghtforward and we show only that a(,z ) = 0 f and only f a(z,z ) has z + as a factor. We can expand a(z,z ) wth respect to z as aðz ; z Þ¼ a ðz Þz Z for some polynomals a n one varable. Then t s easy to see that a(,z ) = 0 f and only f for every Z, a ( ) = 0, whch mples that a(z,z )hasz + as a factor. The remans are shown n the same argument, whch completes the proof. h As we can see n the matrx form of the butterfly scheme below, Theorem 5 means n the geometrcal pont of vew that when we plot the masks a at the pont (,) nz -plane, the condton a(,z ) = 0 f and only f the sums of even masks and of odd masks along each horzontal lne are the same, that s to say, for every k Z, Z ð Þ a ;k ¼ 0: And we can see that a(z,t/z ) t= = 0 f and only f ð Þ a ;þk ¼ 0; k Z: Z For ntegers k and, expandng a(z,z )as aðz ; z Þ¼ Z b ðz k z Þz wth polynomals b n one varable, we have, n general, that a(z,z ) has þ z k z as a factor f and only f the mask {a } satsfes ð Þ a k; þ ¼ 0 for every Z: Z Comparng Theorem n the unvarate case, Dyn [4] found the followng crterons for the verfcaton of the convergence and smoothness of a bvarate subdvson scheme.

10 68 K.P. Ko et al. / Appled Mathematcs and Computaton 87 (007) Theorem 6 [4]. Let S be a bvarate subdvson scheme wth ts symbol a(z,z ) havng ( + z )( + z )( + z z ) as a factor. Then, S s convergent f and only f the schemes correspondng to the symbols a ;0 ðz ; z Þ¼ aðz ; z Þ ; a 0; ðz ; z Þ¼ aðz ; z Þ ; a ; ðz ; z Þ¼ aðz ; z Þ ð4þ þ z þ z þ z z are contractve. If any two of these schemes are contractve then the thrd s also contractve. Theorem 7 [4]. Let S be a bvarate subdvson scheme wth ts symbol a(z,z ) havng ( + z )( + z )( + z z ) as a factor. Then S generates C lmt functons f the schemes wth the symbols a,0 (z,z ), a 0, (z,z ) and a, (z,z )n(4) are convergent. If any of two of these schemes are convergent then the thrd s also convergent. Moreover, o S f 0 ¼ S ;0 D ;0 f 0 ; oz o S f 0 ¼ S 0; D 0; f 0 ; oz o þ o oz oz S f 0 ¼ S ; D ; f 0 : To check f a scheme generates smooth lmt functons wth the ad of Theorems 6 and 7, we have to assume that the symbol of a subdvson scheme s factorzable: aðz ; z Þ¼ðþz Þð þ z Þð þ z z Þbðz ; z Þ: ð5þ In the followng three sectons, we study symmetrc subdvson schemes wth factorzable symbols a(z,z )as n (5). At frst, we recall the most popular subdvson scheme n ths case, the butterfly scheme, and then we show that the butterfly scheme and the modfed butterfly scheme are rebult only usng the factorzaton property and ther stencl structures. Note that to verfy the smoothness of a symmetrc subdvson scheme, based on Theorems 6 and 7, we have only to check the contractvty of one of the two schemes a,0 (z,z ) and a 0, (z,z )n(4), regardng the symmetry property. 5.. The Dyn butterfly subdvson scheme Dyn et al. [6] ntroduced the butterfly scheme. The butterfly scheme s an extenson of the 4-pont nterpolatory subdvson scheme to the bvarate case wth topology of regular trangulaton, whch s an nterpolatory trangular subdvson scheme wth stencl of small support (see Fg. ). The mask of the butterfly scheme s symmetrc ða ; ¼ a ; ; ; ZÞ and gven as a 0;0 ¼ ; a ;0 ¼ a ;0 ¼ a ; ¼ a ; ¼ =; a ; ¼ a ; ¼ a ; ¼ w; a ; ¼ a 3; ¼ a ; ¼ a 3; ¼ a ; 3 ¼ a ;3 ¼ w Fg.. Stencl of the Dyn butterfly scheme: ; ¼, (3,4 = w), (5,6,7,8 = w).

11 K.P. Ko et al. / Appled Mathematcs and Computaton 87 (007) and zero otherwse. There are three knds of refnement rules as n (9): ; þ þ; þ w ; þ þ;þ þ; ¼ ;þ ¼ ; þ ;þ ; þ þ;þ þ w ; þ þ;þ þ w þ; þ ;þ w ; þ þ; þ ;þ þ þ;þ w ; þ ;þ þ þ; þ þ;þ w ; þ ; þ þ;þ þ þ;þ þ;þ ¼ In Fg., we plot the ndex of non-zero masks accordng to the refnement rules as follows. The mask maps n Fg. suggest why the scheme s called the butterfly subdvson scheme. We express the mask of the butterfly scheme n the matrx form: ) w w ) w w w A ¼ða Þ¼ ) w w w w : 0 ) ) w w w w ) w w w 5 3 ) w w From the matrx, we see that the mask satsfes the condtons that for any k Z, ð Þ a ;k ¼ ð Þ a k; ¼ ð Þ a ;þk ¼ 0 Z Z Z and Theorem 5 mples that the symbol of the butterfly scheme s factorzable. The symbol s wrtten as aðz ; z Þ¼ 3 3 ¼ 3 ¼ 3 a ; z z ¼ ð þ z Þð þ z Þð þ z z Þð wcðz ; z ÞÞðz z Þ ; where cðz ; z Þ¼z z þ z z 4z z 4z 4z þ z z þ z z þ 4z 4z 4z z þ z z þ z z : Gregory [7] computed an explct shape parameter value w 0 > /6 such that for 0 < w < w 0, the butterfly scheme generates C lmt functons on regular trangulatons. It s well-known that the scheme reproduces cubc polynomals for w = /6, otherwse lnear polynomals for w 5 / Symmetrc 8-pont butterfly subdvson scheme (a) Odd-Even masks (b) Even-Odd masks (c) Odd-Odd masks Fg.. The mask maps of the butterfly scheme. In ths secton, we consder an 8-pont symmetrc nterpolatory bvarate subdvson scheme defned on a regular trangulaton mesh. ; ; : ð6þ

12 60 K.P. Ko et al. / Appled Mathematcs and Computaton 87 (007) If we set the stencl of the symmetrc 8-pont scheme such as Fg. 3. The mask of such a scheme s gven n the matrx form as follows: ) c c ) c b c A ¼ða Þ¼ ) c b a a b c : 0 ) a a ) c b a a b c ) c b c 5 3 ) c c The bvarate Laurent polynomal of ths scheme s assumed to be factorzable: aðz ; z Þ¼ 3 3 ¼ 3 ¼ 3 a ; z z ¼ð þ z Þð þ z Þð þ z z Þbðz ; z Þ: By Theorem 5, the factorzaton mples that for each k Z, we have ð Þ a ;k ¼ ð Þ a k; ¼ ð Þ a ;þk ¼ 0: Z Z Z In ths case, we get c + b = a + = 0. If we set c = w, we obtan the same mask of the butterfly scheme: a ¼ ; b ¼ w; c ¼ w: Fg. 3. Stencl of 8-pont butterfly scheme: (, = a), (3,4 = b), (5,6,7,8 = c) Symmetrc 0-pont butterfly subdvson scheme As shown n the prevous secton, the butterfly scheme generates C surfaces n the topology of regular settng. The smoothness of surface n geometrc modelng s requred to be up to C. To obtan a subdvson Fg. 4. Stencl of the symmetrc 0-pont butterfly scheme: (, = a), (3,4 = b), (5,6,7,8 = c), (9,0 = w).

13 scheme retanng the smplcty of the butterfly scheme and creatng C lmt surfaces, we need to enlarge the support of the butterfly scheme, as mentoned n the ntroducton. We try t by takng two more ponts nto account to calculate a new control ponts as shown n Fg. 4. Comparng the stencl of the butterfly scheme n Fg. 3, we consder two nearby ponts (ponts 9 and 0 n Fg. 4) wth dfferent mask value (weght) from those of the other eght ponts. The mask of 0-pont butterfly scheme can s wrtten n the matrx form: ) w c c w ) c b c A :¼ ) c b a a b c : 0 ) w a a w ) c b a a b c ) c b c 5 3 ) w c c w We assume a factorzaton of the Laurent polynomal of ths scheme: aðz ; z Þ¼ðþz Þð þ z Þð þ z z Þcðz ; z Þ: From the factorzaton, we get c þ b ¼ 0; a w þ ¼ 0: Therefore, we fnd the mask of 0-pont butterfly scheme: a ¼ w; b ¼ c; 5; 6; 7; 8 ¼ c; 9; 0 ¼ w: Ths mask s exact wth a modfed butterfly scheme when c = /6 + w. Zorn et al. [] examned that the butterfly scheme exhbts undesrable artfacts n the case of an rregular topology, and derved an mproved scheme (a modfed butterfly scheme), whch retans the smplcty of the butterfly scheme. The modfed butterfly scheme s nterpolatng and results n smoother surfaces. References K.P. Ko et al. / Appled Mathematcs and Computaton 87 (007) [] A. Cavaretta, W. Dahmen, C.A. Mcchell, Statonary subdvson, Mem. Amer. Math. Soc. 93 (99) 86. [] G. Deslaurers, S. Dubuc, Symmetrc teratve nterpolaton processes, Constr. Approx. 5 (989) [3] N. Dyn, Interpolatory subdvson schemes, n: A. Iske, E. Quak, M.S. Floater (Eds.), Tutorals on Multresoluton n Geometrc Modellng, Sprnger, 00, pp (Chapter ). [4] N. Dyn, Analyss of convergence and smoothness by the formalsm of Laurent polynomals, n: A. Iske, E. Quak, M.S. Floater (Eds.), Tutorals on Multresoluton n Geometrc Modellng, Sprnger, 00, pp (Chapter 3). [5] N. Dyn, Subdvson schemes n computer-aded geometrc desgn, n: W.A. Lght (Ed.), Advances n Numercal Analyss II: Wavelets, Subdvson Algorthms and Radal Bass Functons, Oxford Unversty Press, 99, pp [6] N. Dyn, J.A. Gregory, D. Levn, A butterfly subdvson scheme for surface nterpolaton wth tenson control, ACM Trans. Graphcs 9 () (990) [7] J. Gregory, An Introducton to bvarate unform subdvson, n: D.F. Grffths, G.A. Watson (Eds.), Numercal Analyss, Ptman Research Notes n Mathematcs, 99, pp [8] B. Han, Analyss and constructon of optmal multdmensonal borthogonal wavelets wth compact support, SIAM J. Math. Anal. 3 (000) [9] B. Han, R.Q. Ja, Multvarate refnement equatons and convergence of subdvson schemes, SIAM J. Math. Anal. 9 (5) (998) [0] M.F. Hassan, I.P. Ivrssmtzs, N.A. Doggson, M.A. Sabn, An nterpolatng 4-pont C ternary statonary subdvson scheme, Comput. Aded Geomet. Des. 9 (00) 8. [] K.P. Ko, B.G. Lee, Y. Tang, G.J. Yoon, General formula for the mask of (n + 4)-pont symmetrc subdvson scheme, JCAM, submtted for publcaton. [] D. Zorn, P. Schröder, W. Sweldens, Interpolatng subdvson for meshes wth arbtrary topology, n: Computer Graphcs Proceedng (SIGGRAPH 96), 996, pp

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

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

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

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

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

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

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

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

A NEW PROOF OF THE SMOOTHNESS OF 4-POINT DESLAURIERS-DUBUC SCHEME

A NEW PROOF OF THE SMOOTHNESS OF 4-POINT DESLAURIERS-DUBUC SCHEME J. Appl. Math. & Computing Vol. 18(2005), No. 1-2, pp. 553-562 A NEW PROOF OF THE SMOOTHNESS OF 4-POINT DESLAURIERS-DUBUC SCHEME YOUCHUN TANG, KWAN PYO KO* AND BYUNG-GOOK LEE Abstract. It is well-known

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

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

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

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

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

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

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

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

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

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

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

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

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

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

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

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-Boost Mesh Filtering for 3-D Shape Enhancement Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,

More information

ALEKSANDROV URYSOHN COMPACTNESS CRITERION ON INTUITIONISTIC FUZZY S * STRUCTURE SPACE

ALEKSANDROV URYSOHN COMPACTNESS CRITERION ON INTUITIONISTIC FUZZY S * STRUCTURE SPACE mercan Journal of Mathematcs and cences Vol. 5, No., (January-December, 206) Copyrght Mnd Reader Publcatons IN No: 2250-302 www.journalshub.com LEKNDROV URYOHN COMPCTNE CRITERION ON INTUITIONITIC FUZZY

More information

Very simple computational domains can be discretized using boundary-fitted structured meshes (also called grids)

Very simple computational domains can be discretized using boundary-fitted structured meshes (also called grids) Structured meshes Very smple computatonal domans can be dscretzed usng boundary-ftted structured meshes (also called grds) The grd lnes of a Cartesan mesh are parallel to one another Structured meshes

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

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

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

b * -Open Sets in Bispaces

b * -Open Sets in Bispaces Internatonal Journal of Mathematcs and Statstcs Inventon (IJMSI) E-ISSN: 2321 4767 P-ISSN: 2321-4759 wwwjmsorg Volume 4 Issue 6 August 2016 PP- 39-43 b * -Open Sets n Bspaces Amar Kumar Banerjee 1 and

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

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

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

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

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

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

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems

More information

350 Nra Dyn and Elza Farkh 1. Introducton. The nterest n developng subdvson schemes for compact sets s motvated by the problem of the reconstructon of

350 Nra Dyn and Elza Farkh 1. Introducton. The nterest n developng subdvson schemes for compact sets s motvated by the problem of the reconstructon of Serdca Math. J. 28 (2002), 349-360 SPLINE SUBDIVISION SCHEMES FOR COMPACT SETS. A SURVEY Nra Dyn and Elza Farkh Communcated by P.P.Petrushev Dedcated to the memory of our colleague Vasl Popov January 14,

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications 14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of

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

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

An Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane

An Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane An Approach n Colorng Sem-Regular Tlngs on the Hyperbolc Plane Ma Louse Antonette N De Las Peñas, mlp@mathscmathadmueduph Glenn R Lago, glago@yahoocom Math Department, Ateneo de Manla Unversty, Loyola

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

Introduction. Basic idea of subdivision. History of subdivision schemes. Subdivision Schemes in Interactive Surface Design

Introduction. Basic idea of subdivision. History of subdivision schemes. Subdivision Schemes in Interactive Surface Design Subdvson Schemes n Interactve Surface Desgn Introducton Hstory of subdvson. What s subdvson? Why subdvson? Hstory of subdvson schemes Stage I: Create smooth curves from arbtrary mesh de Rham, 947. Chan,

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

Non-Split Restrained Dominating Set of an Interval Graph Using an Algorithm

Non-Split Restrained Dominating Set of an Interval Graph Using an Algorithm Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,

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

CHAPTER 2 DECOMPOSITION OF GRAPHS

CHAPTER 2 DECOMPOSITION OF GRAPHS CHAPTER DECOMPOSITION OF GRAPHS. INTRODUCTION A graph H s called a Supersubdvson of a graph G f H s obtaned from G by replacng every edge uv of G by a bpartte graph,m (m may vary for each edge by dentfyng

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

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

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

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

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

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

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered

More information

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

Analysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress

Analysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress Analyss of 3D Cracks n an Arbtrary Geometry wth Weld Resdual Stress Greg Thorwald, Ph.D. Ted L. Anderson, Ph.D. Structural Relablty Technology, Boulder, CO Abstract Materals contanng flaws lke nclusons

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

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

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Optimal Quadrilateral Finite Elements on Polygonal Domains

Optimal Quadrilateral Finite Elements on Polygonal Domains J Sc Comput (2017) 70:60 84 DOI 10.1007/s10915-016-0242-5 Optmal Quadrlateral Fnte Elements on Polygonal Domans Hengguang L 1 Qnghu Zhang 2 Receved: 30 January 2015 / Revsed: 21 January 2016 / Accepted:

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

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

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

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016) Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)

More information

Computers and Mathematics with Applications. Discrete schemes for Gaussian curvature and their convergence

Computers and Mathematics with Applications. Discrete schemes for Gaussian curvature and their convergence Computers and Mathematcs wth Applcatons 57 (009) 87 95 Contents lsts avalable at ScenceDrect Computers and Mathematcs wth Applcatons journal homepage: www.elsever.com/locate/camwa Dscrete schemes for Gaussan

More information

UNIT 2 : INEQUALITIES AND CONVEX SETS

UNIT 2 : INEQUALITIES AND CONVEX SETS UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces

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

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

F Geometric Mean Graphs

F Geometric Mean Graphs Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

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

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

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method NICOGRAPH Internatonal 2012, pp. 114-119 3D Vrtual Eyeglass Frames Modelng from Multple Camera Image Data Based on the GFFD Deformaton Method Norak Tamura, Somsangouane Sngthemphone and Katsuhro Ktama

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

Polyhedral Compilation Foundations

Polyhedral Compilation Foundations Polyhedral Complaton Foundatons Lous-Noël Pouchet pouchet@cse.oho-state.edu Dept. of Computer Scence and Engneerng, the Oho State Unversty Feb 8, 200 888., Class # Introducton: Polyhedral Complaton Foundatons

More information

Rational Interpolants with Tension Parameters

Rational Interpolants with Tension Parameters 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

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

Fair Triangle Mesh Generation with Discrete Elastica

Fair Triangle Mesh Generation with Discrete Elastica Far Trangle Mesh Generaton wth Dscrete Elastca Shn Yoshzawa, and Alexander G. Belyaev, Computer Graphcs Group, Max-Planck-Insttut für Informatk, 66123 Saarbrücken, Germany Phone: [+49](681)9325-414 Fax:

More information

Lecture 5: Probability Distributions. Random Variables

Lecture 5: Probability Distributions. Random Variables Lecture 5: Probablty Dstrbutons Random Varables Probablty Dstrbutons Dscrete Random Varables Contnuous Random Varables and ther Dstrbutons Dscrete Jont Dstrbutons Contnuous Jont Dstrbutons Independent

More information

Adaptive Fairing of Surface Meshes by Geometric Diffusion

Adaptive Fairing of Surface Meshes by Geometric Diffusion Adaptve Farng of Surface Meshes by Geometrc Dffuson Chandrajt L. Bajaj Department of Computer Scences, Unversty of Texas, Austn, TX 78712 Emal: bajaj@cs.utexas.edu Guolang Xu State Key Lab. of Scentfc

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

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

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

The Erdős Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces

The Erdős Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces Dscrete Mathematcs 307 (2007) 764 768 www.elsever.com/locate/dsc Note The Erdős Pósa property for vertex- and edge-dsjont odd cycles n graphs on orentable surfaces Ken-Ich Kawarabayash a, Atsuhro Nakamoto

More information

Constructing Minimum Connected Dominating Set: Algorithmic approach

Constructing Minimum Connected Dominating Set: Algorithmic approach Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

Clustering on antimatroids and convex geometries

Clustering on antimatroids and convex geometries Clusterng on antmatrods and convex geometres YULIA KEMPNER 1, ILYA MUCNIK 2 1 Department of Computer cence olon Academc Insttute of Technology 52 Golomb tr., P.O. Box 305, olon 58102 IRAEL 2 Department

More information

Fast exponentiation via prime finite field isomorphism

Fast exponentiation via prime finite field isomorphism Alexander Rostovtsev, St Petersburg State Polytechnc Unversty rostovtsev@sslstunevaru Fast exponentaton va prme fnte feld somorphsm Rasng of the fxed element of prme order group to arbtrary degree s the

More information

Radial Basis Functions

Radial Basis Functions Radal Bass Functons Mesh Reconstructon Input: pont cloud Output: water-tght manfold mesh Explct Connectvty estmaton Implct Sgned dstance functon estmaton Image from: Reconstructon and Representaton of

More information

The Shortest Path of Touring Lines given in the Plane

The Shortest Path of Touring Lines given in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He

More information

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*

More information

Outline. Midterm Review. Declaring Variables. Main Variable Data Types. Symbolic Constants. Arithmetic Operators. Midterm Review March 24, 2014

Outline. Midterm Review. Declaring Variables. Main Variable Data Types. Symbolic Constants. Arithmetic Operators. Midterm Review March 24, 2014 Mdterm Revew March 4, 4 Mdterm Revew Larry Caretto Mechancal Engneerng 9 Numercal Analyss of Engneerng Systems March 4, 4 Outlne VBA and MATLAB codng Varable types Control structures (Loopng and Choce)

More information

Bridges and cut-vertices of Intuitionistic Fuzzy Graph Structure

Bridges and cut-vertices of Intuitionistic Fuzzy Graph Structure Internatonal Journal of Engneerng, Scence and Mathematcs (UGC Approved) Journal Homepage: http://www.jesm.co.n, Emal: jesmj@gmal.com Double-Blnd Peer Revewed Refereed Open Access Internatonal Journal -

More information