X-Splines : A Spline Model Designed for the End-User

Size: px
Start display at page:

Download "X-Splines : A Spline Model Designed for the End-User"

Transcription

1 X-Splines : A Spline Model Designed for he End-User Carole Blanc Chrisophe Schlic LaBRI 1 cours de la libéraion, 40 alence (France) [blancjschlic]@labri.u-bordeaux.fr Absrac his paper presens a new model of spline curves and surfaces. he main characerisic of his model is ha i has been creaed from scrach by using a ind of mahemaical engineering process. In a firs sep, a lis of specificaions was esablished. his lis groups all he properies ha a spline model should conain in order o appear inuiive o a non-mahemaician end-user. In a second sep, a new family of blending funcions was derived, rying o fulfill as many iems as possible of he previous lis. Finally, he degrees of freedom offered by he model have been reduced o provide only shape parameers ha have a visual inerpreaion on he screen. he resuling model includes many classical properies such as affine and perspecive invariance, convex hull, variaion diminuion, local conroland C =G or C =G 0 coninuiy. Bu i also includesoriginal feaures such as a coninuum beween B-splines and Camull-Rom splines, or he abiliy o define approximaion zones and inerpolaion zones in he same curve or surface. 1 Inroducion Since he ground wor in CAD during he lae sixies, many differen models of splines have been inroduced. One specific characerisic of CAD is ha he mahemaical models developped by researchers are laer manipulaed by non-mahemaician end users (designers, archiecs, animaors). herefore, raher han is complee mahemaical properies, a major crierion for he evaluaion of a spline model may be he abiliy o undersand inuiively he degrees of freedom ha i provides. A full sudy of exising spline models on ha paricular poin lies no wihin he scope of his shor inroducion, bu le us jus ae one or wo examples. he popular NURBS model is a good example in which he user has o be familiar wih he mahemaical srucure o obain bes resuls. For insance, he manipulaion of he no vecor is really complex: firs he geomerical effecs generaed by hese manipulaions can hardly be prediced, second hese effecs are no robus because furher no manipulaions may move hem along he curve, and hird he effecs are propagaed along he whole isoparameric curves in he case of surfaces. Even he manipulaion of he weighs may someimes be confusing: for insance, he modificaions of wo adjacen weighs are muually cancelled [11]. he model ha accouns he mos for he ergonomics of he manipulaion is undoubedly he -spline model [1] which includes inuiive shape parameers (ension and bias). Ye, if he behaviour of he Laboraoire Bordelais de Recherche en Informaique (Universié Bordeaux I and Cenre Naional de la Recherche Scienifique). he presen wor is also graned by he Conseil Régional d Aquiaine. model is really naural when using global ension and bias, he exended model [] wih local parameers is less convincing, mainly because hese parameers are no direcly relaed o he conrol poins. Moreover, he C 0 =G coninuiy of he -splines is los by inerpolaion, his maes hem inadequae for many applicaions [9]. his paper proposes a new spline model ha has been designed o mae user manipulaions as inuiive as possible. Is formulaion is presened in four seps: Secion presens he lis of specificaions for he new model, Secion explains he principle and he basic formulaion, Secion 4 derives a more complee expression including an original shape parameer, finally, Secion deails he general formulaion. Bacground.1 Definiion In heir mos general definiion, splines can be considered as a mahemaical model ha associaes a coninuous represenaion (curve or surface) wih a discree se of poins of an affine space (usually IR or IR ). In he case of curves, his definiion can be expressed as follows: le IR wih ( = 0::n) be a se of poins called conrol poins, and le F : [0; 1]! IR (wih = 0::n) be a se of funcions called blending funcions, he spline curve generaed by he couples ( ; F ) is he curve C defined by he parameric equaion: 8 [0; 1] C() = nx =0 F () (1) According o he shape of he blending funcions, he resuling curve may eiher approximae he conrol poins or inerpolae hem. Figure 1 and Figure illusrae his disincion by showing wo classical examples of spline curves (cubic uniform B-splines [1] in Figure 1, cubic Camull-Rom [6] in Figure ). Each figure is divided in wo pars, he op shows he conrol laice and he curve, he boom shows he plos of he blending funcions. he same graphical framewor will be used hroughou he paper.. roperies he family of curves ha obeys Equaion 1 is exremely vas and hus many of is members are liely o be of lile ineres. In fac, he wor done over he years in he lieraure has exhibied many properies ha a spline model should include o become useful for geomeric modelling. In a recen survey, we have shown ha all hese properies can be obained by imposing specific consrains on he blending funcions [].

2 F1 F 1 0 Figure 1: Uniform B-spline curve 4 6 F1 F Figure : Camull-Rom spline curve Using ha resul, we are going o lis now all he properies (as well as he corresponding consrains on he blending funcions) ha we have found vial or simply desirable o include in our user-oriened spline model: Affine invariance: he affine ransformaion of a spline should be obained by applying he ransformaion o is conrol poins. his is provided by he normaliy consrain: 8 [0; 1] nx =0 F () = 1 () Convex hull: he spline should be enirely conained in he convex hull of is conrol laice. his is provided by he normaliy consrain combined wih he posiiviy consrain: 8 = 0::n 8 [0; 1] F () 0 () Variaion diminuion: he number of inersecions beween he spline and a plane (or a line, for D splines) should be a mos equal o he number of inersecions beween he plane and he conrol laice, which means ha he spline should have less oscillaions han is conrol laice. his propery is provided by combining he normaliy, he posiiviy wih he regulariy consrain: 8 = 0::n 9 [0; 1] = (4) 8 < () 0 and 8 0 = +1::n F 0() F () 8 > () 0 and 8 0 = 0::?1 F 0() F () his consrain may appear complex a a firs glance, bu i simply says ha he blending funcions are bell-shaped and ha wo funcions canno cross each oher in he zone where hey are simulaneously increasing or decreasing. Local conrol: Each conrol poin should only influence he shape of he spline in a resriced zone. his propery is provided by he localiy consrain: 8 = 0::n 9(? ; + ) [0; 1] = () 8 <? F () = 0 and 8 > + F () = 0 A spline may offer more or less local conrol according o he exen of he influence of a given conrol poin. o quanify his aspec, he noion of L p localiy [] can be used: a spline curve (resp. surface) has go L p localiy when each conrol poin influences p segmens (resp. paches) a mos. Smooh shapes/sharp shapes: he spline model should allow boh smooh shapes and sharp shapes and more precisely mixing smooh zones and sharp ones in he same curve. I is well nown ha parameric coninuiy does no provided any informaion on he shape of he curve; herefore one has o use geomeric coninuiy: smooh shapes are G a leas, sharp shapes are G 0 a mos. On he oher hand, parameric coninuiy is needed o provide smooh moion in animaion; herefore he model should also provide C coninuiy. Inuiive shape parameers: In addiion o he conrol poins, he spline should also provide oher degrees of freedom, usually called shape parameers. Bu o be usable by a non-mahemaician end user, he role of hese parameers should be as inuiive as possible. Among all he shape parameers (nos, weighs, ension, bias, curvaure) ha we can find in exising spline models, only he local ension effec (which allows he user o pull he curve locally oward one or several conrol poins) appears oally inuiive. Exisence of refinemen algorihms: he spline model should allow he use of refinemen or subdivision echniques which are powerful ools ha increase he number of degrees of freedom for a spline (conrol poins or shape parameers) wihou modifying is shape. Represenaion of conics: he spline model should be able o represen conic secions, and consequenly a large se of curves and surfaces (circles, ellipses, spheres, cylinders, surfaces of revoluion, ec) ha are inensively used in CAD. he exac represenaion of conics is one reason for he populariy of he NURBS model []. Neverheless, having only a close approximaion (up o he resoluion of he display, for insance) is sufficien for mos applicaions. Approximaion/Inerpolaion: For some applicaions or some users, approximaion splines are preferable, whereas for ohers, inerpolaion splines are imperaive. For ha reason, he model should provide approximaion splines and inerpolaion splines in a unified formulaion. Among he exising models, only he general Camull- Rom model [6] includes such a feaure; bu we would lie o ge a sep furher by allowing he creaion of approximaion zones and inerpolaion zones in he same curve. In he following secions, we describe a new spline model which was designed o fulfill as many iems as possible of he previous lis. A he curren sage in his developmen, all iems bu one (he exisence of refinemen echniques) are fulfilled by he model. he possibiliy of including he las iem will be discussed in he conclusion. Basic X-Splines.1 rinciple Building a new spline model from scrach implies defining a new family of blending funcions. Among he consrains ha have been lised

3 in Secion, he mos difficul o fulfill is he normaliy consrain. Indeed, finding a family of funcions F () ha sum o one whaever he value of is a ricy as. For ha reason, we have chosen o build our blending funcions independenly of he normaliy consrain, and hen o apply in a final sep, a normalizaion process which replaces F () by F (): () 8 [0; 1] F () = nf F() (6) =0 hus, he acual blending funcions F () will be normalized raional polynomials which, as a side-effec, adds he projecive invariance propery o he resuling curves. By combining he differen properies recalled in Secion, we can esablish ha for a normal, posiive, regular and local spline, each blending funcion F () is bell-shaped, sars o grow a a given value?, reaches is unique maximum a a second value and drops o zero a a hird value + (see Figure ). In classical spline models, F () is defined by a piecewise polynomial or a raional piecewise polynomial, composed of as many segmens as consecuive inervals beween? and + (e.g. four segmens wih cubic B-splines) ae he case of a uniform no vecor: 8 = 1::n??1 = If we apply he following reparamerizaion o he curve, u() =???? =?? we are assured ha u = 0 a no? where F () sars o grow and u = 1 a no where F () reaches is maximum. herefore, we have o find a polynomial f(u) defined on he range [0; 1] which can be lined o he lef par of F () by: F? () = f?? Because we wan a C coninuous curve, he following consrains for he funcion f(u) can be immediaely derived: (7) (8) f(0) = 0 f 0 (0) = 0 f 00 (0) = 0 (9) As he maximum of he blending funcion is reached a u = 1, is firs derivaive is necessarily null. Moreover, we can se f(1) = 1 because he normalizaion sep will reduce he maximum o is exac value anyway. Finally, he second derivaive a u = 1 can be se o a given consan(we call his consan?p o simplify he formulaion): f(1) = 1 f 0 (1) = 0 f 00 (1) =?p (10) Figure : Configuraion of he blending funcions he driving idea of he new model ha we propose here is he following: he non-null par of he blending funcion should be composed of only wo segmens 1. he firs, called F? (), is defined beween? and ; he second, called F + (), is defined beween and +. In order o mae his idea clearer, le us ae he case of a spline in which each conrol poin influences four segmens of he curve (i.e. L 4 localiy). his is a usual case (shared by every classical model of cubic splines, for insance) and is ofen considered [] as he bes rade-off beween low degree splines on one hand (which are closely relaed o he conrol laice and hus can hardly provide very smooh shapes) and high degree splines on he oher hand (which can hardly provide very sharp shapes). By definiion, for an L 4 spline, each blending funcion is non-null over four consecuive inervals of he no vecor: F () becomes non-null a no?, is maximal a no and becomes null again a no + (he nos are shown on he op of Figure ). As F () is composed only of wo segmens, i depends only on?, and +. hus here is a ind of alernaion in he way he nos are aen ino accoun (even poins use even nos and odd poins use odd nos). Moreover, as we will see, he blending funcions F? and F + cross each oher a no and all he derivaion of he model is based on his crossing. For ha reason, we have called his new model, cross-splines or X-splines, for shor.. Formulaion In fac, once he general principle has been esablished, he basic formulaion of he new model can be derived quie naurally. Le us firs hus we have derived a sysem of six consrains. As we search for a polynomial soluion, i will necessarily be quinic, in order o ge six degrees of freedom. By maching he consrains and he coefficiens of he polynomial, we obain: f p(u) = u?10? p + (p? 1) u + (6? p) u (11) Moreover, he propery of regulariy requires an increasing funcion on he range [0; 1] and hus a posiive derivaive. herefore here is an addiional condiion on p: 0 p 10 he funcion f p(u) (see Figure 4) provides he lef par of F () according o Equaion 8. By reversing he direcion and he origin of he reparamerizaion, he righ par of F () is obained similarly: F + () = fp +? (1) he wo funcions F? and F + join a no wih C coninuiy ( 00 () = 0 and F () =?p= ) which means ha he global blending funcion F (), and herefore he whole curve C(), are C coninuous. 1 In fac, we have also ried he case where he non-null par is composed of only one segmen. Bu his maes he modelmuch moreexpensive (degree8 raionalpolynomials) wih no addiional feaures.

4 Figure 6: Similariy of he cubic uniform B-splines and he basic X-splines blending funcions (for p = 8) Figure 4: Funcion f p(u) for p = 0; ; 4; 6; 8; 10 Finally, we ge he formulaion for a segmen of he curve C() on he parameer range [ +1; +], defined by he four conrol poins ; +1; +; +: A0() + A1() +1 + A() + + A() + C() = A 0() + A 1() + A () + A () (1) A 0() = f p +? A () = f p? A 1() = f p +? A () = f p?+1 he process defined above has provided a quinic raional approximaion spline model ha includes he properies of normaliy, posiiviy, regulariy, localiy and C coninuiy. Moreover, he curves conain a degree of freedom p [0; 10] which allows a (sligh) modificaion of heir shapes. I should be noiced ha a very ineresing case is obained for p = 8. Indeed, afer he normalizaion sep, he blending funcions are very close o he cubic uniform B-splines basis funcions (see Figure 6). I means ha he resuling curves call hem basic X-splines are almos idenical o he uniform cubic B-splines (compare Figure and Figure 1) F1 F Figure : Basic X-spline curve 4 Exended X-Splines 4.1 Formulaion he degree of freedom p in Equaion 11 does no offer enough variey in he shapes of he blending funcions (see Figure 4) o provide ineresing effecs on he resuling curves. herefore, i appears somewha useless in he formulaion of he new model. In fac, he exisence of his degree of freedom will be hidden o he end user. As we will see below, his parameer p is needed o manage anoher parameer s, ha we are going o inroduce now and which is he acual degree of freedom accessible by he end user. Among he iems of our lis of specificaions, ension and angular shapes (G 0 coninuiy) can be included in our model by he same derivaion. Indeed, he basic idea which has led o he concep of ension in he spline lieraure is o be able o srain he curve (or he surface) in order o pull i oward he conrol laice. A is limi, his process forces he curve o inerpolae one or several conrol poins, and due o he convex hull propery, his inerpolaion will creae sharp edges. o bring he curve closer o a given par of he conrol laice, one has o increase he influence of he corresponding conrol poins. A sraighforward idea o realize his process is o add a specific weighing coefficien o each conrol poins. Bu, as we have recalled in Secion 1, his soluion (which is used in every classical raional spline) does no wor in a saisfying way, because he influences of neighbouring weighs are muually cancelled. herefore, we propose here an original soluion o include he concep of ension, which does no conain he drawbac of he exising models. o illusrae his new soluion, le us ae he blending funcions F ; and F 4 in Figure. We now ha reaches is maximum a. Bu, as F and F 4 are no null a, he normalizaion process has se he acual maximum o =(F + + F 4). herefore, a way o increase his maximum, in order o bring he curve closer o he conrol poin, is o decrease F ( ) and F 4( ). We now ha in he area of ineres, F (respecively F 4) decreases (respecively increases) monoonically in he range [ ; 4]. hus, o obain smaller values for hese funcions a, one has o speed up he decrease of he former and o slow down he increase of he laer. o realize hese wo operaions symmerically, we acually push he crossing poin of F and F 4 down oward he horizonal axis. For ha, we inroduce a new degree of freedom s [0; 1] a poin. his parameer will be used, firs o compue he value + (where F becomes null) by inerpolaion beween 4 and : + = + s ( 4? ) = + s and second, o compue he value? 4 by inerpolaion beween and :? 4 = + s (? ) =? s (where F4 becomes non null) In oher words, i means ha F (respecively F 4) is null all over he range [ + ; 4] (respecively [;? 4 ]). he same operaion can be

5 done for each. he resuling values (? ; + ) have o be replaced in he reparamerizaion equaions (Equaion 8 and Equaion 1) as follows: F? () = fp???? F + () = fp? +? + (14) he wo pars of F () sill join a, heir firs derivaives are sill null bu heir second derivaives are differen: 0 (? ) =?p (?? ) 0 ( + ) =?p (? + ) (1) Here is he poin where our parameer p will finally be used. Indeed, in order o equal he lef and righ expressions, he only hing o do is o use a specific value for p (noed p?1) in F? and anoher one (noed p +1) in F +. aing p?1 =? (? ) and p +1 =? ( + ) (16) and herefore he curve is usually (when?1; and +1 are no aligned) only G 0 a. In oher words, i means ha, even if i is always C, he model enables he creaion of angular poins or sharp edges. 4. Examples his secion demonsraes he role of he parameer s by showing is influence on he resuling shapes. he basic formulaion defined in Secion is a paricular case of he exendedone, where all parameers s are seo one. As we have seen,basic X-splines are almosidenical o uniform cubic B-splines. A firs varian consiss in seing s 0 and s n o zero in order o inerpolae he end poins of he conrol laice and hus o enable beer conrol of he curve boundaries. he resuling curves call hem exremal X-splines (see Figure 7) are very close o he classical exremal cubic B-splines (also called non-periodic cubic B-splines). 1 gives 0 (? ) = 0 ( + ) =? which provides C coninuiy bu assures also ha he parameers p are in he range [0; 8] as needed o ge he propery of regulariy and o obain he cubic B-splines as a limi case. herefore we can derive a new formulaion for he segmen of he curve C() on he range [ +1; +] defined by he four conrol poins ; +1; +; +: 4 F1 F A0() + A1() +1 + A() + + A() + C() = A 0() + A 1() + A () + A () (17) A 0() = > +? 0 : f p?1? +? + A 1() = > + +1? 0 : f p? ? + +1 A () = <? +? 0 : f p+1?? + +?? + A () = <? +? 0 : f p+?? + +?? + Figure 7: Exremal X-spline curve s 0 = 0; s 1 = 1; s = 1; s = 1; s 4 = 1; s = 1; s 6 = 0 Le us now decrease he value of one parameer s (say s ). By comparing Figure 7 and Figure 8, one can see ha he crossing poin of F and F 4 a no has been pushed down. 1 p?1 = (? + ) p = (+1? + +1 ) p +1 = (+?? + ) p + = (+?? + ) he expression of C() seems complex bu in fac i can be implemened very compacly and efficienly (1 lines of source code in C language). So for he end user, an exended X-spline is oally defined by a se of quadruples (x ; y ; z ; s ) wih = 0:::n. All hese degrees of freedom have a very simple inerpreaion. he parameers (x ; y ; z ) IR are he coordinaes of he conrol poins. he parameer s [0; 1] symbolizes he disance beween he curve and he conrol laice: when s = 1, he curve passes relaively far away from poin ; when s decreases, he curve comes closer and closer o ; finally when s = 0, he curve passes hrough. I should be noiced ha he curve is always C (due o he consrucion process ha has been used), even when i inerpolaes a conrol poin. Bu in ha case, he firs and second derivaives drop o zero a We use here he (es? a : b) operaor borrowed from he C programming language which allows one o wrie muliple expressions in a compac way F1 F Figure 8: Augmenaion of he influence of poin s 0 = 0; s 1 = 1; s = 1; s = 0:; s 4 = 1; s = 1; s 6 = 0 herefore, afer he normalizaion sep, he maximum of has been increased and he curve has been pulled oward. Moreover, neiher

6 he maximum of F nor he maximum of F 4 has been modified. his means ha he curve has no changed near or 4: all he modificaions are localized in he neighbourhood of poin. More precisely, one can show ha a shape parameer s influences only wo segmens of he curves which is half he exen of he oher hree coordinaes (x ; y ; z ) of poin (i.e. L localiy raher han L 4 ). While s decreases, he maximum of increases. Finally, for s = 0, his maximum is se o one, which provides a sharp (G 0 coninuous) inerpolaion of poin F1 F F1 F Figure 11: Sharp inerpolaion of, e 4 s 0 = 0; s 1 = 1; s = 0; s = 0; s 4 = 0; s = 1; s 6 = Figure 9: Sharp inerpolaion of poin s 0 = 0; s 1 = 1; s = 1; s = 0; s 4 = 1; s = 1; s 6 = 0 he L localiy of he influence of he parameers s allows he same ind of acion on several adjacen conrol poins. For insance, if we decrease s ; s and s 4, he curve is pulled simulaneously oward ; and 4, 4 F1 F F 1 F F 4 F Figure 10: Augmenaion of he influence of, e 4 s 0 = 0; s 1 = 1; s = 0:; s = 0:; s 4 = 0:; s = 1; s 6 = 0 and if we se he hree parameers o zero, we obain a sharp inerpolaion of ; and 4 (see Figure 11). Finally, for he limi case where all he parameers s are se o zero, he curve merges wih he conrol laice (see Figure 1). Bu noice ha he curve is no a linear spline because he paramerizaion is C here, whereas i is only C 0 for linear splines. F 6 Figure 1: Sharp inerpolaion of every conrol poin s 0 = 0; s 1 = 0; s = 0; s = 0; s 4 = 0; s = 0; s 6 = 0 his abiliy o mix smooh curves and sharp edges in an unresriced way maes he exended X-spline model a candidae of choice for many applicaions. In vecorial fon design, for insance, one swiches frequeny beween smoohness and sharpness. herefore, he use of X-splines enables he design of characers wih one single spline for he ouline (plus evenually one spline for each hole) defined by a small number of conrol poins (see lef par of Figure 1) o conclude his secion, noe ha a very useful case is obained when he conrol laice forms a regular polygon and all he s are se o one: he resuling curve is a circle (see righ par of Figure 1. In fac, his circle is only an approximaed one bu his approximaion is so close (for 8 conrol poins, he ampliude of he oscillaions of he curve around he rue circle represens less han a facor 10? of he radius, and for 1 conrol poins, his variaion is less han 10?6 ) ha i is sufficien for mos of he applicaions. Saring from ha ernel case, oher conics can be approximaed as well wih a similar accuracy []. A similar resul is obained wih B-splines [4], herefore i is no surprizing ha i holds also for X-splines which approximaeb-splines in ha paricular configuraion.

7 g(0) = 0 g 0 (0) = q g 00 (0) = 4q g(1) = 1 g 0 (1) = 0 g 00 (1) =?p h(0) = 0 h 0 (0) = q h 00 (0) = 4q (19) h(?1) = 0 h 0 (?1) = 0 h 00 (?1) = 0 where q is a degree of freedom ha conrols he value of he firs derivaive a u = 0 (he same degree of freedom has been used by Duff in his ensed inerpolaion spline model [8]. All hese consrains can be fulfilled by wo quinic polynomials: Figure 1: Fon design and represenaion of he circle g(u) = q u + q u + (10?1q?p) u + (p+14q?1) u 4 + (6?q?p) u (0) General X-Splines.1 Formulaion As hey have been formulaed above, exended X-splines fulfill many of he properies lised in Secion. Neverheless, even if hey allow inerpolaing one or several conrol poins, exended X-splines are sill approximaion splines, because only sharp inerpolaions are provided. he las feaure of our lis was he abiliy o manipulae he same model eiher as an approximaion spline or as an inerpolaion spline. he goal of his secion is o show how his characerisic can be included in he X-spline model. Bu, as recalled in Secion, using inerpolaion splines implies forsaing he posiiviy of he blending funcions and herefore he convex hull propery. For some applicaions (and for some users), his is inconceivable. For ha reason, we have purposely separaed his exension from he previous secion. So, he reader may choose beween he formulaion ha fulfills he convex hull propery and he formulaion ha provides he approximaion/inerpolaion dualiy. In Secion 4, we saw ha when he value of he parameer s is decreased, he blending funcion F? (respecively +1 F + ) becomes?1 null beween?1 and? (respecively +1 +?1 and +1). A he limi case, when s = 0, F? (respecively +1 F +?1 ) is null over he whole range [?1; ] (respecively [ ; +1]). Saring from ha configuraion of sharp inerpolaion, o ge a smooh (G coninuiy) inerpolaion of poin, we mus allow F? and +1 F +?1 o become negaive over hese ranges. Moreover, in he same manner as we have sough o approximae cubic B-splines wih he basic formulaion, we will ry o approximae cubic Camull-Rom splines wih his general formulaion. If we apply he following reparamerizaion o he curve, u() =? +1? =? (18) we are assured ha u =?1 a no?1 where F? +1 ges negaive, u = 0 a no where F? +1 ges posiive, and u = 1 a no +1 where F? +1 reaches is maximum. herefore, we have o find wo polynomials: g(u) defined on [0; 1] which represens he posiive par of F? +1 and h(u) defined on [?1; 0] which represens is negaive par. hese wo funcions mus join up a u = 0 wih C coninuiy. As in Secion, we can derive a sysem of consrains bu his ime here are wo funcions, which means 1 consrains: h(u) = q u + q u? q u 4 + q u Saring from hese equaions, he same consrucion process deailed in Secion provides a raional quinic inerpolaion spline model ha includes he properies of normaliy, localiy and C coninuiy. Moreover, he curves conain a degree of freedom q which allows modificaion of heir shapes. Figure 14: Similariy of he cubic Camull-Rom splines and he general X-splines blending funcions (for q = 1=) wo imporan remars should be made abou his model. Firs, as in every inerpolaion spline model, he regulariy propery is los, hus he curve may have unwaned oscillaions. We have observed experimenally ha hese oscillaions can usually be avoided by limiing q o he range [0; 1=]. Second, an ineresing case is obained for q = 1= because he blending funcions are very close o he Camull-Rom funcions (see Figure 14). Bu i should be noiced ha he new funcions are C coninuous insead of C 1. he final sep of he consrucion of our new spline model will be o merge he parameer s of he approximaion model and he parameer q of he inerpolaion one. Here again, he goal is o simplify he degrees of freedom manipulaed by he end user. racically, only one shape parameer s per conrol poin will be used. his is done wih he following convenion: When he user ses all s in he range [0; 1], i means ha he wans o manipulae approximaion splines. In ha case, s is he curve/laice disance parameer defined in Secion 4 (in paricular, uniform cubic B-splines are approximaed for s = 1). When he user ses all s in he range [?1; 0], i means ha he wans o manipulae inerpolaion splines. In ha case, q is obained from s by q =?s = (so, s =?1 provides q = 1= which approximaes cubic Camull-Rom splines). he posiive/negaive disincion for s indicaes clearly ha here is a breaing poin: for posiive s, he convex hull propery is fulfilled, for negaive s, i is no he case anymore. On he oher hand he

8 inuiive noion of curve/laice disance is preserved even for negaive s. Indeed, as we will see below, he more s depars from zero, he more he curve depars from he conrol laice.. Examples We already now ha a sharp (G 0 coninuiy) inerpolaion of he conrol laice can be obained by seing all s o zero (see Figure 1). If we wan o realize a smooh (G coninuiy) inerpolaion, he only hing o do is o se hese parameers o negaive values. For insance, by seing all s o?1, an inerpolaion spline almos idenical o he Camull-Rom spline is obained (compare Figure 1 and Figure ). As expeced, he blending funcions become parly negaive, and hus he convex hull propery is los. And finally, wha is perhaps he mos ineresing feaure of he X- spline model, one can combine wihou any resricion, posiive and negaive shape parameers s in order o creae approximaion zones and inerpolaion ones in he same curve (see Figure 17) F1 F 4 F1 F 0 Figure 1: Smooh inerpolaion of every conrol poin s 0 = s 1 = s = s = s 4 = s = s 6 =? F1 F Figure 17: Approximaion zones and inerpolaion zones s 0 = 0; s 1 = s = s =?1; s 4 = s = 1; s 6 = 0 6 Surfaces he exension of he new model from curves o surfaces is sraighforward. he only hing o do is o compue he ensor produc of wo non-normalized X-spline curves and hen o apply he normalizaion sep 4. he characerisic of he X-splines o creae all possible geomeric effecs by using only uniform no vecors is vial here because, as we have recalled in Secion 1, effecs due o no manipulaions (e.g. sharp edges for B-splines) are propagaed along he whole isoparameric curves. On he conrary, he shape parameers of he X-spline model are direcly relaed o he conrol poins and hus can be localized precisely on a given zone of he surface. Because of he ensor produc, wo shape parameers r and s are provided for each conrol poin where r acs in he u direcion of he surface and s acs in he v direcion. A nice consequence is ha non-isoropic manipulaions are allowed (for insance, creaing sharpness in one direcion and smoohness in he oher one). As a counerpar, he behaviour of hese parameers is a bi more suble han previously: r > 0, s > 0 : is a C =G approximaion poin r = 0, s = 0 : is a C =G 0 inerpolaion poin r < 0, s < 0 : is a C =G inerpolaion poin r = 0, s > 0 : is an approximaion poin providing C =G 0 coninuiy in u and C =G coninuiy in v Figure 16: Modificaion of he inerpolaion s 0 = 0; s 1 = s = s =?1; s 4 = s =?0:; s 6 = 0 By providing differen values for he parameer s, he shape of he inerpolaion curve can be conrolled precisely. For insance, one can enable very slac inerpolaion for a specific zone of he laice and a much igher inerpolaion for anoher zone (see Figure 16). r = 0, s < 0 : is an inerpolaion poin providing C =G 0 coninuiy in u and C =G coninuiy in v Figure 19 and Figure 18 shows some examples of X-spline surfaces. You should noice he abiliy o creae inerpolaion of adjacen conrol poins, localized sharp edges as well as sof ransiions beween sharp and smooh zones; hree feaures ha are impossible (or a bes, only possible in specific cases) wih any exising spline model. 4 his process is someimes called generalized ensor produc [11]

9 Figure 19: Smooh exrusion from a sharp objec Figure 18: Sharp exrusion from a smooh objec Noe ha he sar-shaped fla face on he op of he objec is composed of wo sides wih sraigh edges (lef and boom) and wo sides wih rounded edges (op and righ). Sraigh sides creae sharp edges ha are propagaed all along he exrusion whereas he sharp edges smoohly vanish when hey come near he rounded sides of he op face. 7 Conclusion In his paper, we have presened a new model of spline curves and surfaces. his model includes many classical properies such as affine and perpecive invariance, convex hull, variaion diminuion, local conrol and C =G or C =G 0 coninuiy, as well as some original feaures such as a coninum beween (an approximaion of) B-splines and (an approximaion of) Camull-Rom splines, or he abiliy o define approximaion zones and inerpolaion zones in he same curve or surface. hese properies have been obained by defining a new family of blending funcions ha are quinic raional polynomials and inroducing an original shape parameerha provides, for each conrol poin, a smooh ransiion beween approximaion, sharp inerpolaion and smooh inerpolaion. his paper is only inended as an iniial presenaion of X-splines. For space limiaions, several opics could no be included here. We propose some addiional resuls in [] which should be considered as he companion paper of his one. More precisely, he following opics are discussed in i: Some precisions on efficien implemenaion of X-splines: For insance, one can show ha even if hey are quinic, raional and provide more geomerical effecs, uniform X-splines are less expensive o compue han non-uniform cubic B-splines). Lower order and higher order X-splines: Quinic polynomials have been chosen here because we sough for C =G coninuiy, bu in fac a similar consrucion process can be used for any polynomial of degree +1 providing splines wih C =G coninuiy. Exension o non-uniform no vecors: Geomerical effecs generaed by non-uniformiy in classical splines can be creaed by he shape parameers, so his exension is no ha vial. Neverheless, non-uniform nos may be useful for ey-frame animaion or daa-fiing.

10 Refinemen algorihms: his is clearly a much harder as. For he momen, we propose only some preliminary resuls on a ind of De Caseljau subdivision algorihm. Acnowledgemens We wish o han all he anonymous reviewers for many helpful commens and suggesions. We also han Brian Smih (from Lawrence Bereley Laboraory), he mainainer of he xfig pacage, who gave us he permission o include he X-splines model in his sofware and o use i for public demonsraion. Finally, special hans o C. Feuille, S. Grobois, L. Mazière and L. Miniho who modified xfig for us and discovered he L (raher han L 4 ) localiy of he shape parameers. 8 References [1] B. Barsy, he Bea-Spline: a Local Represenaion based on Shape arameers and Fundamenal Geomeric Measures, hd hesis, Universiy of Uah, [] R. Barels, J. Beay, B. Barsy, An Inroducion o Splines for Compuer Graphics and Geomeric Modeling, Morgan Kaufmann, [] C. Blanc, echniques de Modélisaion e de Déformaion de Surfaces pour la Synhèse d Images, hd hesis, Universié Bordeaux I, 1994 (in french). [4] C. Blanc, C. Schlic, More Accurae Represenaion of Conics by NURBS, echnical Repor, LaBRI, 199 (submied for publicaion). [] C. Blanc, C. Schlic, X-Splines: Some Addiional Resuls, echnical Repor, LaBRI, 199 (available by H a [6] E. Camull, R. Rom, A Class of Inerpolaing Splines, in Compuer Aided Geomeric Design, p17-6, Academic ress [7] E. Cohen,. Lyche, R. Riesenfeld, Discree B-Splines and Subdivision echniques, Compuer Graphics & Image rocessing, v14, p87-111, [8]. Duff, Splines in Animaion and Modelling, SIGGRAH Course Noes, [9] G. Farin, Curves and Surfaces for Compuer Aided Geomeric Design, Academic ress, [10] D. Forsey, R. Barels, Hierarchical B-Spline Refinemen, Compuer Graphics, v, n4, p0-1, [11] L. iegl, On NURBS: a Survey, Compuer Graphics & Applicaions, v11, n1, p-71, [1] R. Riesenfeld, Applicaions of B-Spline Approximaion o Geomeric roblems of Compuer Aided Design, hd hesis, Universiy Syracuse, 197.

EECS 487: Interactive Computer Graphics

EECS 487: Interactive Computer Graphics EECS 487: Ineracive Compuer Graphics Lecure 7: B-splines curves Raional Bézier and NURBS Cubic Splines A represenaion of cubic spline consiss of: four conrol poins (why four?) hese are compleely user specified

More information

Curves & Surfaces. Last Time? Today. Readings for Today (pick one) Limitations of Polygonal Meshes. Today. Adjacency Data Structures

Curves & Surfaces. Last Time? Today. Readings for Today (pick one) Limitations of Polygonal Meshes. Today. Adjacency Data Structures Las Time? Adjacency Daa Srucures Geomeric & opologic informaion Dynamic allocaion Efficiency of access Curves & Surfaces Mesh Simplificaion edge collapse/verex spli geomorphs progressive ransmission view-dependen

More information

Spline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification

Spline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification Las Time? Adjacency Daa Srucures Spline Curves Geomeric & opologic informaion Dynamic allocaion Efficiency of access Mesh Simplificaion edge collapse/verex spli geomorphs progressive ransmission view-dependen

More information

Today. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough

Today. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough Today Curves & Surfaces Moivaion Limiaions of Polygonal Models Some Modeling Tools & Definiions Curves Surfaces / Paches Subdivision Surfaces Limiaions of Polygonal Meshes Can We Disguise he Faces? Planar

More information

Last Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets?

Last Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets? Las Time: Curves & Surfaces Expeced value and variance Mone-Carlo in graphics Imporance sampling Sraified sampling Pah Tracing Irradiance Cache Phoon Mapping Quesions? Today Moivaion Limiaions of Polygonal

More information

Schedule. Curves & Surfaces. Questions? Last Time: Today. Limitations of Polygonal Meshes. Acceleration Data Structures.

Schedule. Curves & Surfaces. Questions? Last Time: Today. Limitations of Polygonal Meshes. Acceleration Data Structures. Schedule Curves & Surfaces Sunday Ocober 5 h, * 3-5 PM *, Room TBA: Review Session for Quiz 1 Exra Office Hours on Monday (NE43 Graphics Lab) Tuesday Ocober 7 h : Quiz 1: In class 1 hand-wrien 8.5x11 shee

More information

AML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves

AML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves AML7 CAD LECTURE Space Curves Inrinsic properies Synheic curves A curve which may pass hrough any region of hreedimensional space, as conrased o a plane curve which mus lie on a single plane. Space curves

More information

Implementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report)

Implementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report) Implemening Ray Casing in Terahedral Meshes wih Programmable Graphics Hardware (Technical Repor) Marin Kraus, Thomas Erl March 28, 2002 1 Inroducion Alhough cell-projecion, e.g., [3, 2], and resampling,

More information

STEREO PLANE MATCHING TECHNIQUE

STEREO PLANE MATCHING TECHNIQUE STEREO PLANE MATCHING TECHNIQUE Commission III KEY WORDS: Sereo Maching, Surface Modeling, Projecive Transformaion, Homography ABSTRACT: This paper presens a new ype of sereo maching algorihm called Sereo

More information

A non-stationary uniform tension controlled interpolating 4-point scheme reproducing conics

A non-stationary uniform tension controlled interpolating 4-point scheme reproducing conics A non-saionary uniform ension conrolled inerpolaing 4-poin scheme reproducing conics C. Beccari a, G. Casciola b, L. Romani b, a Deparmen of Pure and Applied Mahemaics, Universiy of Padova, Via G. Belzoni

More information

Sam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes.

Sam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes. 8.F Baery Charging Task Sam wans o ake his MP3 player and his video game player on a car rip. An hour before hey plan o leave, he realized ha he forgo o charge he baeries las nigh. A ha poin, he plugged

More information

Image Content Representation

Image Content Representation Image Conen Represenaion Represenaion for curves and shapes regions relaionships beween regions E.G.M. Perakis Image Represenaion & Recogniion 1 Reliable Represenaion Uniqueness: mus uniquely specify an

More information

Gauss-Jordan Algorithm

Gauss-Jordan Algorithm Gauss-Jordan Algorihm The Gauss-Jordan algorihm is a sep by sep procedure for solving a sysem of linear equaions which may conain any number of variables and any number of equaions. The algorihm is carried

More information

A Matching Algorithm for Content-Based Image Retrieval

A Matching Algorithm for Content-Based Image Retrieval A Maching Algorihm for Conen-Based Image Rerieval Sue J. Cho Deparmen of Compuer Science Seoul Naional Universiy Seoul, Korea Absrac Conen-based image rerieval sysem rerieves an image from a daabase using

More information

CENG 477 Introduction to Computer Graphics. Modeling Transformations

CENG 477 Introduction to Computer Graphics. Modeling Transformations CENG 477 Inroducion o Compuer Graphics Modeling Transformaions Modeling Transformaions Model coordinaes o World coordinaes: Model coordinaes: All shapes wih heir local coordinaes and sies. world World

More information

An Improved Square-Root Nyquist Shaping Filter

An Improved Square-Root Nyquist Shaping Filter An Improved Square-Roo Nyquis Shaping Filer fred harris San Diego Sae Universiy fred.harris@sdsu.edu Sridhar Seshagiri San Diego Sae Universiy Seshigar.@engineering.sdsu.edu Chris Dick Xilinx Corp. chris.dick@xilinx.com

More information

Quantitative macro models feature an infinite number of periods A more realistic (?) view of time

Quantitative macro models feature an infinite number of periods A more realistic (?) view of time INFINIE-HORIZON CONSUMPION-SAVINGS MODEL SEPEMBER, Inroducion BASICS Quaniaive macro models feaure an infinie number of periods A more realisic (?) view of ime Infinie number of periods A meaphor for many

More information

4.1 3D GEOMETRIC TRANSFORMATIONS

4.1 3D GEOMETRIC TRANSFORMATIONS MODULE IV MCA - 3 COMPUTER GRAPHICS ADMN 29- Dep. of Compuer Science And Applicaions, SJCET, Palai 94 4. 3D GEOMETRIC TRANSFORMATIONS Mehods for geomeric ransformaions and objec modeling in hree dimensions

More information

Simultaneous Precise Solutions to the Visibility Problem of Sculptured Models

Simultaneous Precise Solutions to the Visibility Problem of Sculptured Models Simulaneous Precise Soluions o he Visibiliy Problem of Sculpured Models Joon-Kyung Seong 1, Gershon Elber 2, and Elaine Cohen 1 1 Universiy of Uah, Sal Lake Ciy, UT84112, USA, seong@cs.uah.edu, cohen@cs.uah.edu

More information

STRING DESCRIPTIONS OF DATA FOR DISPLAY*

STRING DESCRIPTIONS OF DATA FOR DISPLAY* SLAC-PUB-383 January 1968 STRING DESCRIPTIONS OF DATA FOR DISPLAY* J. E. George and W. F. Miller Compuer Science Deparmen and Sanford Linear Acceleraor Cener Sanford Universiy Sanford, California Absrac

More information

Learning in Games via Opponent Strategy Estimation and Policy Search

Learning in Games via Opponent Strategy Estimation and Policy Search Learning in Games via Opponen Sraegy Esimaion and Policy Search Yavar Naddaf Deparmen of Compuer Science Universiy of Briish Columbia Vancouver, BC yavar@naddaf.name Nando de Freias (Supervisor) Deparmen

More information

4. Minimax and planning problems

4. Minimax and planning problems CS/ECE/ISyE 524 Inroducion o Opimizaion Spring 2017 18 4. Minima and planning problems ˆ Opimizing piecewise linear funcions ˆ Minima problems ˆ Eample: Chebyshev cener ˆ Muli-period planning problems

More information

NEWTON S SECOND LAW OF MOTION

NEWTON S SECOND LAW OF MOTION Course and Secion Dae Names NEWTON S SECOND LAW OF MOTION The acceleraion of an objec is defined as he rae of change of elociy. If he elociy changes by an amoun in a ime, hen he aerage acceleraion during

More information

CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL

CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL Klečka Jan Docoral Degree Programme (1), FEEC BUT E-mail: xkleck01@sud.feec.vubr.cz Supervised by: Horák Karel E-mail: horak@feec.vubr.cz

More information

Integro-differential splines and quadratic formulae

Integro-differential splines and quadratic formulae Inegro-differenial splines and quadraic formulae I.G. BUROVA, O. V. RODNIKOVA S. Peersburg Sae Universiy 7/9 Universiesaya nab., S.Persburg, 9934 Russia i.g.burova@spbu.ru, burovaig@mail.ru Absrac: This

More information

MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008

MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008 MATH 5 - Differenial Equaions Sepember 15, 8 Projec 1, Fall 8 Due: Sepember 4, 8 Lab 1.3 - Logisics Populaion Models wih Harvesing For his projec we consider lab 1.3 of Differenial Equaions pages 146 o

More information

MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES

MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES B. MARCOTEGUI and F. MEYER Ecole des Mines de Paris, Cenre de Morphologie Mahémaique, 35, rue Sain-Honoré, F 77305 Fonainebleau Cedex, France Absrac. In image

More information

Landmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases

Landmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases Lmarks: A New Model for Similariy-Based Paern Querying in Time Series Daabases Chang-Shing Perng Haixun Wang Sylvia R. Zhang D. So Parker perng@cs.ucla.edu hxwang@cs.ucla.edu Sylvia Zhang@cle.com so@cs.ucla.edu

More information

Projection & Interaction

Projection & Interaction Projecion & Ineracion Algebra of projecion Canonical viewing volume rackball inerface ransform Hierarchies Preview of Assignmen #2 Lecure 8 Comp 236 Spring 25 Projecions Our lives are grealy simplified

More information

Optimal Crane Scheduling

Optimal Crane Scheduling Opimal Crane Scheduling Samid Hoda, John Hooker Laife Genc Kaya, Ben Peerson Carnegie Mellon Universiy Iiro Harjunkoski ABB Corporae Research EWO - 13 November 2007 1/16 Problem Track-mouned cranes move

More information

parametric spline curves

parametric spline curves arameric sline curves comuer grahics arameric curves 9 fabio ellacini curves used in many conexs fons animaion ahs shae modeling differen reresenaion imlici curves arameric curves mosly used comuer grahics

More information

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS Mohammed A. Aseeri and M. I. Sobhy Deparmen of Elecronics, The Universiy of Ken a Canerbury Canerbury, Ken, CT2

More information

Coded Caching with Multiple File Requests

Coded Caching with Multiple File Requests Coded Caching wih Muliple File Requess Yi-Peng Wei Sennur Ulukus Deparmen of Elecrical and Compuer Engineering Universiy of Maryland College Park, MD 20742 ypwei@umd.edu ulukus@umd.edu Absrac We sudy a

More information

Real Time Integral-Based Structural Health Monitoring

Real Time Integral-Based Structural Health Monitoring Real Time Inegral-Based Srucural Healh Monioring The nd Inernaional Conference on Sensing Technology ICST 7 J. G. Chase, I. Singh-Leve, C. E. Hann, X. Chen Deparmen of Mechanical Engineering, Universiy

More information

A Principled Approach to. MILP Modeling. Columbia University, August Carnegie Mellon University. Workshop on MIP. John Hooker.

A Principled Approach to. MILP Modeling. Columbia University, August Carnegie Mellon University. Workshop on MIP. John Hooker. Slide A Principled Approach o MILP Modeling John Hooer Carnegie Mellon Universiy Worshop on MIP Columbia Universiy, Augus 008 Proposal MILP modeling is an ar, bu i need no be unprincipled. Slide Proposal

More information

Chapter Six Chapter Six

Chapter Six Chapter Six Chaper Si Chaper Si 0 CHAPTER SIX ConcepTess and Answers and Commens for Secion.. Which of he following graphs (a) (d) could represen an aniderivaive of he funcion shown in Figure.? Figure. (a) (b) (c)

More information

MOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS

MOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS NME: TE: LOK: MOTION ETETORS GRPH MTHING L PRE-L QUESTIONS 1. Read he insrucions, and answer he following quesions. Make sure you resae he quesion so I don hae o read he quesion o undersand he answer..

More information

Precise Voronoi Cell Extraction of Free-form Rational Planar Closed Curves

Precise Voronoi Cell Extraction of Free-form Rational Planar Closed Curves Precise Voronoi Cell Exracion of Free-form Raional Planar Closed Curves Iddo Hanniel, Ramanahan Muhuganapahy, Gershon Elber Deparmen of Compuer Science Technion, Israel Insiue of Technology Haifa 32000,

More information

Collision-Free and Curvature-Continuous Path Smoothing in Cluttered Environments

Collision-Free and Curvature-Continuous Path Smoothing in Cluttered Environments Collision-Free and Curvaure-Coninuous Pah Smoohing in Cluered Environmens Jia Pan 1 and Liangjun Zhang and Dinesh Manocha 3 1 panj@cs.unc.edu, 3 dm@cs.unc.edu, Dep. of Compuer Science, Universiy of Norh

More information

A Fast Non-Uniform Knots Placement Method for B-Spline Fitting

A Fast Non-Uniform Knots Placement Method for B-Spline Fitting 2015 IEEE Inernaional Conference on Advanced Inelligen Mecharonics (AIM) July 7-11, 2015. Busan, Korea A Fas Non-Uniform Knos Placemen Mehod for B-Spline Fiing T. Tjahjowidodo, VT. Dung, and ML. Han Absrac

More information

Video Content Description Using Fuzzy Spatio-Temporal Relations

Video Content Description Using Fuzzy Spatio-Temporal Relations Proceedings of he 4s Hawaii Inernaional Conference on Sysem Sciences - 008 Video Conen Descripion Using Fuzzy Spaio-Temporal Relaions rchana M. Rajurkar *, R.C. Joshi and Sananu Chaudhary 3 Dep of Compuer

More information

1 œ DRUM SET KEY. 8 Odd Meter Clave Conor Guilfoyle. Cowbell (neck) Cymbal. Hi-hat. Floor tom (shell) Clave block. Cowbell (mouth) Hi tom.

1 œ DRUM SET KEY. 8 Odd Meter Clave Conor Guilfoyle. Cowbell (neck) Cymbal. Hi-hat. Floor tom (shell) Clave block. Cowbell (mouth) Hi tom. DRUM SET KEY Hi-ha Cmbal Clave block Cowbell (mouh) 0 Cowbell (neck) Floor om (shell) Hi om Mid om Snare Floor om Snare cross sick or clave block Bass drum Hi-ha wih foo 8 Odd Meer Clave Conor Guilfole

More information

Definition and examples of time series

Definition and examples of time series Definiion and examples of ime series A ime series is a sequence of daa poins being recorded a specific imes. Formally, le,,p be a probabiliy space, and T an index se. A real valued sochasic process is

More information

Design Alternatives for a Thin Lens Spatial Integrator Array

Design Alternatives for a Thin Lens Spatial Integrator Array Egyp. J. Solids, Vol. (7), No. (), (004) 75 Design Alernaives for a Thin Lens Spaial Inegraor Array Hala Kamal *, Daniel V azquez and Javier Alda and E. Bernabeu Opics Deparmen. Universiy Compluense of

More information

MB86297A Carmine Timing Analysis of the DDR Interface

MB86297A Carmine Timing Analysis of the DDR Interface Applicaion Noe MB86297A Carmine Timing Analysis of he DDR Inerface Fujisu Microelecronics Europe GmbH Hisory Dae Auhor Version Commen 05.02.2008 Anders Ramdahl 0.01 Firs draf 06.02.2008 Anders Ramdahl

More information

PART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR

PART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR . ~ PART 1 c 0 \,).,,.,, REFERENCE NFORMATON CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONTOR n CONTROL DATA 6400 Compuer Sysems, sysem funcions are normally handled by he Monior locaed in a Peripheral

More information

LAMP: 3D Layered, Adaptive-resolution and Multiperspective Panorama - a New Scene Representation

LAMP: 3D Layered, Adaptive-resolution and Multiperspective Panorama - a New Scene Representation Submission o Special Issue of CVIU on Model-based and Image-based 3D Scene Represenaion for Ineracive Visualizaion LAMP: 3D Layered, Adapive-resoluion and Muliperspecive Panorama - a New Scene Represenaion

More information

Handling uncertainty in semantic information retrieval process

Handling uncertainty in semantic information retrieval process Handling uncerainy in semanic informaion rerieval process Chkiwa Mounira 1, Jedidi Anis 1 and Faiez Gargouri 1 1 Mulimedia, InfoRmaion sysems and Advanced Compuing Laboraory Sfax Universiy, Tunisia m.chkiwa@gmail.com,

More information

The Impact of Product Development on the Lifecycle of Defects

The Impact of Product Development on the Lifecycle of Defects The Impac of Produc Developmen on he Lifecycle of Rudolf Ramler Sofware Compeence Cener Hagenberg Sofware Park 21 A-4232 Hagenberg, Ausria +43 7236 3343 872 rudolf.ramler@scch.a ABSTRACT This paper invesigaes

More information

A time-space consistency solution for hardware-in-the-loop simulation system

A time-space consistency solution for hardware-in-the-loop simulation system Inernaional Conference on Advanced Elecronic Science and Technology (AEST 206) A ime-space consisency soluion for hardware-in-he-loop simulaion sysem Zexin Jiang a Elecric Power Research Insiue of Guangdong

More information

The Beer Dock: Three and a Half Implementations of the Beer Distribution Game

The Beer Dock: Three and a Half Implementations of the Beer Distribution Game The Beer Dock 2002-08-13 17:55:44-0700 The Beer Dock: Three and a Half Implemenaions of he Beer Disribuion Game Michael J. Norh[1] and Charles M. Macal Argonne Naional Laboraory, Argonne, Illinois Absrac

More information

Image segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding

Image segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding Moivaion Image segmenaion Which pixels belong o he same objec in an image/video sequence? (spaial segmenaion) Which frames belong o he same video sho? (emporal segmenaion) Which frames belong o he same

More information

Visualizing Complex Notions of Time

Visualizing Complex Notions of Time Visualizing Complex Noions of Time Rober Kosara, Silvia Miksch Insiue of Sofware Technology, Vienna Universiy of Technology, Vienna, Ausria Absrac Time plays an imporan role in medicine. Condiions are

More information

Evaluation and Improvement of Region-based Motion Segmentation

Evaluation and Improvement of Region-based Motion Segmentation Evaluaion and Improvemen of Region-based Moion Segmenaion Mark Ross Universiy Koblenz-Landau, Insiue of Compuaional Visualisics, Universiässraße 1, 56070 Koblenz, Germany Email: ross@uni-koblenz.de Absrac

More information

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley. Shores Pah Algorihms Background Seing: Lecure I: Shores Pah Algorihms Dr Kieran T. Herle Deparmen of Compuer Science Universi College Cork Ocober 201 direced graph, real edge weighs Le he lengh of a pah

More information

Network management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional);

Network management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional); QoS in Frame Relay Frame relay characerisics are:. packe swiching wih virual circui service (virual circuis are bidirecional);. labels are called DLCI (Daa Link Connecion Idenifier);. for connecion is

More information

DETC2004/CIE VOLUME-BASED CUT-AND-PASTE EDITING FOR EARLY DESIGN PHASES

DETC2004/CIE VOLUME-BASED CUT-AND-PASTE EDITING FOR EARLY DESIGN PHASES Proceedings of DETC 04 ASME 004 Design Engineering Technical Conferences and Compuers and Informaion in Engineering Conference Sepember 8-Ocober, 004, Sal Lake Ciy, Uah USA DETC004/CIE-57676 VOLUME-BASED

More information

In Proceedings of CVPR '96. Structure and Motion of Curved 3D Objects from. using these methods [12].

In Proceedings of CVPR '96. Structure and Motion of Curved 3D Objects from. using these methods [12]. In Proceedings of CVPR '96 Srucure and Moion of Curved 3D Objecs from Monocular Silhouees B Vijayakumar David J Kriegman Dep of Elecrical Engineering Yale Universiy New Haven, CT 652-8267 Jean Ponce Compuer

More information

Voltair Version 2.5 Release Notes (January, 2018)

Voltair Version 2.5 Release Notes (January, 2018) Volair Version 2.5 Release Noes (January, 2018) Inroducion 25-Seven s new Firmware Updae 2.5 for he Volair processor is par of our coninuing effors o improve Volair wih new feaures and capabiliies. For

More information

Scattering at an Interface: Normal Incidence

Scattering at an Interface: Normal Incidence Course Insrucor Dr. Raymond C. Rumpf Office: A 337 Phone: (915) 747 6958 Mail: rcrumpf@uep.edu 4347 Applied lecromagneics Topic 3f Scaering a an Inerface: Normal Incidence Scaering These Normal noes Incidence

More information

Computer representations of piecewise

Computer representations of piecewise Edior: Gabriel Taubin Inroducion o Geomeric Processing hrough Opimizaion Gabriel Taubin Brown Universiy Compuer represenaions o piecewise smooh suraces have become vial echnologies in areas ranging rom

More information

Hermite Curves. Jim Armstrong Singularity November 2005

Hermite Curves. Jim Armstrong Singularity November 2005 TechNoe TN-5- Herie Curves Ji Arsrong Singulariy Noveer 5 This is he second in a series of TechNoes on he sujec of applied curve aheaics in Adoe Flash TM. Each TechNoe provides a aheaical foundaion for

More information

Research Article Auto Coloring with Enhanced Character Registration

Research Article Auto Coloring with Enhanced Character Registration Compuer Games Technology Volume 2008, Aricle ID 35398, 7 pages doi:0.55/2008/35398 Research Aricle Auo Coloring wih Enhanced Characer Regisraion Jie Qiu, Hock Soon Seah, Feng Tian, Quan Chen, Zhongke Wu,

More information

4 Error Control. 4.1 Issues with Reliable Protocols

4 Error Control. 4.1 Issues with Reliable Protocols 4 Error Conrol Jus abou all communicaion sysems aemp o ensure ha he daa ges o he oher end of he link wihou errors. Since i s impossible o build an error-free physical layer (alhough some shor links can

More information

Effects needed for Realism. Ray Tracing. Ray Tracing: History. Outline. Foundations of Computer Graphics (Fall 2012)

Effects needed for Realism. Ray Tracing. Ray Tracing: History. Outline. Foundations of Computer Graphics (Fall 2012) Foundaions of ompuer Graphics (Fall 2012) S 184, Lecure 16: Ray Tracing hp://ins.eecs.berkeley.edu/~cs184 Effecs needed for Realism (Sof) Shadows Reflecions (Mirrors and Glossy) Transparency (Waer, Glass)

More information

Announcements For The Logic of Boolean Connectives Truth Tables, Tautologies & Logical Truths. Outline. Introduction Truth Functions

Announcements For The Logic of Boolean Connectives Truth Tables, Tautologies & Logical Truths. Outline. Introduction Truth Functions Announcemens For 02.05.09 The Logic o Boolean Connecives Truh Tables, Tauologies & Logical Truhs 1 HW3 is due nex Tuesday William Sarr 02.05.09 William Sarr The Logic o Boolean Connecives (Phil 201.02)

More information

Petri Nets for Object-Oriented Modeling

Petri Nets for Object-Oriented Modeling Peri Nes for Objec-Oriened Modeling Sefan Wi Absrac Ensuring he correcness of concurren rograms is difficul since common aroaches for rogram design do no rovide aroriae mehods This aer gives a brief inroducion

More information

Michiel Helder and Marielle C.T.A Geurts. Hoofdkantoor PTT Post / Dutch Postal Services Headquarters

Michiel Helder and Marielle C.T.A Geurts. Hoofdkantoor PTT Post / Dutch Postal Services Headquarters SHORT TERM PREDICTIONS A MONITORING SYSTEM by Michiel Helder and Marielle C.T.A Geurs Hoofdkanoor PTT Pos / Duch Posal Services Headquarers Keywords macro ime series shor erm predicions ARIMA-models faciliy

More information

Visual Perception as Bayesian Inference. David J Fleet. University of Toronto

Visual Perception as Bayesian Inference. David J Fleet. University of Toronto Visual Percepion as Bayesian Inference David J Flee Universiy of Torono Basic rules of probabiliy sum rule (for muually exclusive a ): produc rule (condiioning): independence (def n ): Bayes rule: marginalizaion:

More information

Research Article Shape Preserving Interpolation Using C 2 Rational Cubic Spline

Research Article Shape Preserving Interpolation Using C 2 Rational Cubic Spline Applied Mahemaics Volume 1, Aricle ID 73, 1 pages hp://dx.doi.org/1.11/1/73 Research Aricle Shape Preserving Inerpolaion Using C Raional Cubic Spline Samsul Ariffin Abdul Karim 1 and Kong Voon Pang 1 Fundamenal

More information

Rule-Based Multi-Query Optimization

Rule-Based Multi-Query Optimization Rule-Based Muli-Query Opimizaion Mingsheng Hong Dep. of Compuer cience Cornell Universiy mshong@cs.cornell.edu Johannes Gehrke Dep. of Compuer cience Cornell Universiy johannes@cs.cornell.edu Mirek Riedewald

More information

COMP26120: Algorithms and Imperative Programming

COMP26120: Algorithms and Imperative Programming COMP26120 ecure C3 1/48 COMP26120: Algorihms and Imperaive Programming ecure C3: C - Recursive Daa Srucures Pee Jinks School of Compuer Science, Universiy of Mancheser Auumn 2011 COMP26120 ecure C3 2/48

More information

Improving the Efficiency of Dynamic Service Provisioning in Transport Networks with Scheduled Services

Improving the Efficiency of Dynamic Service Provisioning in Transport Networks with Scheduled Services Improving he Efficiency of Dynamic Service Provisioning in Transpor Neworks wih Scheduled Services Ralf Hülsermann, Monika Jäger and Andreas Gladisch Technologiezenrum, T-Sysems, Goslarer Ufer 35, D-1585

More information

An Adaptive Spatial Depth Filter for 3D Rendering IP

An Adaptive Spatial Depth Filter for 3D Rendering IP JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, VOL.3, NO. 4, DECEMBER, 23 175 An Adapive Spaial Deph Filer for 3D Rendering IP Chang-Hyo Yu and Lee-Sup Kim Absrac In his paper, we presen a new mehod

More information

SOT: Compact Representation for Triangle and Tetrahedral Meshes

SOT: Compact Representation for Triangle and Tetrahedral Meshes SOT: Compac Represenaion for Triangle and Terahedral Meshes Topraj Gurung and Jarek Rossignac School of Ineracive Compuing, College of Compuing, Georgia Insiue of Technology, Alana, GA ABSTRACT The Corner

More information

Rao-Blackwellized Particle Filtering for Probing-Based 6-DOF Localization in Robotic Assembly

Rao-Blackwellized Particle Filtering for Probing-Based 6-DOF Localization in Robotic Assembly MITSUBISHI ELECTRIC RESEARCH LABORATORIES hp://www.merl.com Rao-Blackwellized Paricle Filering for Probing-Based 6-DOF Localizaion in Roboic Assembly Yuichi Taguchi, Tim Marks, Haruhisa Okuda TR1-8 June

More information

Data Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2

Data Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2 Daa Srucures and Algorihms The maerial for his lecure is drawn, in par, from The Pracice of Programming (Kernighan & Pike) Chaper 2 1 Moivaing Quoaion Every program depends on algorihms and daa srucures,

More information

Fill in the following table for the functions shown below.

Fill in the following table for the functions shown below. By: Carl H. Durney and Neil E. Coer Example 1 EX: Fill in he following able for he funcions shown below. he funcion is odd he funcion is even he funcion has shif-flip symmery he funcion has quarer-wave

More information

Streamline Pathline Eulerian Lagrangian

Streamline Pathline Eulerian Lagrangian Sreamline Pahline Eulerian Lagrangian Sagnaion Poin Flow V V V = + = + = + o V xi y j a V V xi y j o Pahline and Sreakline Insananeous Sreamlines Pahlines Sreaklines Maerial Derivaive Acceleraion

More information

Analysis of Various Types of Bugs in the Object Oriented Java Script Language Coding

Analysis of Various Types of Bugs in the Object Oriented Java Script Language Coding Indian Journal of Science and Technology, Vol 8(21), DOI: 10.17485/ijs/2015/v8i21/69958, Sepember 2015 ISSN (Prin) : 0974-6846 ISSN (Online) : 0974-5645 Analysis of Various Types of Bugs in he Objec Oriened

More information

An efficient approach to improve throughput for TCP vegas in ad hoc network

An efficient approach to improve throughput for TCP vegas in ad hoc network Inernaional Research Journal of Engineering and Technology (IRJET) e-issn: 395-0056 Volume: 0 Issue: 03 June-05 www.irje.ne p-issn: 395-007 An efficien approach o improve hroughpu for TCP vegas in ad hoc

More information

Visual Indoor Localization with a Floor-Plan Map

Visual Indoor Localization with a Floor-Plan Map Visual Indoor Localizaion wih a Floor-Plan Map Hang Chu Dep. of ECE Cornell Universiy Ihaca, NY 14850 hc772@cornell.edu Absrac In his repor, a indoor localizaion mehod is presened. The mehod akes firsperson

More information

Simple Network Management Based on PHP and SNMP

Simple Network Management Based on PHP and SNMP Simple Nework Managemen Based on PHP and SNMP Krasimir Trichkov, Elisavea Trichkova bsrac: This paper aims o presen simple mehod for nework managemen based on SNMP - managemen of Cisco rouer. The paper

More information

Open Access Research on an Improved Medical Image Enhancement Algorithm Based on P-M Model. Luo Aijing 1 and Yin Jin 2,* u = div( c u ) u

Open Access Research on an Improved Medical Image Enhancement Algorithm Based on P-M Model. Luo Aijing 1 and Yin Jin 2,* u = div( c u ) u Send Orders for Reprins o reprins@benhamscience.ae The Open Biomedical Engineering Journal, 5, 9, 9-3 9 Open Access Research on an Improved Medical Image Enhancemen Algorihm Based on P-M Model Luo Aijing

More information

NURBS rendering in OpenSG Plus

NURBS rendering in OpenSG Plus NURS rering in OpenSG Plus F. Kahlesz Á. alázs R. Klein Universiy of onn Insiue of Compuer Science II Compuer Graphics Römersrasse 164. 53117 onn, Germany Absrac Mos of he indusrial pars are designed as

More information

Navigating in a Shape Space of Registered Models

Navigating in a Shape Space of Registered Models Navigaing in a Shape Space of Regisered Models Randall C. Smih, Member, IEEE, Richard Pawlicki, Isván Kókai, Jörg Finger and Thomas Veer, Member, IEEE Absrac New produc developmen involves people wih differen

More information

Growing Least Squares for the Analysis of Manifolds in Scale-Space

Growing Least Squares for the Analysis of Manifolds in Scale-Space Growing Leas Squares for he Analysis of Manifolds in Scale-Space Nicolas Mellado, Gaël Guennebaud, Pascal Barla, Parick Reuer, Chrisophe Schlick To cie his version: Nicolas Mellado, Gaël Guennebaud, Pascal

More information

Project #1 Math 285 Name:

Project #1 Math 285 Name: Projec #1 Mah 85 Name: Solving Orinary Differenial Equaions by Maple: Sep 1: Iniialize he program: wih(deools): wih(pdeools): Sep : Define an ODE: (There are several ways of efining equaions, we sar wih

More information

It is easier to visualize plotting the curves of cos x and e x separately: > plot({cos(x),exp(x)},x = -5*Pi..Pi,y = );

It is easier to visualize plotting the curves of cos x and e x separately: > plot({cos(x),exp(x)},x = -5*Pi..Pi,y = ); Mah 467 Homework Se : some soluions > wih(deools): wih(plos): Warning, he name changecoords has been redefined Problem :..7 Find he fixed poins, deermine heir sabiliy, for x( ) = cos x e x > plo(cos(x)

More information

Probabilistic Detection and Tracking of Motion Discontinuities

Probabilistic Detection and Tracking of Motion Discontinuities Probabilisic Deecion and Tracking of Moion Disconinuiies Michael J. Black David J. Flee Xerox Palo Alo Research Cener 3333 Coyoe Hill Road Palo Alo, CA 94304 fblack,fleeg@parc.xerox.com hp://www.parc.xerox.com/fblack,fleeg/

More information

Service Oriented Solution Modeling and Variation Propagation Analysis based on Architectural Building Blocks

Service Oriented Solution Modeling and Variation Propagation Analysis based on Architectural Building Blocks Carnegie Mellon Universiy From he SelecedWorks of Jia Zhang Ocober, 203 Service Oriened Soluion Modeling and Variaion Propagaion Analysis based on Archiecural uilding locks Liang-Jie Zhang Jia Zhang Available

More information

Automatic Calculation of Coverage Profiles for Coverage-based Testing

Automatic Calculation of Coverage Profiles for Coverage-based Testing Auomaic Calculaion of Coverage Profiles for Coverage-based Tesing Raimund Kirner 1 and Waler Haas 1 Vienna Universiy of Technology, Insiue of Compuer Engineering, Vienna, Ausria, raimund@vmars.uwien.ac.a

More information

Representing Non-Manifold Shapes in Arbitrary Dimensions

Representing Non-Manifold Shapes in Arbitrary Dimensions Represening Non-Manifold Shapes in Arbirary Dimensions Leila De Floriani,2 and Annie Hui 2 DISI, Universiy of Genova, Via Dodecaneso, 35-646 Genova (Ialy). 2 Deparmen of Compuer Science, Universiy of Maryland,

More information

MIC2569. Features. General Description. Applications. Typical Application. CableCARD Power Switch

MIC2569. Features. General Description. Applications. Typical Application. CableCARD Power Switch CableCARD Power Swich General Descripion is designed o supply power o OpenCable sysems and CableCARD hoss. These CableCARDs are also known as Poin of Disribuion (POD) cards. suppors boh Single and Muliple

More information

A new method for 3-dimensional roadway design using visualization techniques

A new method for 3-dimensional roadway design using visualization techniques Urban Transor XIII: Urban Transor and he Environmen in he 2s Cenury 23 A new mehod for 3-dimensional roadway design using visualizaion echniques G. Karri & M. K. Jha Dearmen of Civil Engineering, Morgan

More information

Motion Estimation of a Moving Range Sensor by Image Sequences and Distorted Range Data

Motion Estimation of a Moving Range Sensor by Image Sequences and Distorted Range Data Moion Esimaion of a Moving Range Sensor by Image Sequences and Disored Range Daa Asuhiko Banno, Kazuhide Hasegawa and Kasushi Ikeuchi Insiue of Indusrial Science Universiy of Tokyo 4-6-1 Komaba, Meguro-ku,

More information

Real time 3D face and facial feature tracking

Real time 3D face and facial feature tracking J Real-Time Image Proc (2007) 2:35 44 DOI 10.1007/s11554-007-0032-2 ORIGINAL RESEARCH PAPER Real ime 3D face and facial feaure racking Fadi Dornaika Æ Javier Orozco Received: 23 November 2006 / Acceped:

More information

Video-Based Face Recognition Using Probabilistic Appearance Manifolds

Video-Based Face Recognition Using Probabilistic Appearance Manifolds Video-Based Face Recogniion Using Probabilisic Appearance Manifolds Kuang-Chih Lee Jeffrey Ho Ming-Hsuan Yang David Kriegman klee10@uiuc.edu jho@cs.ucsd.edu myang@honda-ri.com kriegman@cs.ucsd.edu Compuer

More information

Parallel and Distributed Systems for Constructive Neural Network Learning*

Parallel and Distributed Systems for Constructive Neural Network Learning* Parallel and Disribued Sysems for Consrucive Neural Nework Learning* J. Flecher Z. Obradovi School of Elecrical Engineering and Compuer Science Washingon Sae Universiy Pullman WA 99164-2752 Absrac A consrucive

More information

On Continuity of Complex Fuzzy Functions

On Continuity of Complex Fuzzy Functions Mahemaical Theory and Modeling www.iise.org On Coninuiy of Complex Fuzzy Funcions Pishiwan O. Sabir Deparmen of Mahemaics Faculy of Science and Science Educaion Universiy of Sulaimani Iraq pishiwan.sabir@gmail.com

More information