Wegelerstraße Bonn. Germany phone fax Maharavo Randrianarivony

Size: px
Start display at page:

Download "Wegelerstraße Bonn. Germany phone fax Maharavo Randrianarivony"

Transcription

1 Wegelerstraße Bonn. Germany phone fax Maharavo Randranarvony COONS GENERALIZATION FOR POLYTOPES INS Preprnt

2 1. Introducton Over the last decades, several efforts have been done to obtan effcent representatons of geometrc data wth the help of scarce nformaton. That can be llustrated by the representaton of complete Bézer and splne [6] curves or surfaces where one stores only a fnte number of control ponts. Smlarly, the orgnal transfnte nterpolaton ntated by Coons can be used to descrbe a surface by usng only the curves whch bound t. We want to address n ths document the problem of constructng a transfnte nterpolaton n a convex doman. Let us frst consder a few earler works related to polyhedra or transfnte nterpolatons. Polyhedra have already been nvestgated n the ancent era. The smplest examples mght be the Platonc solds whch have been examned by Plato. The study of polyhedra and polytopes are usually closely connected to the Euler-Poncaré characterstc [?, 13] as well studed by Schläfl [19]. Zegler has also done a lot of nvestgaton about polytopes and ther propertes [?]. The frst who ntated the dea of such transfnte nterpolatons was Coons [3] n the year sxtes. Later, Forrest has ntensvely used transfnte nterpolaton n order to generate curved coordnate systems [7]. Addtonally, Farn has ntroduced an mprovement [6] of Coons patches related to varatonal prncples. The tradtonal approach n generatng transfnte nterpolatons [3] takes the sum of the combnatons of data on opposte faces whch s then subtracted by some mxed quanttes. Gordon has expressed [?] that n terms of operators and boolean sums such as P Q = P +Q PQ. The tetrahedral transfnte nterpolaton of Mansfeld [?] stll used that constructon by combnng a node wth ts opposte face. Addtonally, the work of Mansfeld does not contan any topologc nformaton whatsoever. The major drawback of Mansfeld s approach s that t looses ts valdty when appled to more general frameworks. In fact, for more complcated polyhedra lke the ones llustrated n Fg. 1, the noton of opposte faces does not have any meanng except for a few specal cases. Perronnet has consdered [12] treatments of transfnte nterpolaton on a few specal polyhedra whch are not necessarly of tensor-product type such as tetrahedron and pentahedron. He has treated each polyhedron one by one and he dd not provde any general way of representng hs results. In addton, hs formulas are so lengthy that t s dffcult to use them for analytcal purpose. As for CAD preparaton, Brunnett and Randranarvony have nvested a lot to develop and mplement a method whch s approprate for surfaces n ntegral equatons [15]. That conssts manly n decomposng trmmed surfaces [1] nto four-sded patches [18] and n usng Coons patches to generate mappngs. Ther methods have already been successfully mplemented to CAD and molecular surfaces [16, 17]. Harbrecht and Randranarvony

3 3 [11] have used those surface CAD models for applcatons n Wavelet Boundary Element Method (BEM) solvers. In the framework of multfaceted surfaces, Loop et al. [?] have devsed a method of generalzng Bézer on multfaceted polygons. Besdes, the usual Bézer curve usng Bernsten polynomals [14] has already been generalzed [20] by Sedel to multdmensonal smplex. In the opnon of the author, the works of Loop and Sedel ft well wth the presented method n ths document because ther approach enables the defnton of the curved boundary faces accurately. The formula whch s presented here does not use combnatons of data from opposte faces. Instead, t consders the topologc enttes whch can stll be used even for domans whch are not n tensor product structures. In order to present that result, we organze ths paper as follows. We start n Secton 2 by recallng some nterestng facts from the usual 2D Coons map on the unt square. We show there another formulaton of the Coons map from topologc perspectve. That motvates the constructon of the transfnte nterpolaton n the subsequent sectons. That wll be followed by a precse demonstraton of the problem settng for more general convex domans n Secton 3 where we fnd also some ntroducton of mportant notatons. To prepare the formulaton of the transfnte nterpolaton, we ntroduce n Secton 4 varous auxlary results n form of lemmas. Among others, we wll meet there a projecton onto the faces of a convex doman and pertanng propertes. The formulaton and the proof of the man results are found n Secton 5 n whch we show also the affne stablty of the nterpolant. Toward the end of ths document, we show eventually some llustratve practcal results. 2. Coons map revsted In ths secton, we consder the usual [3, 10] Coons patch defned on [0, 1] 2 from topologc perspectve. That wll serve as a motvaton of the subsequent sectons. Let us consder four parametrc curves (2.1) α, β, γ, δ : [0, 1] R 2 whch are supposed to fulfll the next compatblty condtons that are llustrated n Fg. 2(a): (2.2) α(0) = δ(0), α(1) = β(0), γ(1) = β(1), γ(0) = δ(1). The Coons transfnte nterpolaton conssts n generatng a parametrc surface x(u, v) defned on the unt square [0, 1] 2 such that the boundary of the mage of x concdes wth the gven four curves: (2.3) x(u, 0) = α(u), x(u, 1) = γ(u) u [0, 1], x(0, v) = δ(v), x(1, v) = β(v) v [0, 1].

4 4 (a) (b) (c) (d) (e) (f) Fgure 1. A few examples of polytopes. The tradtonal method of creatng a transfnte nterpolaton by blendng data from opposte faces cannot be drectly appled to the general case.

5 5 N 4 N 3 γ(0) = δ(1) γ δ α α(0) = δ(0) γ(1) = β(1) β α(1) = β(0) v 1 v λ 2 λ 1 u = (u, v) λ 3 λ 4 N 2 N 1 u 1 u (a) (b) (c) Fgure 2. (a)boundary of a Coons patch, (b)examples of a Coons patch, (c)the four shaded areas determne the barycentrc coordnates λ 1, λ 2, λ 3, λ 4 of u = (u, v) wth respect to [N 1, N 2, N 3, N 4 ] As an llustraton, we can see n Fg. 2(b) the mage of a unform grd on the unt square by a Coons map x. Let f 0 and f 1 denote two arbtrary smooth functons satsfyng (2.4) f (j) = δ j, j = 0, 1 and f 0 (t) + f 1 (t) = 1 t [0, 1]. The functons f 0, f 1 whch are better known as blendng functons can be chosen n several ways [7]. Among others, three methods are usual: lnear, cubc and trgonometrc blendng functons: (2.5) f 0 (t) := 1 t and f 1 (t) := t, f 0 (t) := B0(t) 3 + B1(t) 3 and f 1 (t) := B2(t) 3 + B3(t), 3 f 0 (t) := cos 2 (0.5πt) and f 1 (t) := sn 2 (0.5πt). A constructon of a soluton to (2.3) whch was due to Coons frst blends the opposte curves β and δ. Then, t s added by a blend between the opposte curves α and γ. Fnally, those two blends are subtracted by mxed terms to ensure good nterpolaton at the corners. That can be expressed n matrx form as: (2.6) x(u, v) := [ [ ] [ ] δ(v) [ f 0 (u) f 1 (u) + α(u) γ(u) β(v) ] [ ] [ ] α(0) γ(0) f 0 (v) f 0 (u) f 1 (u). α(1) γ(1) f 1 (v) ] [ f 0 (v) f 1 (v) ] The above constructon s dffcult to generalze to more general polytopes except to some specal cases such as a smplex. That s because the noton of opposte faces s not obvous to fgure out. Now, we want to consder the above transfnte nterpolaton on the unt square but from topologc pont of vew. To that end, consder a functon

6 6 B defned on the boundary of D := [0, 1] 2 as follows (2.7) B(u, 0) := α(u), B(u, 1) := γ(u), B(0, v) := δ(v), B(1, v) := β(v). For a pont u = (u, v) nsde D, the expressons λ 1 := (1 u)(1 v), λ 2 := u(1 v), λ 3 := uv, λ 4 := (1 u)v determne barycentrc coordnates wth respect to N 1 := (0, 0), N 2 := (1, 0), N 3 := (1, 1), N 4 := (0, 1) as shown n Fg.2(c). Let us now consder the four functons (2.8) b 1 (u, v) := f 0 (u)f 0 (v), b 3 (u, v) := f 1 (u)f 1 (v), b 2 (u, v) := f 1 (u)f 0 (v), b 4 (u, v) := f 0 (u)f 1 (v). We deduce from (2.4) that they sum to unty and that b (u, v) = 0 when the barycentrc coordnate λ = 0. By usng the propertes of the blendng functons, the above expresson of x can be reformulated n terms of b as follows x(u, v) = b 1 (u, v) [ α(u) + δ(v) α(0) ] + b 2 (u, v) [ α(u) + β(v) α(1) ] (2.9) + b 3 (u, v) [ β(v) + γ(u) γ(1) ] or equvalently + b 4 (u, v) [ γ(u) + δ(v) γ(0) ], x(u, v) = ( 1) 3 { b 1 (u, v) [ ( 1) 1 B(u, 0) + ( 1) 1 B(0, v) + ( 1) 0 B(0, 0) ] + b 2 (u, v) [ ( 1) 1 B(u, 0) + ( 1) 1 B(1, v) + ( 1) 0 B(1, 0) ] + b 3 (u, v) [ ( 1) 1 B(1, v) + ( 1) 1 B(u, 1) + ( 1) 0 B(1, 1) ] + b 4 (u, v) [ ( 1) 1 B(u, 1) + ( 1) 1 B(0, v) + ( 1) 0 B(0, 1) ]}. The role of ths document s to generalze the above formula to general convex domans n R d havng M nodes N 1,...,N M. In fact, we wll develop a transfnte nterpolaton of the form M (2.10) ( 1) d+1 b (λ) ( 1) dm(π) B P Π,N (λ) =1 Π G() where G() s the set of topologc enttes (nodes and edges n 2D) such that the node N s ncdent upon them and P s a certan projecton whch wll be specfed subsequently. 3. Nomenclatures and problem settng There are several ways of defnng a polytope but the two most appled settngs are the one usng convex hulls and the one usng hyperplanes. They correspond to the

7 7 H 4 H 1 H2 H 3 H H 5 H H H 4 (a) (b) Fgure 3. (a)the large ponts, the bold lne segments and the shaded doman represent some faces 4 =1 Hσ where σ {0, +, }, (b)some chambers dentfed by ther sgn sequence σ 1 σ 2 σ 3 σ 4 splt R d \ { 4 =1H }. so-called V-polytope and H-polytope. Thus, a polytope D can be expressed n the followng forms (3.11) (3.12) (V polytope) : D = HULL { N R d : = 1,..., M }, (H polytope) : D = L H +. In both cases, we assume that polytopes are closed and bounded. The famous theorem [?,?,?] of Weyl-Mnkowsk states the equvalence of those two formulatons. Consequently, we wll use both settngs and choose at each crcumstance the one whch facltates the presentaton. In order that ths paper s readable by nonspecalts n polytopes, let us specfy those two settngs more accurately by ntroducng mportant notatons and propertes Hyperplane arrangements and polytopes. Let us consder an arrangement A whch [?] s defned to be a fnte set of (affne) hyperplanes H n R d where L. Each hyperplane H splts R d nto two half-spaces H + and H whch are both supposed to be topologcally open. Thus, the hyperplane H belongs to nether H + nor H. In order to manage the sgn dstrbutons, let us denote H 0 := H. More precsely, there are some a 1,, a d, a d+1 R such that (3.13) H 0 := {u = (u 1,..., u d ) R d : a 1 u a d u d + a d+1 = 0}, (3.14) H + := {u = (u 1,..., u d ) R d : a 1 u a d u d + a d+1 > 0}, (3.15) H := {u = (u 1,..., u d ) R d : a 1u a du d + a d+1 < 0}.

8 8 The hyperplanes H, J decompose the whole space R d nto nonempty subsets F of the form (3.16) F = L H σ, σ {0, +, } whch are called faces as llustrated n Fg. 3(a). A chamber (see Fg. 3(b)) s a face for whch σ 0 for all L. Note that chambers are open and convex and they form a partton of R d \ ( L H ) as llustrated n Fg. 3(b). A polytope D s defned to be the closure of a bounded chamber: (3.17) D = L H σ σ {+, }. The faces of D havng dmenson d 1 wll be termed facets whle those havng zero dmenson smply nodes or vertces. For three ndex subsets I 1, I 2, I 3 L where I I j =, one defnes the dmenson of a subset of the form (3.18) B = [ ] [ ] [ ] I0 H 0 I1 H + I2 H R d to be the dmenson of I0 H 0 as llustrated n Fg. 4(a). If I 0 =, then we suppose I0 H 0 := Rd so that dm(b) = d. In partcular, as seen from (3.17) the dmenson of a polytope D n R d s d. Let us now consder the ncdence n the set F of faces of an arrangement A. An element Π 1 F s called a face of Π 2 F f for each L, one has (see Fg. 4(b)) (3.19) σ (Π 1 ) = 0 or σ (Π 1 ) = σ (Π 2 ). In such a case, we denote Π 1 Π 2 and we say Π 1 s ncdent upon Π 2. The relaton between a face and the faces ncdent upon t s [?] that (3.20) C = B. B C Snce we are only nterested n one sngle polytope D, we may suppose wthout loss of generalty that all the hyperplanes H n the arrangement A are ncdent upon D. A polytope s sad to be n a general poston f the correspondng hyperplanes admt the next propertes: (3.21) (3.22) If k d, then dm(h 1 H k ) = d k, If k > d, then H 1 H k =. The Euler-Poncaré characterstc operator χ s defned to be an nteger valued functon defned for each V whch s a fnte unon of faces as n (3.16) such that χ fulflls the followng condtons (E1) χ( ) = 0, (E2) χ(f) = ( 1) dm(f) for F of the form (3.16),

9 Π 1 Π 2 Π 3 9 H 3 H 1 B = H 1 H + 2 H 3 H 2 (a) (b) Fgure 4. (a) The subset B = H 1 H 2 + H 3 R 2 has dmenson dm(b) = dm(h 1 ) = 1. (b) We have Π 1 Π 2 and Π 3 Π 2. (E3) χ(v W) = χ(v ) + χ(w) χ(v W). From now on, we wll generally adopt the notaton of Coxeter and Schläff by usng Π for desgnng faces of a polytope except the nodes whch we denote by N p Barycentrc coordnates and problem settng. Consder a polytope D n R d. Accordng to the Weyl-Mnkowsk property [?,?], the closure of the polytope D s the convex hull of the nodes whch are ncdent upon D,.e. (3.23) D = HULL { N D : dm(n) = 0 }. We wll denote the nodes of the polytope D by N 1,..., N M. A barycentrc coordnate λ s a sequence of functons (λ 1,...,λ M ) (3.24) λ : D R + {0} such that for each u D we have M (3.25) λ (u) = 1, and u = =1 M λ (u)n. We also assume the unqueness property: for gven µ 1,..., µ M R + {0} such that µ µ M = 1, there s a unque u D such that (3.26) λ (u) = µ. As opposed to the smplex case, there mght be several methods of defnng the functons λ(u) whch fulfll the two crtera (3.25) and (3.26) n a general convex doman. The purpose of ths document s not a revew of barycentrc coordnates. Joe Warren has done a good survey [?] for barycentrc coordnates on convex domans. Throughout ths document, we fx one way of defnng barycentrc coordnate functons. Because of the unqueness property (3.26), we wll wrte nterchangeably u D or λ = (λ ) = (λ (u)) D for notatonal convenence. =1

10 10 Let us now formulate the problem settng accurately. Suppose that we have a boundary functon (3.27) B : D \ D R p. In ths document, our ntent s to fnd a transfnte nterpolant of B defned on the whole D (3.28) T [B] : D R p such that T [B](λ) = B(λ) for all λ D \ D and that T [B] s stable under affne transform such that (3.29) T [ A(B) ] = A ( T [B] ) for any affne transform A. The affne stablty property s very mportant n applcatons because the boundary faces are usually gven n terms of dscrete grds such as control nets of splnes or Bézer patches [?, 20]. Suppose that the transfnte nterpolaton T of the ntal faces has been computed. In order to fnd the transfnte nterpolaton wth respect to the transformed control ponts, we need only to apply the affne transform to T. 4. Topologc relatons and projectons Before beng able to solve the problem n (3.28), we need frst to concentrate n ths secton on the ncdence propertes of topologc enttes. In partcular, we wll nvestgate a set G(q) whch s composed of the faces havng a node N q as an ncdent node. Among others, we wll analyze the parttonng of G(q). Afterwards, a projecton wll be ntroduced and we examne some related propertes Incdence nformaton. Consder an arrangement A of hyperplanes H R d where L. Let D be a polytope of dmenson d whch s the closure of the chamber: (4.30) D = L H σ σ {+, }. For each fxed node N q of the polytope D, we defne (4.31) G(q) := { Π D s.t. N q Π and Π D }. Snce the node N q s a face of D, there must exst J = J (q) L such that (4.32) N q = [ J (q) H ] [ L\J (q) H σ ],

11 11 N q = Π Π spec N q Π Π spec Π Π (a) (b) Fgure 5. The node N q s ncdent upon both Π and Π whch are faces of D. We have Π Π spec whle Π Π spec as ntroduced n (3.16) where dm( J H ) = 0. Hence, from defnton (3.19) we obtan that every face Π of D such that N q s ncdent upon Π must be of the form Π = Π K = [ ] [ ] K H J \K H σ (4.33) Wq G(q), where (4.34) W q n whch K J. := L\J H σ Consder any fxed facet Π spec of the polytope D. Snce Π spec s of dmenson d 1, there must exst some r L such that [ ] (4.35) Π spec = H r L\{r} H σ where σ 0 from (4.30) for all L \ {r}. Suppose that a node N q s ncdent upon Π spec. Let us ntroduce two sets G 1 = G 1 (q, Π spec ) and G 2 = G 2 (q, Π spec ) such as { [ ] [ ] } G 1 := H r P\{r} H J \P H σ (4.36) Wq : r P J { [ ] [ ] } G 2 := Hr σr P\{r} H J \P H σ (4.37) Wq : r P J where the sgns σ are the same as that n the polytope D from (4.30). Fg. 5 depcts examples of faces Π and Π whch belong respectvely to G 1 and G 2. Before beng able to prove the man result of ths document, we need to treat several prelmnary notons. Let us start from the followng easy but mportant observatons. Lemma 4.1. Consder a polytope D n general poston. For each facet Π spec of the polytope D and a node N q ncdent upon Π spec, the subsets G 1 (q, Π spec ) and G 2 (q, Π spec ) from relatons (4.36) and (4.37) possess the next propertes: (C0) Π spec G 1 (q, Π spec ) and D G 2 (q, Π spec ).

12 12 (C1) The sets G 1 \ {Π spec } and G 2 \ {D} form a partton of G(q) \ {Π spec }. (C2) For each Π G 1 (q, Π spec ) \ {Π spec }, there exsts a unque Π G 2 (q, Π spec ) \ {D} such that (4.38) ( 1) dm(π) ( 1) dm( Π) = 1. PROOF. The membershps n (C0) are readly obtaned from (4.30), (4.35) and the defntons of G 1 and G 2. As for (C1), we observe that every element Π of G 1 can be expressed as Π K n (4.33) by defnng K := P. That holds also for G 2 n whch we defne K := P \ {r}. Thus, we obtan the nclusons (4.39) G 1 \ {Π spec } G(q) \ {Π spec }, and G 2 \ {D} G(q) \ {Π spec }. We want now to show that G(q) (G 1 \ {Π spec }) (G 2 \ {D}). Let Π K G(q) be gven as n (4.33). We dstngush two cases wth respect to K. Case 1: If K contans r, then (4.40) Π K = H r [ K\{r} H ] [ J \K H σ Hence, Π K belongs to G 1 where P := K. Case 2: If r K, then (4.41) Π K = H σr r Hence, Π K belongs to G 2 where P := K {r}. ] Wq. [ ] [ ] K H J \(K {r}) H σ Wq. Snce G 1 and G 2 are obvously dsjont, we obtan (C1). Let Π G 1 \ {Π spec } be gven. Thus, there s P J such that r P and (4.42) Π = Π P := H r [ P\{r} H ] [ J \P H σ ] W q G 1. Let us consder (4.43) Π = ΠP := H σr r [ P\{r} H ] [ J \P H σ ] W q G 2. Snce Π and Π dffer only wth respect to one sngle hyperplane H r, we deduce from the hypothess of general poston (3.21) (4.44) dm( Π) = dm(π) + 1. Hence, we obtan (C2). Q.E.D.

13 Projectons onto faces. For a polytope D, let us consder an arbtrary face Π and let C desgnate the ndces of the nodes ncdent upon Π. Consder now any node N q where q C. Let us ntroduce a projecton dependng on both Π and N q : (4.45) P := P Π,Nq : D Π such that for λ = (λ 1,..., λ M ) D, the barycentrc coordnates of the mage µ := P(λ) = (µ 1,..., µ M ) are defned as (4.46) (4.47) (4.48) µ j := 0 f N j Π µ j := λ j f N j Π and j q (. e. j C \ {q}) µ q := 1 λ. C\{q} We can mmedately observe that d j=0 µ j = 1. Lemma 4.2. Consder a face Π spec havng dmenson (d 1) of a polytope D R d. Suppose that the nodes ncdent upon Π spec are N p(1),...,n p(z). For every vertex N q Π spec, we have (4.49) P Π spec,n q (λ) = λ, for each λ = (λ 1,..., λ M ) such that λ = 0 for N {N p(1),..., N p(z) }. PROOF. Consder λ = (λ 1,..., λ M ) such that λ = 0 for N {N p(1),..., N p(z) } and let us denote µ := P Π spec,n q (λ). We want to show that µ j = λ j n whch we examne several stuatons about j = 1,..., M. Frst, consder j {p(1),..., p(z)}. Thus, we have λ j = 0. Snce N j Π spec, we deduce from (4.46) that µ j = 0. Hence, µ j = λ j. Consder now an ndex j {p(1),..., p(z)} such that N j N q. By the defnton of P n (4.47), we obtan µ j = λ j. On the other hand, due to the partton of unty, we obtan: (4.50) µ q = 1 µ = 1 (4.51) = 1 {p(1),...,p(z)}\{q} N λ = λ q. =1 q {p(1),...,p(z)}\{q} That means, for any j = 1,..., M we always have µ j = λ j. As a consequence, we obtan P Π spec,n q (λ) = λ for such λ. λ Q.E.D.

14 14 Lemma 4.3. Consder a face Π spec havng dmenson (d 1) of a polytope D R d whch s n general poston. Let a node N q be ncdent upon Π spec. Suppose that Π spec s supported by the hyperplane H r. Consder two faces (4.52) (4.53) Π = Π P := H r [ P\{r} H ] [ J \P H σ ] W q, Π = Π P := Hr σr [ P\{r} H ] [ J \P H σ ] W q such that dm(π) and dm( Π) have dfferent party. We have the followng dentty (4.54) ( 1) dm(π) B P Π,Nq (λ) + ( 1) dm( Π) B P Π,N q (λ) = 0 for all λ = (λ 1,..., λ M ) such that λ = 0 for N Π spec. PROOF. Observe frst that Π Π spec whereas Π Π spec. Consder µ := P Π,Nq (λ) and µ := P Π,N q (λ). We ntend to demonstrate that µ j = µ j for each j = 1,..., M. We wll consder several cases wth respect to j = 1,..., M. Case 1: If N j Π spec then by hypothess we have λ j = 0. Snce Π Π spec, N j s not ncdent upon Π ether. Hence, accordng to (4.46) about the defnton of P we obtan µ j = 0. As for the determnaton of µ j, we consder two stuatons. If N j Π, we obtan from (4.47) that µ j = λ j = 0. In the stuaton N j Π, we deduce from (4.46) that µ j = 0. Thus, n both stuatons, we have µ j = µ j. Case 2: Suppose now that N j Π spec and that N j N q. We consder agan two stuatons. In the stuaton where N j Π, we have µ j = 0. Snce Π Π, we have also N j Π. Thus, µ j = 0. Hence, µ j = µ j. Consder now the stuaton where N j Π. That s µ j = λ j. Snce N j s a face of D, we have from (3.16) (4.55) N j = L H z where z {0, σ }. Snce N j Π spec whch s supported by H r, z r = 0 so that relaton (4.55) becomes (4.56) N j = H r [ L\{r} H z ]. We apply the same process to N j Π n order to obtan (4.57) N j = H r [ P\{r} H ] [ L\P H z ] where z {0, σ } f L \ P. That s to say N j Π. As a consequence, µ j = λ j or equvalently µ j = µ j.

15 15 Case 3: Suppose now that N j = N q. From the frst two cases, we mmedately obtan (4.58) µ q = 1 M µ = 1 =1 q M µ = µ q. =1 q Therefore, we obtan P Π,Nq (λ) = P Π,N q (λ). As a result, we deduce (4.59) ( 1) dm(π) B P Π,Nq (λ) = ( 1) dm(π) B P Π,Nq (λ). Q.E.D. 5. Constructon of the transfnte nterpolaton In the prevous sectons, we saw dfferent defntons and lemmas for the generaton of the projectons on faces. Now, we want to use them to construct a transfnte nterpolaton on the whole polytope D Blendng functons and topologc formula. To generalze the case of 2D Coons map, let us ntroduce the noton of barycentrc blendng functons defned for all λ = (λ 1,..., λ M ) n the reference doman D. In fact, we defne them to be a set of functons b, = 1,..., M admttng the followng three propertes: (5.60) (5.61) (5.62) (P1) If λ p = 0 n λ = (λ 1,..., λ M ) then b p (λ) = 0, (P2) For each p = 1,..., M, we have b p (λ) = 1 f λ j = δ j,p, M (P3) b (λ) = 1 λ = (λ 1,..., λ M ) D. =1 As n the case of 2D transfnte nterpolatons, the smplest way of choosng the blendng functons s to use the lnear ones whch are n the current case: (5.63) b (λ) := λ, = 1,..., M. Theorem 5.1. Consder a polytope D R d n general poston havng M nodes N 1,..., N M. The functon M (5.64) T [B](λ) = ( 1) d+1 b (λ) ( 1) dm(π) B P Π,N (λ) =1 Π G() determnes a transfnte nterpolaton. Thus, for a facet Π spec of D such that the nodes of Π spec are N p(1),...,n p(z), we have (5.65) T [B](λ) = B(λ) for every λ = (λ 1,..., λ M ) such that λ q = 0 for all q {p(1),..., p(z)}.

16 16 PROOF. Let us consder λ such that λ q = 0 for all q V := {p(1),..., p(z)}. We obtan from property (P1) of the barycentrc blendng functons b n (5.60) that (5.66) (5.67) M T [B](λ) = ( 1) d+1 b (λ) ( 1) dm(π) B P Π,N (λ) =1 = ( 1) d+1 q V Π G() b q (λ) Π G(q) ( 1) dm(π) B P Π,Nq (λ). Let us denote by F(q, Π spec ) the set G(q) \ {Π spec } so that we obtan T [B](λ) = ( 1) [ d+1 b q (λ) ( 1) d 1 B P Π spec,n q(λ) + q V ] ( 1) dm(π) B P Π,Nq (λ). Π F(q,Π spec ) We use now Lemma 4.1 to partton F(q, Π spec ) nto F 1 (q, Π spec ) := G 1 (q, Π spec )\{Π spec } and F 2 (q, Π spec ) := G 2 (q, Π spec )\{D}. Consequently, we break up the above summaton as T [B](λ) = ( 1) [ d+1 b q (λ) ( 1) d 1 B P Π spec,n q(λ) + q V ] ( 1) dm(π) B P Π,Nq (λ) + ( 1) dm(π) B P Π,Nq (λ). Π F 1 (q,π spec ) As a result, we obtan T (λ) = ( 1) d+1 q V Π F 1 (q,π spec ) Π F 2 (q,π spec ) [ b q (λ) ( 1) d 1 B P Π spec,n q (λ) + ( )] ( 1) dm(π) B P Π,Nq (λ) + ( 1) dm( Π) B (λ). P Π,Nq where Π F 2 (q, Π spec ) s the unque face correspondng to Π F 1 (q, Π spec ) as specfed n (4.38). Due to a combnaton of property (C2) n Lemma 4.1 and Lemma 4.3, the last two terms cancel out smultaneously, so that we obtan (5.68) T (λ) = ( 1) d+1 q V ( 1) d 1 b q (λ) B P Π spec,n q (λ). Accordng to relaton (4.49) of Lemma 4.2, P Π spec,n q (λ) = λ rrespectve of q V. Hence, (5.69) T (λ) = B(λ) q V b q (λ) = B(λ). Q.E.D.

17 Affne stablty. In ths secton, we would lke to concentrate on the proof of the affne stablty of the proposed transfnte nterpolaton. Theorem 5.2. For the d-dmensonal polytope D n general poston havng nodes N 1,..., N M, the nterpolant M (5.70) T [B](λ) := ( 1) d+1 b q (λ) ( 1) dm(π) B P Π,Nq (λ) s affnely stable. Thus, we have q=1 Π G(q) (5.71) T [ A(B) ] = A ( T [B] ) for any affne transform A. PROOF. Let ( us consder an affne transform A : R p R p. Thus, we have the property that ) A j I µ jv j = j I µ ja(v j ) for any coeffcents (µ j ) j I such that j I µ j = 1. For each node N q ncdent upon the polytope D, let us agan consder J (q) L such that N q = [ J (q) H ] [ L\J (q) H σ ] as ntroduced n relaton (4.32). Hence, every face Π of D upon whch N q s ncdent must be of the form (5.72) Π = Π K := [ K H ] [ J \K H σ ] Wq where K J. On the one hand, by applyng (3.20) to the subarrangement (5.73) B := {H where J } A, we obtan the topologc closure (5.74) = J H σ K J ( [ ] [ ] ) K H J \K H σ. (Observe that (5.74) s not the unon over K J of Π K because we have L \ K n (5.72) an ntersecton wth W q ). As a consequence, snce we took the unon of dsjont sets n (5.74) we obtan ( ) χ H σ = [ ] ] χ( ) K H [ J \K H σ K J J = K J = K J = K J [ ] ] exp 1 dm( ) K H [ J \K H σ [ ] ] ) exp 1 dm( K H [ L\K H σ Wq ( 1) dm ( Π K ).

18 18 On the other hand, ( χ J ) H σ = χ(r d ) χ ( R d \ ) H σ J = ( 1) d χ ( J H ρ ) where ρ := σ. From the ncluson-excluson property of the Euler-Poncaré operator, we have χ( H ρ ) = χ(h ρ ) χ(h ρ H ρ j j ) + J J <j,j J + <j<k,j,k J χ(h ρ H ρ j j H ρ k k ) + ( 1)card(J ) χ( H ρ ). J For any subset R J, we have R Hρ because each H contans N q for J. Therefore, we have dm( R Hρ ) = d because ρ 0. Hence, χ( R Hρ ) = ( 1)d. As a consequence, we obtan (5.75) (5.76) χ( card(j ) H ρ ) = ( ) card(j ) ( 1) j 1 ( 1) d j J j=1 card(j ) ( ) card(j ) = ( 1) d+1 ( 1) j j (5.77) = ( 1) d+1 ( 1) = ( 1) d. Hence, χ( ( J Hρ ) ) = ( 1)d. That mples χ J Hσ ( ) K J ( 1)dm Π K = 0. That s, (5.78) ( 1) dm(d) + ( 1) dm(π) = 0 whch means (5.79) ( 1) d+1 Π G(q) Π G(q) j=1 ( 1) dm(π) = 1. As a consequence, we obtan that the coeffcents sum to unty such as M (5.80) ( 1) d+1 b q (λ) ( 1) dm(π) = q=1 Π G(q) whch mples the affne stablty (5.71). M b q (λ) = 1. q=1 = 0. Hence, we obtan Q.E.D.

19 19 (a) (b) (c) (d) Fgure 6. Transfnte nterpolaton defned on some convex polytopes. In (d) we recognze the usual Coons patch where the polygon of defnton s the unt square Concluson and llustratve results. In order to solve the problem of transfnte nterpolaton, we have proposed a topologc formula of the form M (5.81) ( 1) d+1 b (λ) ( 1) dm(π) B P Π,N (λ) =1 Π G() where G() s the set of topologc enttes upon whch the node N s ncdent. In contrast to some other methods, the presented technque enables the treatment of multfaceted domans whch are not necessarly of tensor product structure. Dong further analytcal works wth such short formula should be more practcal than usng long ones. Therefore, we beleve that the above method has good applcatons n theoretcal analyss such

20 20 as search for upper bounds or error estmatons. Unfortunately, we could only prove the result under the condton of general poston of the polytopes. We thnk that such a condton s only redundant and the formula remans vald wthout any postonal restrcton but the proof for that seems to be very dffcult. That wll be an open queston whch we mght treat n the future. On the other hand, the above method can also be used n appled stuatons. For nstance, let us brefly show some practcal results from the formerly proposed approach. Note that the results shown here are not meant to be a substtuton of the demonstratons. They are only for llustratve purpose. We have consdered some transfnte nterpolatons where the boundary curves or surfaces are gven. We appled the above transfnte nterpolaton to fnd the mages nsde the convex domans. In Fg.6, we have gathered the results whch consst of the mage by the transfnte nterpolaton of some dscretzaton wthn some convex domans. Acknowledgment Durng the PhD work of the author, Prof. Brunnett (Unversty of Chemntz) has helped hm n the topc of computatonal geometry. Prof. Schneder (Unversty of Berln) and Prof. Harbrecht (Unversty of Bonn) have supported the author n hs Post-doctoral postons. The author s grateful to the HCM (Hausdorff Center for Mathematcs) and ts Excellence Cluster program for supportng hs vst at the Unversty of Bonn. References [1] G. Brunnett: Geometrc desgn wth trmmed surfaces. Comput. Suppl. 10, (1995). [2] CFD General Notaton System (Standard Interface Data Structures), [3] S. Coons: Surfaces for computer aded desgn of space forms. Project MAC, Department of Mechancal Engneerng n MIT, Revsed to MAC-TR-41, (1967). [4] H. Coxeter: Regular polytopes, The Macmllan Company, New York, [5] D. Eppsten: Nneteen Proofs of Euler s formula: V E + F = 2. The geometry junkyard, eppsten/junkyard/euler, [6] G. Farn, D. Hansford: Dscrete Coons patches, Comput. Aded Geom. Des. 16, No. 7, (1999). [7] A. Forrest: On Coons and other methods for the representaton of curved surfaces. Comput. Graph. Img. Process. 1, (1972). [8] W. Gordon, C. Hall: Constructon of curvlnear co-ordnate systems and applcatons to mesh generaton. Int. J. Numer. Methods Eng. 7, (1973). [9] W. Gordon, C. Hall: Transfnte element methods: blendng-functon nterpolaton over arbtrary curved element domans. Numer. Math. 21, (1973).

21 21 [10] J. Gregory: Interpolaton to boundary data on the smplex. Comput. Aded Geom. Des. 2, (1985). [11] H. Harbrecht, M. Randranarvony: From Computer Aded Desgn to wavelet BEM. To appear n Journal Comput. Vs. Sc., (2008). [12] A. Perronnet: Interpolaton transfne sur le trangle, le tetraèdre et le pentaèdre. Applcaton à la créaton de mallage et à la condton de Drchlet. C. R. Acad. Sc., Pars, Sér. I, Math. 326, No (1998). [13] H. Poncaré: Sur la généralsaton d un Théorème d Euler relatf aux polyèdre. Comptes rendus hebdomadares des séances de l Academe des Scences. Pars, 117, (1893). [14] H. Prautzsch, W. Boehm, M. Paluszny: Bézer and B-Splne technques, Sprnger, Berln, [15] M. Randranarvony, G. Brunnett: Preparaton of CAD and molecular surfaces for meshfree solvers. In: Proc. Meshfree Methods for Partal Dfferental Equatons, Bonn, LNCS Sprnger, (2007). [16] M. Randranarvony: Geometrc processng of CAD data and meshes as nput of ntegral equaton solvers. PhD thess, Technsche Unverstät Chemntz, [17] M. Randranarvony, G. Brunnett: Molecular surface decomposton usng geometrc technques. In: Proc. Conf. Bldverarbetung für de Medzne, Berln, (2008). [18] M. Randranarvony: Quadrlateral Decomposton by two-ear property resultng n CAD segmentaton. In: Proc. Ffth Internatonal Conference on Computatonal Geometry, Vence, (2008). [19] L. Schläfl: Theore der velfachen Kontnutät. Denkschrften der Schwezerschen naturforschenden Gesellschaft. 38, (1901). [20] H. Sedel: Polar forms for geometrcally contnuous splne curves of arbtrary degree. ACM Trans. Graph. 12, No. 1, 1 34 (1993). Maharavo Randranarvony, Insttut für Numersche Smulaton, Unverstät Bonn, Wegelerstr. 6, Bonn, Germany. E-mal address: randran@ns.un-bonn.de

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

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

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

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

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

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

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

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

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

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

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

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

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 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

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

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

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

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

Injective Shape Deformations Using Cube-Like Cages

Injective Shape Deformations Using Cube-Like Cages 309 Injectve Shape Deformatons Usng Cube-Lke Cages Jr Kosnka 1 and Mchael Barton 2 1 Unversty of Oslo, jr.kosnka@cma.uo.no 2 Technon, barton@cs.technon.ac.l ABSTRACT The present paper nvestgates an applcaton

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

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

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

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

Semi - - Connectedness in Bitopological Spaces

Semi - - Connectedness in Bitopological Spaces Journal of AL-Qadsyah for computer scence an mathematcs A specal Issue Researches of the fourth Internatonal scentfc Conference/Second صفحة 45-53 Sem - - Connectedness n Btopologcal Spaces By Qays Hatem

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

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

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

the nber of vertces n the graph. spannng tree T beng part of a par of maxmally dstant trees s called extremal. Extremal trees are useful n the mxed an

the nber of vertces n the graph. spannng tree T beng part of a par of maxmally dstant trees s called extremal. Extremal trees are useful n the mxed an On Central Spannng Trees of a Graph S. Bezrukov Unverstat-GH Paderborn FB Mathematk/Informatk Furstenallee 11 D{33102 Paderborn F. Kaderal, W. Poguntke FernUnverstat Hagen LG Kommunkatonssysteme Bergscher

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

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

Module 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell

Module 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell Module 6: FEM for Plates and Shells Lecture 6: Fnte Element Analyss of Shell 3 6.6. Introducton A shell s a curved surface, whch by vrtue of ther shape can wthstand both membrane and bendng forces. A shell

More information

Face numbers of nestohedra

Face numbers of nestohedra Face numbers of nestohedra from Faces of generalzed permutohedra, math.co/0609184 jont wth A. Postnkov and L. Wllams. Mnsymposum Algebrasche und geometrsche Kombnatork Erlangen 16 September 2008 Vc Rener

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

Line Clipping by Convex and Nonconvex Polyhedra in E 3

Line Clipping by Convex and Nonconvex Polyhedra in E 3 Lne Clppng by Convex and Nonconvex Polyhedra n E 3 Václav Skala 1 Department of Informatcs and Computer Scence Unversty of West Bohema Unverztní 22, Box 314, 306 14 Plzeò Czech Republc e-mal: skala@kv.zcu.cz

More information

Some Tutorial about the Project. Computer Graphics

Some Tutorial about the Project. Computer Graphics Some Tutoral about the Project Lecture 6 Rastersaton, Antalasng, Texture Mappng, I have already covered all the topcs needed to fnsh the 1 st practcal Today, I wll brefly explan how to start workng on

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

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

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

Structured Grid Generation Via Constraint on Displacement of Internal Nodes

Structured Grid Generation Via Constraint on Displacement of Internal Nodes Internatonal Journal of Basc & Appled Scences IJBAS-IJENS Vol: 11 No: 4 79 Structured Grd Generaton Va Constrant on Dsplacement of Internal Nodes Al Ashrafzadeh, Razeh Jalalabad Abstract Structured grd

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

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

APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF

APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF Johannes Leebmann Insttute of Photogrammetry and Remote Sensng, Unversty of Karlsruhe (TH, Englerstrasse 7, 7618 Karlsruhe, Germany - leebmann@pf.un-karlsruhe.de

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

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

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

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

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

Face Recognition University at Buffalo CSE666 Lecture Slides Resources: Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

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

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

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

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

Geometric Error Estimation

Geometric Error Estimation Geometrc Error Estmaton Houman Borouchak Project-team GAMMA 3 UTT Troyes, France Emal: houman.borouchak@utt.fr Patrck Laug Project-team GAMMA 3 INRIA Pars - Rocquencourt, France Emal: patrck.laug@nra.fr

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

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

Ramsey numbers of cubes versus cliques

Ramsey numbers of cubes versus cliques Ramsey numbers of cubes versus clques Davd Conlon Jacob Fox Choongbum Lee Benny Sudakov Abstract The cube graph Q n s the skeleton of the n-dmensonal cube. It s an n-regular graph on 2 n vertces. The Ramsey

More information

Pose, Posture, Formation and Contortion in Kinematic Systems

Pose, Posture, Formation and Contortion in Kinematic Systems Pose, Posture, Formaton and Contorton n Knematc Systems J. Rooney and T. K. Tanev Department of Desgn and Innovaton, Faculty of Technology, The Open Unversty, Unted Kngdom Abstract. The concepts of pose,

More information

A Topology-aware Random Walk

A Topology-aware Random Walk A Topology-aware Random Walk Inkwan Yu, Rchard Newman Dept. of CISE, Unversty of Florda, Ganesvlle, Florda, USA Abstract When a graph can be decomposed nto clusters of well connected subgraphs, t s possble

More information

PROPERTIES OF BIPOLAR FUZZY GRAPHS

PROPERTIES OF BIPOLAR FUZZY GRAPHS Internatonal ournal of Mechancal Engneerng and Technology (IMET) Volume 9, Issue 1, December 018, pp. 57 56, rtcle ID: IMET_09_1_056 valable onlne at http://www.a aeme.com/jmet/ssues.asp?typeimet&vtype

More information

International Journal of Scientific & Engineering Research, Volume 7, Issue 5, May ISSN Some Polygonal Sum Labeling of Bistar

International Journal of Scientific & Engineering Research, Volume 7, Issue 5, May ISSN Some Polygonal Sum Labeling of Bistar Internatonal Journal of Scentfc & Engneerng Research Volume 7 Issue 5 May-6 34 Some Polygonal Sum Labelng of Bstar DrKAmuthavall SDneshkumar ABSTRACT- A (p q) graph G s sad to admt a polygonal sum labelng

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

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

Inverse-Polar Ray Projection for Recovering Projective Transformations

Inverse-Polar Ray Projection for Recovering Projective Transformations nverse-polar Ray Projecton for Recoverng Projectve Transformatons Yun Zhang The Center for Advanced Computer Studes Unversty of Lousana at Lafayette yxz646@lousana.edu Henry Chu The Center for Advanced

More information