David Sewell z. Sewell Development. Provo, Utah. Figure 1: Uniform and non-uniform Doo-Sabin surfaces.
|
|
- Jonah Morris
- 6 years ago
- Views:
Transcription
1 Non-Unform Recursve Subvson Surfaces Thomas W. Seerberg Janmn Zheng y Brgham Young Unversty Dav Sewell z Sewell Development Provo, Utah Malcolm Sabn x Numercal Geometry Lt. Cambrge, UK Abstract Doo-Sabn an Catmull-Clark subvson surfaces are base on the noton of repeate knot nserton of unform tensor prouct B-splne surfaces. Ths paper evelops rules for non-unform Doo- Sabn an Catmull-Clark surfaces that generalze non-unform tensor prouct B-splne surfaces to arbtrary topologes. Ths ae exblty allows, among other thngs, the natural ntroucton of features such ascusps, creases, an arts, whle else mantanng the same orer of contnuty astherunform counterparts. Categores an Subject Descrptors: I.3.5 [Computer Graphcs]: Computatonal Geometry an Object Moelng{ surfaces an object representatons. Atonal Key Wors an Phrases: B-splnes, Doo-Sabn surfaces, Catmull-Clark surfaces. INTRODUCTION Tensor prouct non-unform ratonal B-splne surfaces have become an nustry stanar n computer graphcs, as well as n CAD/CAM systems. Because surfaces of arbtrary topologcal genus cannot be represente usng a sngle B-splne surface, there has been conserable nterest n the generalzaton, base on knot nserton, calle `recursve subvson,' whch removes ths lmtaton. However, espte beng base on knot nserton, the recursve subvson technques publshe so far are the analogues of equal nterval, unform B-splnes rather than of nonunform B-splnes. Ths paper explores the possblty of achevng the extra exblty of unequal knot ntervals n a recursve subvson scheme nclung, for example, the ablty to express features such as creases an arts by smply settng some of the knot ntervals to zero. Schemes are presente for achevng nonunform Doo-Sabn an Catmull-Clark surfaces. We wll refer to these collectvely as Non-Unform Recursve Subvson Surfaces (NURSSes). Fgure (left) shows a Doo-Sabn surface, an Fgure (rght) shows an example of a non-unform Doo-Sabn surface n whch the knot spacngs along certan control eges have been set to zero (as labele), thereby creatng a G scontnuty along the oval ege on the left. Fgure shows two non-unform Catmull-Clark surfaces. The one on the left contans a art forme by settng two pars of control-ege knot spacngs to zero. The one on the rght shows shape mocaton nuce by changng the knot spacng along the top eges to an along the center horzontal eges to.. The control net use here has the topology of a B-splne control tom@byu.eu y zheng@cs.byu.eu (On leave from Zhejang Unversty) z ave@sewell.com x malcolm@geometry.emon.co.uk Fgure : Unform an non-unform Doo-Sabn surfaces. net, but these shapes cannot be obtane usng NURBS or unform Catmull-Clark surfaces. Fgure : Non-unform Catmull-Clark surfaces.. Backgroun The concept of mage space subvson as a graphcs technque ha been aroun for a long tme when recursve subvson appeare as an object enton technque. The rst relevant result n parametrc space subvson of sculpture surfaces was the e Casteljau algorthm, whch both evaluate a pont on a Bezer curve an prove the control ponts for the parts of the curve meetng there. Ths was generalze to B-splnes n the form of the Oslo algorthm [6] an Boehm subvson [3] an use as a bass for nterrogaton methos applyng parametrc space subvson. However, what sparke the magnaton of the graphcs an moelng communtes n 975 was a much more specc subvson of a quaratc B-splne, propose by Chakn as a curve renerng technque [5], an recognze for what t was by Forrest [] an by Resenfel [6]. It later turne out that the concept of a curve beng the lmt of a polygon uner the
2 operaton of cuttng o the corners ha been explore by e Rham n the 94s an 5s. Hs results were translate nto moern termnology by e Boor [7]. It was quckly apprecate that the curve eas coul gve surface technques just by applyng the concept of tensor prouct, but the mportant key concept, that subvson coul overcome the rg rectangular parttonng of the parametrc oman one of the major lmtatons of tensor proucts was reache more or less smultaneously by Catmull an Clark [4] an by Doo an Sabn [8]. Snce then there have been ve major rectons of evelopment:. The analyss of what happens near an extraornary pont, starte n the Doo-Sabn paper [8], was taken up by Ball an Storry. Ths le to an optmzaton of the coecents for the cubc case [, ] whch unfortunately msse one of the possble varatons, an the task was complete by Sabn [8], n a paper whch alsoente that a cubc constructon coul never gve fullg contnuty atthe sngular ponts, an that contnuty atsuch ponts was n fact a much morecomplcate queston than ha been assume. Further analyss was carre out by Ref [5]. The nature of the behavor aroun the extraornary ponts s now well unerstoo.. Constructons base on box-splnes, rather than on tensor proucts, were explore by Farn [] an by Loop [5], an a collecton of possble constructons was assemble by Sabn[7]. 3. Constructons that nterpolate the control ponts were explore by Dyn, Gregory an Levn [9], an an mprove scheme was erve by Zorn, Schroer an Swelens [3]. Kobbelt [4] propose an alternatve for quarlateral nets wth arbtrary topology. The smpler ones n ths category can be vewe as uals of quaratc B-splne constructons. 4. Nasr [7] stue the problems of ecent mplementaton an practcal ege-contons an extene ths to mocatons of the basc technque to acheve varous nterpolaton contons [8, 9, ]. Halstea, Kass, an DeRose showe that a farness norm coul be compute exactly for Catmull-Clark surfaces [], enablng the etermnaton of more far lmt surfaces. 5. The ea of usng just a small number of subvson steps, an then usng n-se combnatons of patches to ll n a conguraton mae more regular n some sense by those steps, was explore by Loop [6], Peters [,, 3] an Prautzsch [4]. Ball an Storry [9] took the opposte lne, of usng subvson to ene an n-se patch. What was not explore untl now was that the general topology subvson schemes were as rg as the equal nterval splnes from whch they were erve.. Overvew Secton revews knot-oublng for non-unform B-splne curves of egree two an three an ntrouces a smple approach for labelng the knot ntervals on the control polygon an ea that s crucal for the extenson to subvson surfaces. Secton 3 then gves the corresponng expresson for knot oublng of non-unform tensor prouct B-splne surfaces.secton 4 proposes subvson rules for non-unform Doo-Sabn an Catmull-Clark surfaces, whch reuce to nonunform B-splne surfaces when the control net s a rectangular gr an when all knot ntervals along every gven row an column are the same. A contnuty analyss s gven n secton 5, showng that non-unform Doo-Sabn surfaces are G an non-unform Catmull-Clark surfaces are generally G, but G at certan ponts. Secton 6 makes some observatons on NURSSes, an oers a concluson. CURVE KNOT DOUBLING For a quaratc peroc B-splne curve, each vertex of the control polygon correspons to a sngle quaratc curve segment. It s convenent then to express the knot vector by wrtng the knot nterval of each curve segment nexttots corresponng control vertex P. Ifanew knot s nserte at the mpont ofeach current knot nterval, the resultng control polygon has twce as many control ponts, an ther coornates Q k are: Q = ( + + )P + P + ( + + ) Q + = +P +( + + )P + ( + + ) as llustrate n Fgure 3. P Q - Q / - / Q+ + P + / - P Fgure 3: Non-unform quaratc B-splne curve. For cubc peroc B-splne curves, each ege of the control polygon correspons to a sngle cubc curve segment, an so we wrte the knot ntervals ajacent toeach ege of the control polygon. The equatons for the new control ponts Q k generate upon nsertng a knot mway through each knot nterval are: Q + = ( + + )P +( + ; )P + ( ; ) Q = Q ; +( ; + )P + ; Q + ( ; + ) as shown n Fgure 4. P - Q P Q Q + - / / P + + Fgure 4: Non-unform cubc B-splne curve. 3 SURFACE KNOT DOUBLING The knot-oublng formulae for B-splne curves exten easly to surfaces. Non-unform B-splne surfaces are ene n terms of a control net that s topologcally a rectangular gr, for whch all horzontal knot vectors are scales of each other, an all vertcal knot vectors are scales of each other. 3. Quaratc Case The formulae for the new control ponts F A can be wrtten n Doo-Sabn form, whch s sgncant because n ths form () () (3)
3 the new control ponts are seen as beng n groups, creatng a new face n each olface, an the vertces of each such new face are n : corresponence wth the vertces of the ol, as uner the tensor prouct form we merely see all the new vertces as formng a new regular array (see Fgure 5). F A = V + A V = + ac(b + C ; A ; D) 4(a + ac + bc + b) (4) ba + ab + bcc + acd : (5) b + a + bc + ac a C c/ a/ F A c a/ A c/ a Fgure 5: Knot oublng, quaratc B-splne. 3. Cubc Case For non-unform cubc B-splne surfaces, the renement rules can be wrtten as follows (see Fgure 6). Frst, each face s replace wth a new vertex F.For example, F =[(e 3 +e 4 )( + )P +(e 3 +e 4 )( + 3 )P +(e 3 +e )( + 3 )P 5 +(e 3 +e )( + )P ] =[4(e + e 3 + e 4 )( )]: (6) Then, each ege s splt wth an ege vertex E, e.g. E = e F + e 3 F 4 +(e + e 3 )M (7) (e + e 3 ) M = ( + )P +( + 3 )P : (8) ( ) Fnally, each orgnal control pont s replace wth a vertex pont V V = P 4 + 3e F + e F + e 3 F e 3 F 4 + 4( + 3 )(e + e 3 ) [ 3 (e + e 3 )M + e ( + 3 )M + (e + e 3 )M 3 +e 3 ( + 3 )M 4 ]=[4( + 3 )(e + e 3 )]: (9) b D B b c e 4 e P 4 e P 4 5 P e M 3 F e 3 F e 3 E E E3 P M P M 3 P 3 V 3 4 e F M 4 e 4 F 3 e E 4 P 8 P 4 P 7 e 3 e e 4 Fgure 6: Face, ege an vertex ponts. 4 NURSS REFINEMENT In unform B-splne surfaces, all knot spacngs are the same. Doo-Sabn an Catmull-Clark propose generalzatons of unform B-splne surface schemes that allow for vertces of the control mesh to have valence other than four, an the faces of the control mesh to have other than four ses. Ther subvson rules were esgne such that when the control mesh happens to be a rectangular gr, the subvson rules are equvalent toknot oublng of unform B-splne surfaces. The subvson surfaces are then ene as the lmt of the control meshes when these subvson rules are apple an nnte number oftmes. We here ene generalzatons of non-unform B-splne surfaces. As n the cubc curve case, eachegenthecontrol polyheron of a non-unform Catmull-Clark surface s assgne a knot spacng. For a non-unform Doo-Sabn surface, each vertex s assgne a knot spacng (possbly erent) for each ege raatng from t. Our objectve stoevse a set of re- nement rules for NURSSes such that f all knot ntervals are equal, the quaratc NURSS reuces to Doo-Sabn an the cubc NURSS reuces to Catmull-Clark. There are actually two stnct rules to be evse. Frst, we neetorevse the Doo-Sabn an Catmull-Clark rules for the new pont coornates, takng the knot spacngs nto account. Secon, we nee rules for etermnng the new knot spacngs. Note that \NURSS" coul just as well stan for \Non- Unform Ratonal Subvson Surfaces," because t s a smple matter to rst project ratonal control ponts to 4-D, then apply our rules, an nally to project back to3-d. In ths secton, bol captal letters stan for ponts, an non-bol typeface for knot spacngs. The nces for knot spacng k j ncate that the spacng pertans to an ege wth P as one enpont. Referrng to Fgure 8, the notaton j ncates the knot spacng for ege P {P j.rotatng counterclockwse about P, j enotes the knot spacng for the rst ege encountere, j ncates that of the secon ege, etc. For the cubc case, each ege has a sngle knot spacng, so j = j. 4. Quaratc Case In the quaratc case, renementprocees n a manner entcal to Doo-Sabn subvson: A polyheron spawns a rene polyheron for whch new faces (of type F, type E an type V respectvely) are create for each face, ege, an vertex of the prevous polyheron. Durng the subvson step, each face s replace by a new face connecte across the ol eges an across the ol vertces by other new faces. In such renement schemes, the extraornary ponts are at the \center"of n-se faces wth n 6= 4. After one teraton, every vertex of the new polyheron wll have valence four, an the numberof faces wth other than four ses wll reman constant. 3
4 Refer to Fgure 7 for labels. The new vertex P s compute: P = V + P P n ;np + j= +( ; ; ;3 ;) + cos j;jj n 8 P n k= k; k k+ k P n k= V = k; k P k+ k k P n : k= k; k k+ k P j () = 3 = 43 = - 4 = 3 34 P 3 P = 4 F 43 P 4 = P 4 4 = 4 Fgure 8: Face pont. P = 4 -,-,+ P _ -, -,- _,+ +, _,-,+ P P + - P -,- +,+ j = j + ; j ( + j ; + j ; + ) (4) j j f j + ; + j ; + j j 6=an j =otherwse. M = ( j + j + ;)P j +( j + j + ;)P j j + j + j ; + + j j + j ; j (5) Fgure 7: Quaratc renement rules. 4.. New knot spacngs New knot spacngs k j can be spece n numerous ways. Here are two straghtforwar optons: or + = ; ; = += ; = + = ;= + = += ; ; =( + + ; ; )=4 ; = ;= + =( ; + +)=4 The former allows the renement matrx to reman constant after a few teratons. The latter seems to prouce more satsfactory shapes. 4. Cubc Case Our evelopment parallels that for Catmull-Clark surfaces. As shown n Fgure 8, the face pont for a face wth n ses s compute as F = P n; = w P P n; = w () w =( ; + + ; ; + ; ;+ ; ; ; ) ( ; + ; + ; ; ; + + )() The ege pont s compute (see Fgure 9a): E =(; j ; j )M + j F j + j F j (3) - j j - j j F j - j j M j P P E P j j V F j Fgure 9: a) Ege pont. j - j j M b) Vertex pont. P M + F,+ P + The vertex pont for a pont ofvalence n s expresse (see Fgure 9b): V = cp + 3P n P = (m M + f + F + ) n n = (m (6) + f + ) M are ene as (5), F + as (), an m =( + ; )( + ; )= (7) f j = ; j (8) c = n ; 3 n otherwse, c =. 4.. New knot spacngs f P n = (m + f + ) 6= (9) Each n-se face s splt nto n four se faces, whose knot spacngs are etermne as shown n Fgure. 5 CONTINUITY ANALYSIS For each constructon, we conser the behavor of the lmt surface for all the knot spacngs beng postve. 4
5 P / 3 / (3 + 4 )/ / 34 / ( + 34 )/4 F ( + 3 )/4 P 4 / / 4 4 / 4 / ( 34 + )/4 ( 4 + )/4 P P / / P Theorem For orers 3 to 8, fallknot spacngs j >, then the renement matrx S n s not efectve an ts egenvalues are => = 3 = > j 4j j 5 j j 4n j: By an argument smlar to one use n [] we can conclue that, prove that all the knot spacngs are greater than zero, the lmt surface generate by the non-unform Doo- Sabn scheme s G contnuous both at all ornary ponts an at extraornary ponts of valence less than Quaratc case Fgure : New knot spacngs. 5.. Lmt surface structure After one teraton, all type V an type E faces are four-se, wth the property that the ntervals crossng the orgnal eges are equal as seen from the two ses. Thus each such type V face reuces to a mesh that s equvalent to a unform bquaratc B-splne, whle each type E face reuces to a mesh that s equvalent to a non-unform bquaratc B-splne. Ths leaves only the regresson n the type F faces to analyze for contnuty. The lmt surface for a face conssts of patches n the structure as shown n Fgure a. The face s four-se n ths example. 5. Cubc Case 5.. Lmt surface structure After one subvson, every face s four-se, an after two more, the pattern of knot ntervals over the group of 6 subfaces replacng each orgnal face s as shown n Fgure a. The h are n arthmetc sequence as are the v. h h h h v5 v4 v3 v v h h h h v5 v4 v3 v v h3 h3 h3 h3 v5 v4 v3 v v h4 h4 h4 h4 v5 v4 v3 v v h5 h5 h5 h5 E (j-), C j E j a. b. P j P j- P j+ E j Fgure : a) Knot ntervals after three subvsons b) Sequence of cubc polynomal peces. a. b. Fgure : a) Sequence of quaratc polynomal peces for a four-se face b) Conguraton surrounng type F face. 5.. Contnuty atface-centers It s convenent to conser four-se faces alongse the more general n-se faces. After at most two subvsons, the con- guraton surrounng a type F face may be represente as n Fgure b. In the center les the face (of type F) P P...P n. Each egeofths face (for example P j P j+ )sajacent toa four-se face of type E wth vertces P j P j+ E j E j. The neghborhoo of each vertex P j s complete by afour-se face of type V wth vertces P j E j C j E (j;). Let the conguraton aroun ths type F face be represente by the vector of ponts M =[P... P n E E... E n E n C... C n] T an M be the corresponng conguraton after subvson. Then M = S nm, S n s a4n4n matrx calle the re- nementmatrx. Here we only conser the rst opton for the new knot spacngs n whch case S n remans constantthrough all the subsequent subvson steps. Thus we canusethe egenstructure of S n to analyze contnuty. We carre out an algebrac egenanalyss for orers 3 to 8 base on the screte Fourer transform technque n an exercse reporte n [3]. Ths leas us to When these values are substtute nto (), (3) an (6), the postons of the new vertces n, or on the bounary of, the nnermost four sub-faces are exactly the same as f all the horzontal ntervals ha been equal an all the vertcal ntervals equal lkewse. The nnermost four subfaces therefore converge towars unform bcubc B-splnes, gvng a pattern of bcubc peces as shown n Fgure b, the largest square represents the face of a non-unform Catmull-Clark net wth erent knot ntervals along each ege. The pattern of smaller squares shows schematcally the nnte progresson of Bezer patches that make up the lmt surface. The nteror of the lmt surface of every such face s therefore G.We nee only concern ourselves wth the contnuty at the eges an at the vertces, there s a regresson. 5.. Contnuty atvertces In ths secton we conser contnuty atvertex ponts of valence 3 (.e., exceptonal ponts, as well as vertex ponts of valence four). Unfortunately, snce the renement matrx changes at each teraton, t s cult to perform an egenanalyss to etermne f non-unform Catmull-Clark surfaces are G at vertex ponts, except for smple numercal cases. One of the few cases that yel a constant renement matrx s the valence three vertex n Fgure 3 (rght). In ths case, the secon an the thr egenvalues are generally erent. To noutwhat s gong on n the neghborhoo of ths pont, we performe a numercal stuy, chosng a cube as a control polyheron wth varous knot spacngs. Fgure 3 shows the neghborhoo of a vertex pont V (that began as a corner of the cube) after 5 teratons. The gure on the left shows the unform knot spacng everythng s symmetrc as expecte. The gure on the rght camefromthesame vertex on the same cube, only wth knot ntervals of value 5
6 E E 3 V θ Unform E E V E E 3 Non-unform θ spacng of, except for the four eges labele wth a. Two steps of non-unform Catmull-Clark subvson result n the meshes shown (mnus a few outer layers of quarlaterals). Ths conguraton of knot spacngs causes the lmt surface to nterpolate the center pont wth G contnuty. Fgure 3: Neghborhoo of valence 3 vertex pont after 5 teratons. assgne to one set of four parallel eges on the cube of value assgne to another set of four parallel eges, an of assgne to the remanng four eges, agan after =5 teratons. Notce that the angles are no longer equal. In fact, t turns out that angle = 6 E ; V ; E 3 tens to zero as!.however, the three faces become coplanar at a much faster rate, as shown n the followng table. Here, N refers to the maxmum angle between the planes E ; V ; E, E ; V ; E 3, an E ; V ; E 3. Unform Non-unform N N raans raans raans raans 5 ; :5 5 ; :5 5 5 ;3 :6665 ; : ; : ;8 :5 5 ; : ;5 :43 75 ;3 : ; :3 6 ;4 : ;8 :4 The normals are becomng parallel at a rate that s roughly 7 tmes faster than the rate at whch s approachng zero. After teratons, the conguraton s as close to G as anyone coul possbly have nee for. The facets are 5 orers of magntue smaller than they nee to be for any practcal use (ve teratons are plenty for most graphcs applcatons). We also a smlar stuy on valence four, usng wely varyng knot spacngs, an agan observe a fast convergence of normal vectors, but no tenency of any face angles to ten to zero. Hence, we are conent that valence four ponts are G. Prelmnary experments wth n>4ncate very smlar behavor Contnuty across eges Across the nteror of an ege, the stuaton may be regare as a stanar non-unform B-splne wth a perturbaton ue to the orgnal varaton between the knot ntervals. Ths perturbaton tens to zero wth a convergence rate of O( ; ). Note that the non-unform B-splne s C an the surrounng vertces converge to a plane conguraton wth a rate of O(4 ; ). Therefore, n the lmt, the non-unform Catmull-Clark surface s G across every ege. 6 DISCUSSION Fgure 4 shows the eect that knot spacng can have ona surface. In the gr at the left, all eges are assgne knot Fgure 4: Eect of non-unform knot spacng. In the absence of non-unform subvson surfaces, Hoppe et. al. propose a scheme for mposng features such as creases, corners, an arts on an otherwse G subvson surface that uses specal-case \masks" [3]. NURSSes can prove for such features wthout the nee for specal masks. For example, Fgure shows a crease mpose on a Doo-Sabn surface by settng three knot spacngs to zero. Fgure (left) shows a art on a non-unform Catmull-Clark surface, create by settng four knot ntervals to zero. Fgures 6{9 show avarety ofshapes that can be attane usng NURSSes, but not usng unform subvson surfaces. The ntal control polyhera are shown n wreframe. Sharp features can be mpose by settng to zero the knot spacng of approprate eges. Another use for knot spacng s n shape mocaton. Fgure (rght) shows the eect of alterng the knot spacng on several control polygon eges of a torus-shape Catmull-Clark surface. Fgure 7 shows a unform Doo-Sabn surface (on the left) an two non-unform counterparts, forme by choosng erent knot spacngs as shown. The sphere n Fgure 8 cannot be expresse exactly usng unform subvson surfaces, ratonal or otherwse. Fgure 9c,e,h are other examples of non-unform Catmull-Clark surfaces. In summary, ths metho extens the known general topology methos by permttng unequal knot ntervals, thus allowng a sngle surface escrpton the strengths of both the stanar non-unform tensor proucts an the unform recursve subvson surfaces n one representaton. Even n the stuaton there are no extraornary ponts, ths theory extens current capablty by gvng a G surface when the knot ntervals are chosen nvually for every ege n the control polygon, not constrane to support a tensor prouct structure. Ths scheme proves a lot of freeom to ajust the shape of the surface. In partcular, t can moel sharp features by properly settng certan knot spacngs to zero. Future work wll esgn a convenentmoelng nterface for the nteractve purpose an etermne how to use knot spacng to best avantage. ACKNOWLEDGEMENTS The rst two authors receve partal nancal support for ths project through an NSF grant. Krs Klmaszewsk mae several helpful suggestons, as the referees. 6
7 References [] A A Ball an D J T Storry. Recursvely Generate B-splne Surfaces. Proc. CAD84, pages {9, 984. ISBN [] A A Ball an D J T Storry. Contons For Tangent Plane Contnuty Over Recursvely Generate B-splne Surfaces. ACM ToG, 7:83{, 988. [3] W Boehm. Insertng New Knots Into B-splne Curves. Computer-Ae Desgn, :99{, 98. [4] E Catmull an J Clark. Recursvely Generate B-splne Surfaces On Arbtrary Topologcal Meshes. Computer- Ae Desgn, :35{355, 978. [5] G Chakn. An Algorthm For Hgh-spee Curve Generaton. Computer Graphcs an Image Processng, 3:346{ 349, 974. [6] E Cohen, T Lyche, an R F Resenfel. Dscrete B-splnes An Subvson Technques In Computer Ae Desgn An Computer Graphcs. Computer Graphcs an Image Processng, 4:87{, 98. [7] C e Boor. Cuttng Corners Always Works. Computer Ae Geometrc Desgn, 4:5{3, 987. [8] D Doo an M Sabn. Behavour Of Recursve Dvson Surfaces Near Extraornary Ponts. Computer-Ae Desgn, :356{36, 978. [9] N Dyn, D Levn, an J A Gregory. A 4-pont Interpolatory Subvson Scheme For Curve Desgn. Computer Ae Geometrc Desgn, 4:57{68, 987. [] G Farn. Desgnng C Surfaces Consstng Of Trangular Cubc Patches. Computer-AeDesgn, 4:53{56, 98. [] A R Forrest. Notes On Chakn's Algorthm. Techncal Report Memo CGP74/, Unversty of East Angla, Norwch, UK, 974. [] M Halstea, M Kass, an T DeRose. Ecent, Far Interpolaton Usng Catmull-Clark Surfaces. Computer Graphcs (SIGGRAPH 93 Conference Proceengs), 7:35{44, 993. [3] H Hoppe, T DeRose, T Duchamp, M Halstea, H Jn, J McDonal, J Schwetzer, an W Stuetzle. Pecewse Smooth Surface Reconstructon. Computer Graphcs (SIGGRAPH 94 Conference Proceengs), 8:95{3, 994. [4] L Kobbelt. Interpolatory Subvson On Open Quarlateral Nets Wth Arbtrary Topology. Computer Graphcs Forum (Eurographcs 96), 996. [5] C Loop. Smooth Subvson Surfaces Base On Trangles. Master's thess, Unversty of Utah, Dept. of Mathematcs, 987. [6] C Loop. Smooth Splne Surfaces Over Irregular Meshes. Computer Graphcs (SIGGRAPH 94 Conference Proceengs), 8:33{3, 994. [7] A Nasr. Polyheral Subvson Methos For Free-form Surfaces. PhD thess, Unversty of East Angla, 984. [8] A Nasr. Polyheral Subvson Methos For Free-form Surfaces. ACM ToG, 6:9{73, 987. [9] A Nasr. Surface Interpolaton On Irregular Network Wth Normal Contons. Computer Ae Geometrc Desgn, 8:89{96, 99. [] A Nasr. Curve Interpolaton In Recursvely Generate B-splne Surfaces Over Arbtrary Topology. Computer Ae Geometrc Desgn, 4:3{3, 997. [] J Peters. Jonng Smooth Patches Aroun A Vertex To Form A C k Surface. Computer AeGeometrc Desgn, 9:387{4, 99. [] J Peters. Smooth Free-form Surfaces Over Irregular Meshes Generalzng Quaratc Splnes. Computer Ae Geometrc Desgn, :347{36, 993. [3] J Peters. C Surface Splnes. SIAM J Num Anal, 3:645{ 666, 995. [4] H Prautzsch. Freeform Splnes. Computer Ae Geometrc Desgn, 4:{6, 997. [5] U. Ref. A Une Approach To Subvson Algorthms Near Extraornary Vertces. Computer Ae Geometrc Desgn, :53{74, 995. [6] R F Resenfel. On Chakn's Algorthm. Computer Graphcs an Image Processng, 4:34{3, 975. [7] M A Sabn. Recursve Dvson. In J Gregory, etor, The Mathematcs of Surfaces, pages 69{8. Clarenon Press, Oxfor, 986. ISBN [8] M A Sabn. Cubc RecursveDvson Wth Boune Curvature. In P J Laurent, A le Mehaute, an L L Schumaker, etors, Curves an Surfaces, pages 4{44. Acaemc Press, 99. ISBN [9] D J T Storry an A A Ball. Desgn Of An N-se Surface Patch From Hermte Bounary Data. Computer Ae Geometrc Desgn, 6:{, 989. [3] J Zheng, T Seerberg, an M A Sabn. Egenanalyss Of Non-Unform Doo-Sabn Surfaces. Techncal report, Brgham Young Unversty,Department of Computer Scence (appears as an appenx n the electronc verson of ths paper), November 997. [3] D Zorn, P Schroer, an W Swelens. Interpolatng Subvson For Meshes Wth Arbtrary Topology. Computer Graphcs (SIGGRAPH 96 Conference Proceengs), 3:89{9,
8
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 informationReading. 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 informationFor 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 informationHermite 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 informationA 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 informationModelling of curves and surfaces in polar. and Cartesian coordinates. G.Casciola and S.Morigi. Department of Mathematics, University of Bologna, Italy
Modellng of curves and surfaces n polar and Cartesan coordnates G.Cascola and S.Morg Department of Mathematcs, Unversty of Bologna, Italy Abstract A new class of splne curves n polar coordnates has been
More informationComputer Graphics. - Spline and Subdivision Surfaces - Hendrik Lensch. Computer Graphics WS07/08 Spline & Subdivision Surfaces
Computer Graphcs - Splne and Subdvson Surfaces - Hendrk Lensch Overvew Last Tme Image-Based Renderng Today Parametrc Curves Lagrange Interpolaton Hermte Splnes Bezer Splnes DeCasteljau Algorthm Parameterzaton
More informationAnalysis 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 informationS1 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 informationHigh-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 informationA 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 informationComplex 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 informationLecture 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 informationA 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 informationIntroduction. Basic idea of subdivision. History of subdivision schemes. Subdivision Schemes in Interactive Surface Design
Subdvson Schemes n Interactve Surface Desgn Introducton Hstory of subdvson. What s subdvson? Why subdvson? Hstory of subdvson schemes Stage I: Create smooth curves from arbtrary mesh de Rham, 947. Chan,
More informationParallelism 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 informationSliding-Windows Algorithm for B-spline Multiplication
Slng-Wnows Algorthm for B-splne Multplcaton Xanmng Chen School of Computng Unversty of Utah xchen@cs.utah.eu Rchar F. Resenfel School of Computng Unversty of Utah rfr@cs.utah.eu Elane Cohen School of Computng
More informationShape 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 informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationType-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 informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationCompiler 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 informationShape 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 informationIn the planar case, one possibility to create a high quality. curve that interpolates a given set of points is to use a clothoid spline,
Dscrete Farng of Curves and Surfaces Based on Lnear Curvature Dstrbuton R. Schneder and L. Kobbelt Abstract. In the planar case, one possblty to create a hgh qualty curve that nterpolates a gven set of
More informationInterpolatory Subdivision Curves with Local Shape Control
Interpolatory Subdvson Curves wth Local Shape Control Carolna Beccar Dept. of Mathematcs Unversty of Padova va G.Belzon 7, 35131 Padova, Italy beccar@math.unpd.t Gulo Cascola Dept. of Mathematcs Unversty
More informationQuality 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 informationAccounting 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 informationSupport 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 informationR 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 informationCluster 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 informationCubic 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 informationAn 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 informationModeling, 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 informationCircuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)
Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,
More informationResearch 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 informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
More informationCHAPTER 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 informationAn 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 information1 Linear and Nonlinear Subdivision Schemes in Geometric Modeling
1 Lnear and Nonlnear Subdvson Schemes n Geometrc Modelng Nra dyn School of Mathematcal Scences Tel Avv Unversty Tel Avv, Israel e-mal: nradyn@post.tau.ac.l Abstract Subdvson schemes are effcent computatonal
More informationSENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR
SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu
More information2x 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 informationMathematics 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 informationTHE FAULT LOCATION ALGORITHM BASED ON TWO CIRCUIT FUNCTIONS
U THE FAULT LOCATION ALGORITHM BASED ON TWO CIRCUIT FUNCTIONS Z. Czaa Char of Electronc Measurement, Faculty of Electroncs, Telecommuncatons an Informatcs, Techncal Unversty of Gañsk, Polan The paper presents
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More information5 The Primal-Dual Method
5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton
More informationAssignment # 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 informationSmoothing 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 informationCE 221 Data Structures and Algorithms
CE 1 ata Structures and Algorthms Chapter 4: Trees BST Text: Read Wess, 4.3 Izmr Unversty of Economcs 1 The Search Tree AT Bnary Search Trees An mportant applcaton of bnary trees s n searchng. Let us assume
More informationA 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 informationBarycentric 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 informationb * -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 informationCMPS 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 informationLearning 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 informationVectorization 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 informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationHigh resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices
Hgh resoluton 3D Tau-p transform by matchng pursut Wepng Cao* and Warren S. Ross, Shearwater GeoServces Summary The 3D Tau-p transform s of vtal sgnfcance for processng sesmc data acqured wth modern wde
More informationActive 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 informationShape 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 informationA 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 information350 Nra Dyn and Elza Farkh 1. Introducton. The nterest n developng subdvson schemes for compact sets s motvated by the problem of the reconstructon of
Serdca Math. J. 28 (2002), 349-360 SPLINE SUBDIVISION SCHEMES FOR COMPACT SETS. A SURVEY Nra Dyn and Elza Farkh Communcated by P.P.Petrushev Dedcated to the memory of our colleague Vasl Popov January 14,
More information2-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 informationUNIT 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 informationLecture 4: Principal components
/3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness
More informationAn 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 informationEcient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem
Ecent Computaton of the Most Probable Moton from Fuzzy Correspondences Moshe Ben-Ezra Shmuel Peleg Mchael Werman Insttute of Computer Scence The Hebrew Unversty of Jerusalem 91904 Jerusalem, Israel Emal:
More information3D 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 information6.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 informationModule 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 informationA New Solid Subdivision Scheme based on Box Splines
A New Sold Subdvson Scheme based on Box Splnes Yu-Sung Chang Kevn T McDonnell Hong Qn Department of Computer Scence State Unversty of New York at Stony Brook ABSTRACT Durng the past twenty years, much
More informationNon-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 informationSubspace 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 informationLOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit
LOOP ANALYSS The second systematic technique to determine all currents and voltages in a circuit T S DUAL TO NODE ANALYSS - T FRST DETERMNES ALL CURRENTS N A CRCUT AND THEN T USES OHM S LAW TO COMPUTE
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationScan Conversion & Shading
Scan Converson & Shadng Thomas Funkhouser Prnceton Unversty C0S 426, Fall 1999 3D Renderng Ppelne (for drect llumnaton) 3D Prmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng
More informationF 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 informationu 0+u 2 new boundary vertex
Combined Subdivision Schemes for the design of surfaces satisfying boundary conditions Adi Levin School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv 69978, Israel. Email:fadilev@math.tau.ac.ilg
More informationSolutions to Programming Assignment Five Interpolation and Numerical Differentiation
College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent
More informationAP PHYSICS B 2008 SCORING GUIDELINES
AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for
More informationSLAM 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 informationImprovement 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 informationIntroduction 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 informationElectrical 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 informationAdaptive Fairing of Surface Meshes by Geometric Diffusion
Adaptve Farng of Surface Meshes by Geometrc Dffuson Chandrajt L. Bajaj Department of Computer Scences, Unversty of Texas, Austn, TX 78712 Emal: bajaj@cs.utexas.edu Guolang Xu State Key Lab. of Scentfc
More informationCurve 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 informationy 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 informationCSE 326: Data Structures Quicksort Comparison Sorting Bound
CSE 326: Data Structures Qucksort Comparson Sortng Bound Steve Setz Wnter 2009 Qucksort Qucksort uses a dvde and conquer strategy, but does not requre the O(N) extra space that MergeSort does. Here s the
More informationParallel 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 informationWavefront Reconstructor
A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes
More informationReport on On-line Graph Coloring
2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm
More informationTopology 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 informationMath 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 informationFitting: Deformable contours April 26 th, 2018
4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.
More informationGSLM 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 informationConstrained 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 informationScan Conversion & Shading
1 3D Renderng Ppelne (for drect llumnaton) 2 Scan Converson & Shadng Adam Fnkelsten Prnceton Unversty C0S 426, Fall 2001 3DPrmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng
More informationComputer models of motion: Iterative calculations
Computer models o moton: Iteratve calculatons OBJECTIVES In ths actvty you wll learn how to: Create 3D box objects Update the poston o an object teratvely (repeatedly) to anmate ts moton Update the momentum
More informationFast 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 informationNOVEL CONSTRUCTION OF SHORT LENGTH LDPC CODES FOR SIMPLE DECODING
Journal of Theoretcal and Appled Informaton Technology 27 JATIT. All rghts reserved. www.jatt.org NOVEL CONSTRUCTION OF SHORT LENGTH LDPC CODES FOR SIMPLE DECODING Fatma A. Newagy, Yasmne A. Fahmy, and
More informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
More informationProblem 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