Discrete Curvature and Torsion-based Parameterization Scheme for Data Points

Size: px
Start display at page:

Download "Discrete Curvature and Torsion-based Parameterization Scheme for Data Points"

Transcription

1 Dscrete Curvature and Torson-based Parameterzaton Scheme for Data Ponts Xongbng Fang Chna Shp Development and Desgn Center Wuhan, 4364, Chna E-mal: Sheng Wu Chna Shp Development and Desgn Center Wuhan, 4364, Chna E-mal: Jangyuan Lu Chna Shp Development and Desgn Center Wuhan, 4364, Chna E-mal: Parameterzaton for data ponts s a fundamental problem n the feld of Computer Aded Geometrc Desgn. Recently, an mproved centrpetal parameterzaton technque s proposed by Fang et al and ts superorty to other common methods, such as unform method, chord length method, centrpetal method, Foley method and unversal method, etc., s valdated by a lot of numercal examples. In ths artcle, a refned formula s frstly gven to resolve the problem that the parameter values obtaned by Fang s method are usually a lttle bgger than the optmum ones. Furthermore, as enlghtened by the local dfferental geometrc propertes of parametrc curves, a novel parameterzaton scheme s put forward by ntroducng the dscrete curvature and torson nformaton at each pont. As ndcated by numercal experments, the devaton measured by a curvature and Euler dstance-based crteron between the nterpolaton B-splne curve obtaned by our method and the polylne constructed by the ponts are smaller than the ones between the curves obtaned by Fang s method, the chord length method, the standard centrpetal method and the polylne. The proposed algorthm s applcable to both 2D and 3D ponts and has a dstnct advantage for 3D ponts as compared wth the three aforementoned methods. PoS(CENet27)93 CENet July 27 Shangha, Chna Speaker and Correspondng author Copyrght owned by the author(s) under the terms of the Creatve Commons Attrbuton-NonCommercal-NoDervatves 4. Internatonal Lcense (CC BY-NC-ND 4.).

2 Dscrete Curvature and Torson-based Parameterzaton Scheme for Data Ponts. Introducton Xongbng Fang Parameterzaton for a set of data ponts s one of the fundamental problems n curve and surface nterpolaton applcatons[-3]. Approprate parameters of data ponts can be further used to construct a knot vector and compute the control ponts of the nterpolaton curve. The common parameterzaton methods are unform[], chord length[4], centrpetal[5,], Foley[6] and unversal methods[7,8], among whch the chord length and centrpetal methods are the most popular parameterzaton algorthm n the CAGD communty. Recently, a refned centrpetal parameterzaton method s presented by Fang et al[9]. All the aforementoned methods are obtaned by manly takng planar ponts as research focus and utlzng the nformaton of dstance between any two successve ponts, the angle between two successve lnes and the dscrete curvature at each pont, and they are usually used n 3D ponts parameterzaton and curve/surface nterpolaton problems drectly. The parameterzaton s also one of the key steps for 3D data ponts and surface nterpolaton[2,8]. At present, the famlar way s drectly applyng the above methods n 3D pont cases. For spacng ponts, there s usually an angle φ between the trangles constructed by the three consecutve ponts P -, P, P + and P, P +, P +2 (see Fg. ). It s evdent that the chord length and centrpetal methods only utlze the dstance nformaton. Furthermore, Fang used the nformaton of the external angle θ rather than the angle φ. When the value of φ s not equal to zero, the nterpolaton curve s not only crooked but also torsonal at the pont P +. From the dfferental geometry pont of vew, the local confguraton of a space curves at a pont s confrmed by both of the curvature and torson[]. In ths paper, we concentrate the problem of 3D ponts parameterzaton and a new parameterzaton scheme fully dstlled the hgh-order dfferental geometrc quanttes, such as dscrete curvature and torson, mpled by the ponts s put forward, whch s also approprate for 2D ponts. P -2 P - P ϕ V H P +2 θ P + Ω PoS(CENet27)93 Fgure : Spatal Structure of 3D Ponts 2. Data ponts parameterzaton 2.. B-splne curves B-splne has been proven to be the most popular representaton method for free-form curves and surfaces. In the paper, we adopt B-splne curve nterpolaton to llumnate our parameterzaton scheme. A k th -order B-splne curve s represented as n P() t = B jn jk, () t j= where {B j } s the control ponts, and {N j,k (t)} s the normalzed kth-order B-splne bass functons defned on the knot vector T={τ j } j=,,,n+k. The B-splne curve nterpolaton problem s formulated as follows. Gven the ponts {P } =n+, the assocatng parameter values t for each pont P can be obtaned by a parameterzaton method and the knot vector T can be computed by the average method [] as follows:

3 Dscrete Curvature and Torson-based Parameterzaton Scheme for Data Ponts τ = = τ k τ = = τ m k m Xongbng Fang j + k + τ = t, j =, 2,, n k. k = j Then the control ponts {B j } of a B-splne curve are unknowns to be calculated to satsfy P(t )=P, =,,, n,.e. the nterpolaton curve P(t) passng through the ponts at the assocated parameter values Common parameterzaton methods There are several classcal technques to choose the parameters {t }, such as unform, chord length, centrpetal, Foley and unversal method, etc.. The unform method does not use the dstance nformaton between each par of consecutve ponts, whle the chord length and centrpetal ones utlze the nformaton. The unform, chord length and centrpetal methods can be formulated unformly as follows. Let L =P P, =,, n, D n a = L, t =, Δt =t t, then the three methods can be = rewrtten as a t = L D (2.) Equaton (2.) denotes the unform, chord length and centrpetal parameterzaton when a=, a= and a=/2, respectvely. The Foley parameterzaton modfes the centrpetal method by adoptng a Nelson metrc to defne the dstance. It s formulated as 3 ˆ θd t = t t = d + 2 ( d+ d), 3 ˆ θn-d n-2 tn = tn tn- = dn- + 2 ( dn-2+ dn-), 3ˆ θ ˆ d 3θ d + + t = t t = d ( d + d) 2 ( d+ d+ ), For more detals about the defnton of d, please refer to [6]. Lm develops a new parameterzaton approach named unversal based on the above methods[7,8].the key dea of ths method s usng the parameter t assocated wth the maxmum of the bass functon N j,k (t). Among the aforementoned methods, Foley and the unversal parameterzaton are not very popular because of ther laborous computaton. The unform method s rarely used as ts bad parameterzaton effect for the fnal nterpolaton curves. So the popular parameterzaton methods n the context of CAGD are chord length and centrpetal algorthms. PoS(CENet27) Fang s parameterzaton method Fang et al provded a refnement of the classcal centrpetal parameterzaton method by ntroducng the dscrete curvature nformaton at each pont[9]. The geometrc ntuton of the method s that the flexure of a curve at one pont wll elongate the arc length around the neghborhood of the pont. For the ponts parameterzaton, t sgnfes the parameter nterval between the pont and the next one wll be augmented. Fang s method s formulated as.5 t = L D+ e (2.2)

4 Dscrete Curvature and Torson-based Parameterzaton Scheme for Data Ponts θl θ l Xongbng Fang = ( α + ) (2.3) 2sn( θ 2) 2sn( θ 2) e where θ and e are the exteror angle of the trangle ΔP - P P + and the parameter dsturbance quantty at pont P respectvely, the coeffcent α s determned as. by an expermental way, and l s the magntude of the shortest sde of the trangle ΔP - P P +. The characterstcs of Fang s method are summarzed as follows: () t has fully used the geometrc nformaton of dstance, angle and dscrete curvature of the gven pont set; (2) as compared wth the centrpetal and other methods, the fnal nterpolaton curve obtaned by Fang s has less devaton to the polylne constructed by the ponts and the parameters for the ponts are more optmzed. Moreover, ts computaton s also compact. 3. Curvature and torson-based parameterzaton 3.. Refnement of Fang s method [9] Fgure 2: Dscrete Curvature Crcle at Pont P A ds P In Fg. 2, Fang s method used the crcular arc P B of the crcumcrcle of the trangle ΔAP B to approxmate the arc length ncrement ds of the curve from P to B. Obvously, when use the crcumcrcle of the trangle ΔAP B to approxmate the local of the curve around P, the local of the curve s geometrcally nsde the crcle and that means the arc length of P B s bgger than ds. Based on the above observaton and the smulaton results of the method, we ve found that the dsturbance quantty e n Fang s artcle s bgger than ts optmum. Amng at the lmtaton, we gve a corrected way by usng the average of the chord length P B and the arc length P B to approxmate the ncrement ds,.e. ds = ( PB + θ r) 2. ds B PoS(CENet27)93 Suppose PB = (2.3), then one has l, the new dsturbance quantty s e e l + θ r l + θ r 2 2 = α ds nstead of e n Equaton = ( α + ) (3.) where l s the length of the shortest sde of the trangle ΔP - P P +, r =l /2snφ andφ =θ /2. Substtute them nto Equaton (3.) then t follows that: ϕ α l(+ ), = 2 snϕ ϕ ϕ = (+ ) + (+ ), = 2,, - ϕ α l (+ ), = n 2 snϕ e α l l n 2 snϕ snϕ (3.2) Thereby the parameter value for each pont P (=,, n) n the gven data set can be computed by

5 Dscrete Curvature and Torson-based Parameterzaton Scheme for Data Ponts Xongbng Fang.5 t = t + L D+ e (3.3) where t = Analyss for the two methods From Fg. 3, we can get the followng conclusons by analyzng the formulatons of Equaton (2.3) and (3.). () If ϕ [, π 2], then [,.57] sn ϕϕ, ϕ + snϕ [,.235]. It shows that the range of 2snϕ the value of Equaton (4) s smaller than that of Fang s. (2) If ϕ ncreases, then sn ϕϕ and ϕ + snϕ also ncrease, but the change rate of the 2snϕ latter s more slowly than that of the anteror one. For a same φ, the quantty computed by Equaton (3.) s smaller than that of Equaton (2.3). Consequently, the parameter correcton computed by Equaton (3.2) s smaller than that of Fang s. Fgure 3: Comparson of the Proposed Method and Fang s Method 3.3. Dscrete curvature and torson-based method e Gven a set of 3D ponts randomly, the fttng curves usually have torson as the ponts are not coplanar. The common parameterzaton methods lke chord length and centrpetal, and Fang s method usually take the geometrc nformaton of pont poston, lengths of lne segments, angles between the lne segments and the dscrete curvature at each pont nto account rather than the hgher-order geometrc nformaton of torson. Accordng to the local dfferental geometrc characterstcs of a space curve, the shape of the curve around a pont s only determned by the curvature and torson at the pont. Based on the method n Secton 3., a dscrete curvature and torson-based parameterzaton scheme s proposed for 3D ponts. There are a lot of methods to calculate the dscrete curvature and torson[-5]. In the paper, we choose the followng approach to estmate the torson at each pont[4, 5]. Let Δ =[L, L +, L +2 ], =2,, n-2, and [U, V, W] be the scalar trple product of the vectors U, V and W, then one has Fang's method method n secton PoS(CENet27)93 ˆ τ + = 3 L + L L L L L + L + L (3.4) where M N denotes the cross product of the vectors M and N, Δ denotes the volume of the hexahedron constructed by a trple of consecutve vectors L, L +, L +2, and ˆ τ s computed

6 Dscrete Curvature and Torson-based Parameterzaton Scheme for Data Ponts Xongbng Fang by Equaton (3.4) at ponts P 2, P 3,..., P n-, and equals zero at P, P, and P n. Fnally, the dscrete torson at each pont P (=2,,n-) s estmated as τˆ ˆ - + τ, > τ = +, (3.5) When the ponts P -2, P -, P and P + are coplanar, τ =; Otherwse, τ. The sgn and absolute value of τ determne the drecton and degree of the tortlty of the fnal nterpolaton curve at P, respectvely. Hence, the parameter correcton nduced by the torson at a pont can be expressed as f =β τ, where the scale β can be set as a constant or varable. Thus the parameter t assocatng wth P can be formulated as.5 = + L + + (3.6) t t D e f where e s computed by Equaton (3.). For 2D ponts, all the dscrete torsons calculated by Equaton (3.5) are zero, and thus the Equaton (3.6) s equvalent to Equaton (3.3). Consequently, the proposed method depcted by Equaton (3.6) s approprate for both 2D and 3D cases Crteron of nterpolaton precson measurement The knot vector and nterpolaton curve can be constructed after the parameter values beng computed by Equaton (3.6). Dfferent parameter values usually result n dfferent shapes of curves and the devaton values of those curves to the polylne of the data ponts may be dfferent. There are many crtera to measure the dvergence [6-8]. In the paper, we utlzed the curvature and Euler dstance-based crteron depcted n [9] to compare dfferent methods Value range for α and β Expermental results show that the optmum value of α has relaton wth the shortest sde length of the trangles constructed by each trple of consecutve ponts,.e. the bgger the sde length s, the smaller the value of α wll be. The value of the torson augmented coeffcent β has relaton wth the ponts torsons,.e. the bgger the torsons are, the smaller the optmum value of β wll be. In ths work, we recommend usng.5 as an ntal value for β. PoS(CENet27)93 4. Numercal experments and dscusson 4.. Numercal experments We compare our approach developed n Secton 3.3 wth the chord length [], centrpetal [,4] and Fang s methods [9] by four examples. For the sake of justce, the curvature and Euler dstance-based crteron for the devaton of the fnal nterpolaton curve from the data ponts s chosen as the unfed comparson standard for the four methods. We choose the cubc B-splne curve as nterpolaton curve and the average method to calculate the knot vector T={τ j }. Once the parameters {t } s get by one of the four approaches and the knot vector T s acheved, the nterpolaton curve wll be obtaned by algorthms for calculatng a system of lnear equatons [,,9] or by a robust progressve teraton algorthm[2,2] wth a small threshold, such as.* -8. Example. The data set contans 2 planar ponts,.e. P =[;], P =[2;.2], P 2 =[3;], P 3 =[4;.3], P 4 =[6;8], P 5 =[7;.25], P 6 =[7.5;2], P 7 =[8;.2], P 8 =[8.2;-3.2], P 9 =[;.3], P =[2;4], P =[5;-2]. The polylne connectng the ponts s shown n Fg. 4(a), and the cubc B-splne

7 Dscrete Curvature and Torson-based Parameterzaton Scheme for Data Ponts Xongbng Fang curves obtaned by Fang s, the proposed, the centrpetal and the chord length methods are shown n Fg. 4(b) to Fg. 4(e) respectvely. Dstance devatons computed by the four methods wth dfferent values of α are lsted n Table and the centrpetal method and the chord length one are rrelatve wth α. The Fang s method and the proposed one get the mnmum devatons.5249 and wth α=.6 and.7, respectvely. Fg. 4(e) shows that the fnal curve obtaned by chord length method has loops and spres, whch are not acceptant n CAD and CAGD domans a. Data ponts and the polylne b. Fang s method c. Proposed method PoS(CENet27)93 d. Centrpetal method e. Chord length method Fgure 4: Data ponts and nterpolaton curves by the four methods (Example ) α Fang s Proposed Centrpetal Chord length Table : Dstance devaton of the four methods n example Example 2. The data ponts are sampled from a hypotrochod curve determned by x= ((a-b) cos(t)+h cos((a-b)/b t)), y= ((a-b) sn(t)-h sn((a-b)/b t)), where a =,

8 Dscrete Curvature and Torson-based Parameterzaton Scheme for Data Ponts Xongbng Fang b=3/4, h=9/3, t=[-3π, 3π] and the samplng step=π/2. The data set contans 3 ponts and the polylne connected them s shown n Fg. 5(a). The cubc B-splne curves obtaned by Fang s method, the proposed method, the centrpetal method and the chord length method are shown n Fg. 5(b) to Fg. 5(e) respectvely. Dstance devatons computed by the four methods wth dfferent values of α are lsted n Table 2. Fang s method and the proposed one get the mnmum devatons and wth α=.7 and.8, respectvely a. Data ponts and the polylne b. Fang s method c. Proposed method PoS(CENet27)93 d. Centrpetal method e. Chord length method Fgure 5: Data ponts and nterpolaton curves by the four methods (Example 2) α Fang s Proposed Centrpetal Chord length Table 2: Dstance Devaton of the Four Methods n Example 2

9 Dscrete Curvature and Torson-based Parameterzaton Scheme for Data Ponts Xongbng Fang Example 3. The data set contans 93D ponts,.e. P =[;-2;], P =[;;], P 2 =[;;], P 3 =[;;], P 4 =[;2;], P 5 =[;3;-3.5], P 6 =[2;3;], P 7 =[2;.5;] and P 8 =[3;.5;]. The polylne connectng the ponts s shown n Fg. 6(a), and the cubc B-splne curves obtaned by Fang s method, the proposed method, the centrpetal method and the chord length method are shown n Fg. 6(b) to Fg. 6(e), respectvely. Dstance devatons computed by the four methods wth β= and dfferent values of α are lsted n Table 3, n whch, Fang s method and the proposed one get the mnmum devaton and wth α=.3, respectvely. Dstance devatons computed by our method wth α=.3and dfferent values of β are lsted n Table 4 and our method get the mnmum value at β= a. Data ponts and the polylne b. Fang s method c. Proposed method PoS(CENet27)93 d. Centrpetal method e. Chord length method Fgure 6: Data ponts and nterpolaton curves by the four methods (Example 3) α Fang s Proposed Centrpetal Chord length 5.422

10 Dscrete Curvature and Torson-based Parameterzaton Scheme for Data Ponts Table 3: Dstance Devaton of the Four methods n Example 3 (β=) Xongbng Fang β Proposed Table 4: Dstance devaton of the proposed method n example 3 (α=.3) Example 4. The data set contans nne3d ponts,.e. P =[2;;], P =[s;s;-], P 2 =[;2;], P 3 =[-s;s;-], P 4 =[-2;;], P 5 =[-s;-s;-], P 6 =[;-2;], P 7 =[s;-s;-] and P 8 =[2;;], where s = The polylne connectng the ponts s shown n Fg. 7(a), and the cubc B-splne curves obtaned by Fang s method, the proposed method, the centrpetal method and the chord length method are shown n Fg. 7(b) to Fg. 7(e) respectvely. Dstance devatons computed by the four methods wth β= and dfferent values of α are lsted n Table 5 and also the centrpetal and chord length methods are rrelatve wth α. In Table 6, Fang s method and the proposed acheve the mnmum devaton and wth α=.2, respectvely. The dstance devatons computed by our method wth α=.2 and dfferent values of β are lsted n Table 6 and our method s the mnmum value wth β= a. Data ponts and the polylne - b. Fang s method c. Proposed method PoS(CENet27)93 d. Centrpetal method e. Chord length method Fgure 7: Data ponts and nterpolaton curves by the four methods (Example 4) α Fang s Proposed Centrpetal Chord length Table 5: Dstance Devaton of the Four Methods n Example 4 (β=) β Proposed Table 6: Dstance Devaton of the Proposed Method n Example 4 (α=.2) 4.2. Dscusson

11 Dscrete Curvature and Torson-based Parameterzaton Scheme for Data Ponts Algorthms comparson Xongbng Fang From Table to Table 3, the mnmum dstance devaton of our method s smaller than that of the Fang s, centrpetal and chord length methods when the dscrete torson nformaton at each pont s not taken nto account. From Table 5, the mnmum devaton of our algorthm wth β= s smaller than that of the Fang s about From Table 3 to Table 6, the proposed method can effcently reduce the devatons when the dscrete torsons are taken nto account. As compared wth Fang s approach, the devaton values of the proposed scheme for Examples 3 and 4 reduce about and.3876, respectvely. As compared wth the centrpetal and chord length methods, the proposed one possesses many advantages. From Table to Table 6, the proposed method can obtan a mnmum devaton value n a large range of parameter values and there s a par of values of α and β that makes the parameterzaton results of our method beng fner than the other three ways Future work There are several possbltes for the extenson of our method; we lst a few of them as follows: () The parameters of the data ponts have tght relatons wth the knot vector T and both of them have coordnatve mportance for the shape of the fnal nterpolaton curve. However, the relatons among parameter values {t }, the knot vector T and the arc length parameter of the fnal curve are not very clear and t s worthy of much more research. (2) Another extenson s to adopt dfferent α and β for each parameter nterval Δt by takng the propertes of concave and convexty of the gven ponts nto account. 5. Concluson Amng at the shortages of common parameterzaton methods and Fang s mproved centrpetal method [9], a new parameterzaton method, based on dscrete curvature and torson, s provded and llumned by the local dfferental geometrc propertes of a space curve at one pont. Expermental results ndcate that the dstance devaton between the B-splne nterpolaton curve obtaned by our method and the polylne of data ponts s smaller when compared wth the centrpetal, chord length and Fang s parameterzaton, thus the proposed method s more excellent for 2D and 3D data ponts parameterzaton. PoS(CENet27)93 References [] L.A. Pegl and W. Tller. The NURBS Book[M]. Berln: Sprnger-Verlag (997) [2] S.M. Shamsuddn, M.A. Ahmed, Y. Saman. NURBS sknnng surface for shp hull desgn based on new parameterzaton method[j]. I.J.A.M.T. 28(9): (26) [3] J.F. Huang, S.L. Wan. The parametrc method of Frendshp hull form based on desgn feature [J]. Chnese Journal of Shp Research, 7(2): 79-85(22) [4] E. Lee. Choosng nodes n parametrc curve nterpolaton[j]. CAD, 2(6): (989) [5] J. Hoschek, D. Lasser. Fundamentals of computer aded geometrc desgn[m]. London: A.K. Peters, 993. [6] T.A. Foley, G.M. Nelson. Knot selecton for parametrc splne nterpolaton[c]. Mathematcal methods n computer aded geometrc desgn, Academc Press Professonal: (989) [7] C-G. Lm. A unversal parameterzaton n B-splne curve and surface nterpolaton [J]. CAGD, 6(5): (999)

12 Dscrete Curvature and Torson-based Parameterzaton Scheme for Data Ponts Xongbng Fang [8] C-G. Lm. Unversal parameterzaton n constructng smoothly-connected B-splne surfaces[j]. CAGD, 9(6): (22) [9] J.J. Fang, C.L. Hung. An mproved parameterzaton method for B-splne curve and surface nterpolaton[j]. CAD, 45(6): 5-28(23) [] N.M. Patrkalaks, T. Maekawa. Shape Interrogaton for Computer Aded Desgn and Manufacturng[M]. Berln: Sprnger (22) [] D. Coeurjolly, S. Mguet, T. Laure. Dscrete Curvature Based on osculatng crcle estmaton[c].lecture notes n computer scence, Hedelberg: Sprnger (2) [2] G.H. Lu, Y.S. Wong, Y.F. Zhang, H.T. Loh. Adaptve farng of dgtzed pont data wth dscrete curvature[j]. CAD, 34(4), 39-32(22) [3] T. Lewner, JD Gomes Jr., H. Lopes, M. Crazer. Curvature and torson estmators based on parametrc curve fttng[j]. C&G, 29(5): (25) [4] V.P. Kong, BH Ong. Shape preservng F3 curve nterpolaton[j]. CAGD, 9(4): (22) [5] V.P. Kong, BH Ong. Shape preservng approxmaton by spatal cubc splnes[j]. CAGD, 26(26): (29) [6] WP Wang, H Pottmann, Y Lu. Fttng B-splne curves to pont clouds by curvature-based squared dstance mnmzaton[j]. ACM TOG, 25(2): (26) [7] H Park, J-H Lee. B-splne curve fttng based on adaptve curve refnement usng domnant ponts[j]. CAD, 39(6): (27) [8] CM Zhang, WP Wang, JY Wang, XM L. Local computaton of curve nterpolaton knots wth quadratc precson[j]. CAD, 45(4): (23) [9] S Gofuku, S Tamura, T Maekawa. Pont-tangent/pont-normal B-splne curve nterpolaton by geometrc algorthms[j]. CAD, 4(6): (29) [2] HW Ln, HJ Bao, GJ Wang. Totally postve bases and progressve teraton approxmaton[j]. Computers and Mathematcs wth Applcatons, 5(3-4): (25) [2] LZ Lu. Weghted progressve teraton approxmaton and convergence analyss[j]. CAGD, 27(2): 29-37(2) PoS(CENet27)93

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

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

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

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

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

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

More information

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 Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

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

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

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

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

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

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng

More information

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

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

More information

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

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

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

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

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

Active Contours/Snakes

Active Contours/Snakes Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng

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

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

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

Cubic Spline Interpolation for. Petroleum Engineering Data

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

More information

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

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

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

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

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

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Positive Semi-definite Programming Localization in Wireless Sensor Networks Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer

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

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

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

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

Nonlocal Mumford-Shah Model for Image Segmentation

Nonlocal Mumford-Shah Model for Image Segmentation for Image Segmentaton 1 College of Informaton Engneerng, Qngdao Unversty, Qngdao, 266000,Chna E-mal:ccluxaoq@163.com ebo e 23 College of Informaton Engneerng, Qngdao Unversty, Qngdao, 266000,Chna E-mal:

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

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

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

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water. Purpose Theory REFRACTION a. To study the refracton of lght from plane surfaces. b. To determne the ndex of refracton for Acrylc and Water. When a ray of lght passes from one medum nto another one of dfferent

More information

Discrete Schemes for Gaussian Curvature and Their Convergence

Discrete Schemes for Gaussian Curvature and Their Convergence Dscrete Schemes for Gaussan Curvature and Ther Convergence Zhqang Xu Guolang Xu Insttute of Computatonal Math. and Sc. and Eng. Computng, Academy of Mathematcs and System Scences, Chnese Academy of Scences,

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

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

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

A high precision collaborative vision measurement of gear chamfering profile

A high precision collaborative vision measurement of gear chamfering profile Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) A hgh precson collaboratve vson measurement of gear chamferng profle Conglng Zhou, a, Zengpu Xu, b, Chunmng

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

1. Introduction. 2. Related Work

1. Introduction. 2. Related Work ASIAGRAPH 008 PROCEEDINGS Curvature Estmaton of 3D Pont Cloud Surfaces Through the Fttng of Normal Secton Curvatures Xaopeng Zhang* /LIAMA-NLPR, Insttute of Automaton, CAS; Hongjun L /LIAMA-NLPR, Insttute

More information

An Image Fusion Approach Based on Segmentation Region

An Image Fusion Approach Based on Segmentation Region Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua

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

Parameterization of Quadrilateral Meshes

Parameterization of Quadrilateral Meshes Parameterzaton of Quadrlateral Meshes L Lu 1, CaMng Zhang 1,, and Frank Cheng 3 1 School of Computer Scence and Technology, Shandong Unversty, Jnan, Chna Department of Computer Scence and Technology, Shandong

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Computers & Graphics

Computers & Graphics Computers & Graphcs 35 (2011) 967 975 Contents lsts avalable at ScenceDrect Computers & Graphcs journal homepage: www.elsever.com/locate/cag Techncal Secton An extended teratve format for the progressve-teraton

More information

Feature Estimation and Registration of Point Clouds in Reverse Engineering

Feature Estimation and Registration of Point Clouds in Reverse Engineering Amercan Journal of Mechancal and Materals Engneerng 017; 1(4): 83-87 http://www.scencepublshnggroup.com/j/ajmme do: 10.11648/j.ajmme.0170104.15 Feature Estmaton and Regstraton of Pont Clouds n Reverse

More information

Visual Curvature. 1. Introduction. y C. IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), June 2007

Visual Curvature. 1. Introduction. y C. IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), June 2007 IEEE onf. on omputer Vson and Pattern Recognton (VPR June 7 Vsual urvature HaRong Lu, Longn Jan Lateck, WenYu Lu, Xang Ba HuaZhong Unversty of Scence and Technology, P.R. hna Temple Unversty, US lhrbss@gmal.com,

More information

The Evaluation and Correction of the Reconstructed NURBS Surface Smoothing and Accuracy

The Evaluation and Correction of the Reconstructed NURBS Surface Smoothing and Accuracy Sensors & Transducers 2013 by IFSA http://www.sensorsportal.com The Evaluaton and Correcton of the Reconstructed NURBS Surface Smoothng and Accuracy Shgang WANG, Janzhou ZHANG, Yong YAN School of Mechatroncs

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

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

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent

More information

Fast Computation of Shortest Path for Visiting Segments in the Plane

Fast Computation of Shortest Path for Visiting Segments in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang

More information

EVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS

EVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS Academc Research Internatonal ISS-L: 3-9553, ISS: 3-9944 Vol., o. 3, May 0 EVALUATIO OF THE PERFORMACES OF ARTIFICIAL BEE COLOY AD IVASIVE WEED OPTIMIZATIO ALGORITHMS O THE MODIFIED BECHMARK FUCTIOS Dlay

More information

X- Chart Using ANOM Approach

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

More information

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

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

Robust Curvature Estimation and Geometry Analysis of 3D point Cloud Surfaces

Robust Curvature Estimation and Geometry Analysis of 3D point Cloud Surfaces Robust Curvature Estmaton and Geometry Analyss of 3D pont Cloud Surfaces Xaopeng ZHANG, Hongjun LI, Zhangln CHENG, Ykuan ZHANG Sno-French Laboratory LIAMA, Insttute of Automaton, CAS, Bejng 100190, Chna

More information

Design of Structure Optimization with APDL

Design of Structure Optimization with APDL Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth

More information

Shape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram

Shape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram Shape Representaton Robust to the Sketchng Order Usng Dstance Map and Drecton Hstogram Department of Computer Scence Yonse Unversty Kwon Yun CONTENTS Revew Topc Proposed Method System Overvew Sketch Normalzaton

More information

An inverse problem solution for post-processing of PIV data

An inverse problem solution for post-processing of PIV data An nverse problem soluton for post-processng of PIV data Wt Strycznewcz 1,* 1 Appled Aerodynamcs Laboratory, Insttute of Avaton, Warsaw, Poland *correspondng author: wt.strycznewcz@lot.edu.pl Abstract

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

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

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process

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

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and

More information

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

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

More information

FPGA-based implementation of circular interpolation

FPGA-based implementation of circular interpolation Avalable onlne www.jocpr.com Journal of Chemcal and Pharmaceutcal Research, 04, 6(7):585-593 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 FPGA-based mplementaton of crcular nterpolaton Mngyu Gao,

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

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

Complex Filtering and Integration via Sampling

Complex Filtering and Integration via Sampling Overvew Complex Flterng and Integraton va Samplng Sgnal processng Sample then flter (remove alases) then resample onunform samplng: jtterng and Posson dsk Statstcs Monte Carlo ntegraton and probablty theory

More information

Dynamic wetting property investigation of AFM tips in micro/nanoscale

Dynamic wetting property investigation of AFM tips in micro/nanoscale Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen

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

The Theory and Application of an Adaptive Moving Least. Squares for Non-uniform Samples

The Theory and Application of an Adaptive Moving Least. Squares for Non-uniform Samples Xanpng Huang, Qng Tan, Janfe Mao, L Jang, Ronghua Lang The Theory and Applcaton of an Adaptve Movng Least Squares for Non-unform Samples Xanpng Huang, Qng Tan, Janfe Mao*, L Jang, Ronghua Lang College

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

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

Wireless Sensor Network Localization Research

Wireless Sensor Network Localization Research Sensors & Transducers 014 by IFSA Publshng, S L http://wwwsensorsportalcom Wreless Sensor Network Localzaton Research Lang Xn School of Informaton Scence and Engneerng, Hunan Internatonal Economcs Unversty,

More information

Development of a CNC interpolation scheme for CNC controller based on Runge-Kutta method. Abdullahil Azeem*, Syed Mithun Ali and Sanjoy Kumar Paul

Development of a CNC interpolation scheme for CNC controller based on Runge-Kutta method. Abdullahil Azeem*, Syed Mithun Ali and Sanjoy Kumar Paul Int. J. Computer Aded Engneerng and Technology, Vol. 4, No. 5, 01 445 Development of a CNC nterpolaton scheme for CNC controller based on Runge-Kutta method Bddut Bhattacharjee Unversty of Brtsh Columba,

More information

A Semi-parametric Regression Model to Estimate Variability of NO 2

A Semi-parametric Regression Model to Estimate Variability of NO 2 Envronment and Polluton; Vol. 2, No. 1; 2013 ISSN 1927-0909 E-ISSN 1927-0917 Publshed by Canadan Center of Scence and Educaton A Sem-parametrc Regresson Model to Estmate Varablty of NO 2 Meczysław Szyszkowcz

More information

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

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

More information

2-Dimensional Image Representation. Using Beta-Spline

2-Dimensional Image Representation. Using Beta-Spline Appled Mathematcal cences, Vol. 7, 03, no. 9, 4559-4569 HIKARI Ltd, www.m-hkar.com http://dx.do.org/0.988/ams.03.3359 -Dmensonal Image Representaton Usng Beta-plne Norm Abdul Had Faculty of Computer and

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

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

Collaboratively Regularized Nearest Points for Set Based Recognition

Collaboratively Regularized Nearest Points for Set Based Recognition Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,

More information

Introduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2

Introduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2 Introducton to Geometrcal Optcs - a D ra tracng Ecel model for sphercal mrrors - Part b George ungu - Ths s a tutoral eplanng the creaton of an eact D ra tracng model for both sphercal concave and sphercal

More information

Finite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c

Finite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c Advanced Materals Research Onlne: 03-06-3 ISSN: 66-8985, Vol. 705, pp 40-44 do:0.408/www.scentfc.net/amr.705.40 03 Trans Tech Publcatons, Swtzerland Fnte Element Analyss of Rubber Sealng Rng Reslence Behavor

More information

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research

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

Curve Representation for Outlines of Planar Images using Multilevel Coordinate Search

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

More information

Computer-Aided Design. The feedrate scheduling of NURBS interpolator for CNC machine tools

Computer-Aided Design. The feedrate scheduling of NURBS interpolator for CNC machine tools Computer-Aded Desgn 43 (011) 61 68 Contents lsts avalable at ScenceDrect Computer-Aded Desgn journal homepage: www.elsever.com/locate/cad The feedrate schedulng of NURBS nterpolator for CNC machne tools

More information

USING GRAPHING SKILLS

USING GRAPHING SKILLS Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp

More information

An efficient method to build panoramic image mosaics

An efficient method to build panoramic image mosaics An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract

More information