Discrete surface modelling using partial differential equations

Size: px
Start display at page:

Download "Discrete surface modelling using partial differential equations"

Transcription

1 Computer Aded Geometrc Desgn 23 (2006) Dscrete surface modellng usng partal dfferental equatons Guolang Xu a,1,qngpan a, Chandrajt L. Bajaj b,,2 a State Key Laboratory of Scentfc and Engneerng Computng, Insttute of Computatonal Mathematcs, Academy of Mathematcs and System Scences, Chnese Academy of Scences, Bejng, , Chna b Center for Computatonal Vsualzaton and Insttute for Computatonal Engneerng & Scences, Department of Computer Scence, Unversty of Texas, Austn, TX 78712, USA Receved 29 July 2004; receved n revsed form 15 May 2005; accepted 23 May 2005 Avalable onlne 5 July 2005 Abstract We use varous nonlnear partal dfferental equatons to effcently solve several surface modellng problems, ncludng surface blendng, N-sded hole fllng and free-form surface fttng. The nonlnear equatons used nclude two second order flows, two fourth order flows and two sxth order flows. These nonlnear equatons are dscretzed based on dscrete dfferental geometry operators. The proposed approach s smple, effcent and gves very desrable results, for a range of surface models, possbly havng sharp creases and corners Elsever B.V. All rghts reserved. Keywords: Free-form surface fttng; Blendng; N-sded hole; Dfferental equatons 1. Introducton We use varous partal dfferental equatons (PDE) to solve several surface modellng problems. The PDEs we use nclude the mean curvature flow, the averaged mean curvature flow, two fourth order (surface dffuson flow and quas surface dffuson flow) and even hgher order flows. All these equatons are * Correspondng author. E-mal address: bajaj@cs.utexas.edu (C.L. Bajaj). 1 Supported n part by Natural Scence Foundaton of Chna ( ) and Natonal Key Basc Research Project of Chna (2004CB318000). 2 Supported n part by NSF grant ACI , NSF-ITR grants ACI and EIA , and a grant from NIH R01 GM /$ see front matter 2005 Elsever B.V. All rghts reserved. do: /j.cagd

2 126 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) nonlnear and the geometry s ntrnsc,.e., the PDEs do not depend upon any partcular parameterzaton. The problems we solve nclude surface blendng, N-sded hole fllng and free-form surface fttng wth hgh order boundary contnuty. For the problems of surface blendng and N-sded hole fllng, we are gven trangular surface meshes of the surroundng area. Trangular surface patches need to be constructed to fll the openngs enclosed by the surroundng surface mesh and nterpolate the hole boundary wth some specfed order of contnuty. For the free-form surface fttng problem, we are possbly gven a set of ponts, or a wre frame of curves that defnes an outlne of the desred shape, or even some surface patches. We construct a surface whch nterpolates the ponts or curves or the boundares of the patches wth specfed order of contnuty. The free-form surface fttng problem s the most general, ncludng the surface blendng and N-sded hole fllng problems, as ts specal cases. Our twofold strategy for solvng these problems s as follows: Frst we construct an ntal trangular surface mesh ( fller ) usng any of a number of automatc or sem-automatc free-form modellng technques (see (Bajaj and Ihm, 1992; Bajaj et al., 1993; Grener, 1994; Peters and Wttman, 1996; Xu et al., 2001)). One may also nteractvely edt ths fller to meet the weak assumptons for an ntal soluton shape. Ths fller may be bumpy or nosy, and n general ths fller does not satsfy the smoothness boundary condtons, though t may roughly characterze the shape of the surface to be constructed. Second we deform the ntal mesh by solvng a sutable flow PDE. Unlke most of the prevous free-form modellng technques, our approach solves hgh-order boundary contnuty constrants wthout any pror estmaton of normals or dervatve jets along the boundary. The soluton of the PDE s tme dependent. We consder two possbltes for the tme span of the evoluton. One s a short tme evoluton, where we requre the soluton to respect to the ntal shape or geometry (see Fg. 7). The other s a long tme evoluton, where the ntal fller provdes a topologcal structure, and what we look for s a stable soluton state of the flow (see Fgs. 1 and 4). In ths paper, we focus our attenton on these twofold solutons of PDEs wth boundary contnuty constrants, rather than the constructon of ntal fller mesh. In Secton 3.4, we present automatc approaches for constructng the ntal fller mesh, and our preferred choce. Prevous work. Earler research on usng PDEs to handle surface modellng problems trace back to Bloor et al. s papers at the end of the 1980s (Bloor and Wlson, 1989, 1990). The basc dea of these Fg. 1. (a) shows a head mesh wth a hole around the nose. (b) shows an ntal fller constructon of the nose wth a pece of mnmal surface. (c) the fller surface, after 30 teraton, generated usng fourth order flow (k = 2 n (2.9)) wth tme step sze (d) the fller surface, after 20 teraton, generated usng sxth order flow (k = 3 n (2.9)) wth tme step sze

3 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) papers s the use of bharmonc equatons on a rectangular doman to solve the blendng and hole fllng problems. One of the advantages of usng the bharmonc equaton s that t s lnear, and therefore easer to solve. However, the equaton s not geometry ntrnsc and the soluton of the equaton (the geometry of the surface) depends on the concrete parameterzaton used. Furthermore, these methods are napproprate to model surfaces wth arbtrary shaped boundares. The evoluton technque, based on the heat equaton t p p = 0, has been extensvely used n the area of mage processng (see (Preußer and Rumpf, 1999; Weckert, 1998). In (Weckert, 1998), there are 453 relevant references lsted), where s a 2D Laplace operator. Ths was extended lately to smoothng or farng nosy surfaces (see (Clarenz et al., 2000; Desbrun et al., 1999; Meyer et al., 2002)). For a surface M, the counterpart of the Laplacan s the Laplace Beltram operator M (see (do Carmo, 1992)). One then obtans the geometrc dffuson equaton t p M p = 0 for a surface pont p(t) on the surface. Taubn (1995) dscussed the dscretzed operator of the Laplacan and related approaches n the context of generalzed frequences on meshes. Kobbelt (1996) consdered dscrete approxmatons of the Laplacan n the constructon of far nterpolatory subdvson schemes. Ths work was extended n (Kobbelt et al., 1998) to arbtrary connectvty for purposes of mult-resoluton nteractve edtng. Desbrun et al. (1999) used an mplct dscretzaton of geometrc dffuson to obtan a strongly stable numercal smoothng scheme. The same strategy of dscretzaton s also adopted and analyzed by Deckelnck and Dzuk (2002) wth the concluson that ths scheme s uncondtonally stable. Clarenz et al. (2000) ntroduced ansotropc geometrc dffuson to enhance features whle smoothng. Ohtake et al. (2000) combned an nner farness mechansm n ther farng process to ncrease the mesh regularty. Bajaj and Xu (2003) smooth both surfaces and functons on surfaces, n a C 2 smooth functon space defned by the lmt of trangular subdvson surfaces (quartc Box splnes). Smlar to the surface dffuson usng the Laplacan, a more general class of PDE based methods called flow surface technques have been developed whch smulate dfferent knds of flows on surfaces (see (Westermann et al., 2000) for references) usng the equaton t p V(p,t)= 0, where V(p,t)represents the nstantaneous statonary velocty feld. Level set methods were also used n surface farng and surface reconstructon (see (Bajaj et al., 2003; Bertalmo et al., 2000; Chopp and Sethan, 1999; Museth et al., 2002; Osher and Fedkw, 2000; Whtaker and Breen, 1998; Zhao et al., 2000)). In these methods, surfaces are formulated as so-surfaces (level surfaces) of 3D functons, whch are usually defned from the sgned dstance over Cartesan grds of a volume. An evoluton PDE on the volume governs the behavor of the level surface. These levelset methods have several attractve features ncludng, ease of mplementaton, arbtrary topology (see (Breen and Whtaker, 2001)) and a growng body of theoretcal results. Often, fne surface structures are not captured by level sets, although t s possble to use adaptve (see (Preußer and Rumpf, 1999)) and trangulated grds as well as Hermte data (see (Kobbelt et al., 2001)). To reduce the computatonal complexty, Bertalmo et al. (2000) solve the PDE n a narrow band for deformng vectoral functons on surfaces (wth a fxed surface represented by the level surface). Recently, surface dffuson flow has been used to solve the surface blendng problem and free-form surface fttng problem (Schneder and Kobbelt, 2000; Schneder and Kobbelt, 2001). In (Schneder and Kobbelt, 2000), far meshes wth G 1 condtons are created n the specal case where the meshes are assumed to have subdvson connectvty. In ths paper, local surface parameterzaton s stll used to estmate the surface curvatures. The later paper (Schneder and Kobbelt, 2001) uses the same equaton for smoothng meshes whle satsfyng G 1 boundary condtons. Outer farness (the smoothness n the classcal sense) and nner farness (the regularty of the vertex dstrbuton) crtera are used n ther farng

4 128 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) process. The fnte element method s used by Clarenz et al. (2004) to solve the Wllmore flow equaton, based on a new varatonal formulaton of the flow, for the am of surface restoraton. Wllmore flow s also used to smooth trangular mesh n (Yoshzawa and Belyaev, 2002). Man results. We use second order flows (mean curvature flow and averaged mean curvature flow) for G 0 contnuty, fourth order flows for G 1 contnuty and sxth order flows for G 2 contnuty n each of several surface modellng problems. The proposed approach s smple and easy to mplement. It s general, solves several surface modellng problems n the same manner, and gves very desrable results for a range of complcated free-form surface models, possbly havng sharp features and corners. Furthermore, t avods the estmaton of normals or tangents or curvatures on the boundares. The rest of the paper s organzed as follows: Secton 2 descrbes several nonlnear PDEs used n ths paper. In Secton 3, we gve detals of the dscretzaton and the numercal computaton for the solutons of the PDEs. Examples to llustrate the dfferent effects achevable from the soluton of the PDEs are gvennsecton4. 2. Partal dfferental equaton models Let M be a smooth surface and p M be the surface pont. The general form of the geometrc flows we consder s n the followng form (see (Westermann et al., 2000)) p t = V(p,t), where V(p,t) R 3 represents a velocty feld. We shall focus our attenton on usng two classes velocty felds, one s curvature drven velocty feld n the normal drecton, the other s the hgher order Laplace Beltram operators actng on surface pont p Geometrc partal dfferental equatons We now descrbe several geometrc PDE models we use n ths paper. More detals on the exstence and unqueness of the solutons, the numercal computatons of the solutons and evoluton behavors can be found n a seres of papers by Mayer, Smonett, Escher (Escher et al., 1998; Escher and Smonett, 1998; Smonett, 2001) and Huskens (1987) paper. Let M 0 be a compact closed mmersed orentable surface n R 3. A curvature drven geometrc evoluton conssts of fndng a famly {: t 0} of smooth closed mmersed orentable surfaces n R 3 whch evolve accordng to the flow equaton p t = N(p)V n(k 1,k 2,p), M(0) = M 0. (2.1) Here p(t) s a surface pont on, V n (k 1,k 2,p)denotes the normal velocty of, whch depends on the prncpal curvatures k 1,k 2 of, N(p) stands for the unt normal of the surface at p(t). In ths paper we dentfy the surface pont p and surface normal N(p) as 3 1 matrces (column vectors). Hence, the arthmetc operatons of these quanttes are regarded matrx operatons. The product of a scalar a R and a matrx M s wrtten as ether am or Ma.

5 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) Let A(t) denote the area of, V(t)denote the volume of the regon enclosed by. Then t has been shown that (see (Wllmore, 1993, Theorem 4)) da(t) dv(t) = V n H dσ, = V n dσ, (2.2) dt dt where H = 1 2 (k 1 + k 2 ) s the mean curvature of Mean curvature flow (see (Dzuk, 1991; Whte, 2002)) Takng V n = H = 1 2 (k 1 + k 2 ) n (2.1), we obtan the mean curvature flow PDE: p t = N(p)H(p), M(0) = M 0. (2.3) It follows from (2.2) that da(t) = dt H 2 dσ. (2.4) (2.4) mples that the mean curvature flow s area reducng Averaged mean curvature flow (see (Escher and Smonett, 1998; Huskens, 1987; Sapro, 2001)) In (2.1), f we take V n = h(t) H(t),whereh(t) = H dσ/ dσ, then we have the averaged mean curvature flow PDE: p t = N(p)[ h(t) H(p) ], M(0) = M 0. (2.5) The exstence proof of the global solutons to ths flow can be found n Huskens (1987) paper. It follows from (2.2) that da(t) [ = (hh H 2 ) dσ = hh H 2 h(h H) ] dσ = (h H) 2 dσ 0, (2.6) dt snce obvously h(h H)= h(h dσ H dσ)= 0. On the other hand, the second equaton of (2.2) mples that dv(t) = h(t) dσ H dσ = 0. dt Hence the averaged mean curvature flow s volume preservng and area shrnkng. The area shrnkng stops f H h Surface dffuson flow (see (Schneder and Kobbelt, 2001)) If we take V n = H, we get the so-called surface dffuson flow PDE: p t = N(p) H (p), M(0) = M 0, (2.7)

6 130 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) where := M s Laplace Beltram operator whch acts on functons defned on surface. The exstence and unqueness of solutons for ths flow s gven n (Escher et al., 1998). From (2.2) and Green s formula we have d dt A(t) = H H dσ = H 2 dσ 0, d dt V(t)= dv( H)dσ = H (1) dσ = 0, where stands for the (tangental) gradent operator (see (do Carmo, 1976, pp )) actng on dfferental functons defned on the surface M. Hence, the surface dffuson flow s area shrnkng, but volume preservng. The area stops shrnkng when the gradent of H s zero. That s, M s a surface wth constant mean curvature Hgher order geometrc flows p t = ( 1)k+1 N(p) k H(p), M(0) = M 0. (2.8) Usng Green formula, we have k H dσ = ( k 1 H)dσ = ( k 1 H) (1) dσ = 0. Hence, the flow (2.8) s volume preservng f k 1 from the second equaton of (2.2). Remark 2.1. We should note that the area/volume preservng/shrnkng propertes for the flows mentoned above are vald for closed surfaces. In our applcaton of these flows, these propertes may not be true snce the surfaces always have fxed boundares. For a open surface wth fx boundary, the volume V(t) could be defned as the drectonal volume between M(0) and. It s easy to see that the volume preservng property for the averaged mean curvature flow s stll vald. But for the hgher order flow (2.8) (k 1), ths property s no longer vald, because a term related to the boundary does not vansh when Green s formula s used. For our modellng problems, volume preservaton s not a desrable property (see Fgs. 1 and 4). Remark 2.2. In (Schneder and Kobbelt, 2001), Schneder and Kobbelt use ellptc equaton N(p) H(p) = 0, whle we use several tme dependent parabolc type equatons. In our approach, we have a progressve process startng from an ntal value, so that a famly of solutons s obtaned. Such an approach s very desrable f the ntal value s an approxmaton of the requred soluton Quas geometrc partal dfferental equatons Now we generalze the heat equaton on a surface to the followng hgher order flows: p t = ( 1)k+1 k p, M(0) = M 0, k>0. (2.9)

7 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) Snce p = 2H(x)N(p), t s easy to see that (2.9) s the mean curvature flow when k = 1 (up to a factor 2). But snce ( k H)N k (H N) n general, (2.9) s dfferent from the flow (2.8). To dstngush the dfference between (2.8) and (2.9), we call (2.9) as a quas geometrc PDE. The experments conducted n ths paper show that flows (2.9) sometmes behave better than the geometrc flows mentoned above for our geometry modellng problems. However, the theoretcal analyss on the exstence and stablty of ther solutons s currently unavalable. 3. Soluton of the PDEs There are bascally two classes of approaches for solvng a PDE on any doman. One approach s based on fnte dvded dfferences, the other s based on fnte elements (see (Bajaj and Xu, 2003; Clarenz et al., 2004; Deckelnck and Dzuk, 2002)). The approach we adopt n ths paper s based on fnte dvded dfferences. Snce we are dealng wth dfferental equatons over 2-manfolds n R 3, the classcal fnte dvded dfferences wll be replaced by dscretzed dfferental geometrc operators over surfaces. Secton 3.1 deals wth dscretzed geometrc dfferental operators. Next n Secton 3.2 we detal how the boundary condtons are respected. Dscretzatons of the PDEs n the spatal drecton are descrbed n Sectons 3.3 and 3.4. Sem-mplct dscretzaton n the tme doman s consdered n Secton 3.5. Other ssues, such as mesh regularzaton and ntal mesh constructon, are addressed n Secton Dscretzed Laplace Beltram operator One of the fundamental problems n solvng our PDEs s the dscretzaton of the Laplace Beltram operator. On a trangular surface mesh, several dscretzed approxmatons of the operator have been proposed (see (Desbrun et al., 1999; Guskov et al., 1999; Taubn, 2000; Xu, 2004b)). In ths paper we adopt the dscretzaton developed by Meyer et al. n (Meyer et al., 2002). A comparatve research about the varous dscretzed Laplace Beltram operators s conducted n (Xu, 2004a). It has been shown that the scheme of Meyer et al. s s better for dscretzng our PDEs. Let f be a smooth functon on a surface, then f s approxmated over a trangular mesh M by f (p ) 1 A M (p ) j N 1 () cot α j + cot β j 2 [ f(pj ) f(p ) ], (3.1) where N 1 () s the ndex set of 1-rng of neghbor vertces of vertex p, α j and β j are the trangle angles shown n Fg. 2 (left). A M (p ) s the area for vertex p as shown n Fg. 2 (rght), where q j s the crcumcenter pont for the trangle [p j 1 p j p ] f the trangle s non-obtuse. If the trangle s obtuse, q j s chosen to be the mdpont of the edge opposte to the obtuse angle. Snce p = 2H(p)N(p) (see (Wllmore, 1993, p. 151)), we have ( p) p=p = 2H(p )N(p ) 1 A M (p ) j N 1 () cot α j + cot β j 2 (p j p ). (3.2) Ths gves an approxmaton of the mean curvature normal (see (Meyer et al., 2002)). The hgher order Laplace Beltram operators are dscretzed recursvely as k f(p ) = ( k 1 1 cot α j + cot β j [ f )(p ) = k 1 f(p j ) k 1 f(p ) ] (3.3) A M (p ) 2 j N 1 ()

8 132 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) Fg. 2. Left: The defnton of the angles α j and β j. Rght: The defnton of the area A M (p ). Fg. 3. Left: The nvolved vertces of the outer mesh for a G 0 boundary condton. The outer mesh s just the boundary of the hole. Mddle: The nvolved vertces of the outer mesh for a G 1 boundary condton. Rght: The nvolved vertces of the outer mesh for a G 2 boundary condton. wth 0 f(p ) = f(p ). Note that k f(p ) nvolves functon values on a k-rng of neghborng vertces of p Handlng of boundary condtons Natural boundary condtons for blendng and hole fllng By the natural boundary condtons, we mean that no contnuty condtons are specfed at the boundary ponts, but the contnuty s mpled by the outer mesh ncdent to the boundary of the hole (see Fg. 3). Such a treatment for boundary condton s sutable for both the blendng problem and the N-sded hole fllng problem, snce the outer mesh always exsts n such problems. Let g be the order of contnuty at a boundary pont p, g = max g. Then we can use the order 2g contnuty at the boundary vertex p. g H s dscretzed recursvely: g H = ( g 1 H). At a boundary vertex p, k H(p ) s evaluated accordng to the followng rule: flow p t = ( 1) g+1 g H(p)N(p) for constructng the trangular surface patch wth G g Evaluaton rule at boundary. k H(p ) s evaluated recursvely by formulas (3.6) and (3.7) f k g, otherwse k H(p ) s set to zero and the recurson stops.

9 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) Note that even for an nner vertex p j, the recursve defnton may make k H(p j ) nvolve the evaluaton of a lower order Laplace Beltram operator on the boundary. In general, the recursve evaluaton of k H(p ) at p (for p ether beng an nner or an outer vertex) nvolves (k + 1)-rng neghbor vertces of p. Some of them may be nner vertces, and the remanng are outer vertces. The nner vertces are treated as unknowns n the dscretzed equatons and the outers are ncorporated nto the rght-hand sde Natural boundary condtons for free-form surface fllng In the free-form surface fllng problem, we are gven a wreframe of curves (edges) and we wsh to flesh the wreframe wth surface patches that contan the curves as boundary wth pre-specfed order of contnuty. At each of the ntersecton ponts of the patches, an order of contnuty s pre-specfed and the evaluaton rule mentoned above s appled. For each nner pont, a dscretzed lnear equaton s generated usng the operator dscretzaton (3.7). These lnear equatons for dfferent patches are collected together and solved smultaneously. Note that one lnear equaton may nvolve nner vertces of several patches. However, f the contnuty order at each boundary pont s zero, any equaton correspondng to an nner vertex does not nvolve nner vertces of other patches. Remark 3.1. Schneder and Kobbelt (2001) use Moreton and Sequn s least square fttng of the second fundamental form relatve to a local parameterzaton to estmate the requred data on the boundary. These estmatons of the boundary dervatve data are based on ncomplete nformaton. Hence, the estmated data maybe not relable. Our approach s based on the dentty M p = 2H(p)N(p). Hence, we do not need to estmate boundary dervatve data, such as normals, tangents or curvatures. Furthermore, the boundary condtons are treated n the same way for equatons wth dfferent orders Spatal dscretzaton of quas geometrc flows Let us consder frst the dscretzaton of (2.9) n the spatal drecton for k = 1, 2, 3. Let P = [p 1,...,p m ] T R m 3, P =[ p 1,..., p m ] T R m 3,wherep 1,...,p m are all the unknown vertces to be determned n each of our modellng problems. Then (3.2) could be wrtten n matrx form: P = (DW)P + B (1), (3.4) 1 where D = dag[ 2A(p 1 ),..., 1 2A(p m ) ] s a dagonal matrx, W ={w j } m,j=1 wth k N 1 () cot α k + cot β k, = j, w j = (cot α j + cot β j ), j, N 1 (j), j N 1 (), 0, otherwse. Furthermore, W s a sparse, symmetrc and postve defnte matrx (see (Schneder and Kobbelt, 2001)). The constant term B (1) R m 3 s obtaned from the boundary condtons. It follows from (3.4) that 2 P = (DWDW)P + B (2), (3.5) where B (2) R m 3 s obtaned from the boundary condtons. Agan, WDW s a sparse, symmetrc and postve defnte matrx. In general, k P = ( 1) k (DW) k P + B (k), and the matrx for D 1 (DW) k s also sparse, symmetrc and postve defnte.

10 134 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) Spatal drecton dscretzaton of geometrc flows Let cot α k +cot β k k N 1 () 2A M (p, = j, ) ω j = cot α j +cot β j 2A M (p, j, N ) 1 (j), j N 1 (), 0, otherwse, and N()= N 1 () {}. Then we have N(p )H (p ) 1 ω j p j. 2 j N() The hgher order Laplace Beltram operators actng on H are dscretzed recursvely as k H(p ) = ( k 1 H )(p ) ω j k 1 H(p j ) (3.7) wth 0 H(p ) = H(p ) 1 2 j N() j N() (3.6) ω j N(p ) T p j. (3.8) Note that k H(p ) nvolves values of the mean curvature on a k-rng of neghborng vertces of p. Usng (3.6) (3.8) and the evaluaton rule at the boundary, we can wrte N(p ) k H(p ) as the followng form: N(p ) k H(p ) ( 1) k ω (k) j p j + B (k), ω (k) j R 3 3,B (k) R 3, j J 0 where J 0 s the ndex set of the (unknown) vertces to be determned, B (k) comes from boundary condton. To be more specfc, let J denote the ndex set of the mesh M, J k be the unon of J 0 and the ndex set of the boundary vertces where C k condton s specfed. Then N(p )H (p ) 1 ω j p j = 1 ω j p j + 1 ω j p j j N() j N() J 0 j N() {J \J 0 } = j J 0 ω (0) j p j + B (0), (3.9) where ω (0) j = 1 2 ω j I 3 for j N() J 0, ω (0) j = 0otherwse,B (0) = 1 2 j N() {J \J 0 } ω j p j. Smlarly, N(p ) H (p ) N(p ) ω j H(p j ) = N(p ) ω j H(p j ) j N() j N() J 1 = N(p ) ω j N(p j ) T N(p j )H (p j ) j N() J 1 [ ] ω j N(p )N(p j ) T m (0) jk p k + B (0) j j N() J 1 k J 0

11 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) = ω (1) j p j + B (1), (3.10) j J 0 N(p ) 2 H(p ) N(p ) ω j H (p j ) = N(p ) ω j H (p j ) j N() j N() J 2 N(p ) ω j ω jk H(p k ) j N() J 2 k N(j) J 1 [ ] ω j ω jk N(p )N(p k ) T m (0) kl p l + B (0) k k N(j) J 1 l J 0 j N() J 2 = j J 0 ω (2) j p j + B (2). (3.11) (3.9) (3.11) are used to dscretze the rght-handed sde of (2.8) for k = 0, 1, 2. The dscretzaton of N(p ) k H(p ) for k>2 s recursvely calculated usng (3.7) and boundary condtons Tme dscretzaton Gven an approxmate soluton {p (n) } m =1 of the order 2k PDE at t n for all the nner vertces, we construct an approxmate soluton {p (n+1) } m =1 for the next tme step t n+1 = t n + τ (n) by usng a sem-mplct Euler scheme. That s, we replace the dervatve p wth [p(t t n+1 ) p(t n )]/τ (n), and the quanttes w j n (3.4), ω j and N(p ) n (3.6) (3.8), h(t) n (2.5) are computed usng the prevous result at t n.normalsn(p ) are computed from Loop s subdvson surface (see (Bajaj and Xu, 2003) for detal). Such a treatment yelds a lnear system of equatons wth the nner vertces as unknowns. Let P (n+1) =[(p (n+1) 1 ) T,...,(p m (n+1) ) T ] T R 3m. The lnear system for the geometrc flows can be wrtten as the matrx form [ I + τ (n) W (k)] P (n+1) = B (k), W (k) = { ω (k) } j, B (k) R 3m. (3.12) The matrx W (k) R 3m 3m s hghly sparse, hence an teratve method for solvng such a lnear system s desrable. We use Saad s teratve method (Saad, 2000), named GMRES, to solve the system. The experment shows that ths teratve method works very well. Let P (n+1) =[p (n+1) 1,...,p m (n+1) ] T R m 3. The lnear system for the flows (2.9) can be wrtten as the matrx form [ I + τ (n) (DW) k+1] P (n+1) = B (k), or W (k) P (n+1) = D 1 B (k) (3.13) where B (k) R m 3, W (k) = D 1 + τ (n) W(DW) k R m m s a hghly sparse, symmetrc and postve defnte matrx, and hence we use a conjugate gradent teratve method wth dagonal precondtonng to solve the system. Note that for the same sze problem, the sze of coeffcent matrx n (3.12) s three tmes larger than that of coeffcent matrx n (3.13). Furthermore, the matrx W (k) n (3.13) s symmetrc and postve defnte. The matrx n (3.12) s not. We also note that the dscretzaton of (2.9) does not nvolve the computaton of the surface normals. Remark 3.2. It s well known that the condton of the lnear system arsng from the proposed semmplct dscretzaton behaves lke O(1 + τ (n) h 2k ),whereh s the mnmal edge length of the mesh.

12 136 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) Hence, f the mesh to be evolved s very rregular, the resultng system wll be ll-condtoned. In such a case, a small tme step sze s requred to make an teratve solver converge. Such a problem s releved by the mesh regularzaton treatment (see Secton 3.6). On the other hand, more advanced teratve method, such as mult-grd technques based on a herarchcal mesh representaton (see (Lang, 2001)) or algebrac mult-grd technques, could be used to accelerate the teraton process. In the current mplementaton, these technques are not ncorporated. Upper-bound of tme step. It s known that several surface evolutons (e.g., the mean curvature flow (see (Dzuk, 1991; Whte, 2002)) and the surface dffuson flow (see (Bansch et al., 2002))) may develop sngulartes. For our geometrc modellng problems, suppose we have a topologcally correct ntal surface mesh constructon and we look for solutons that have the same topology as the ntal mesh. Hence, we requre that our soluton s wthn the tme perod n that no sngularty occurs. Therefore, we shall determne the tme step τ (n) so that t n should not go beyond the tme moment when the sngularty occurs. Let L(p (n),m(t n )) be the spatal dscretzaton of V(p,t) at vertex p (n) over the mesh M(t n ). Then from the approxmate equalty p (n+1) τ (n) B n := 1 2 mn 1 m = τ (n) L(p (n) p (n),m(t n )) and the requrement p (n+1) p (n) 1 2 mn p (n) j j N 1 () we determne an upper-bound for τ (n) as follows { mnj N1 () p (n) j p (n) p (n) (3.14) L(p (n),m(t n )) Requrement (3.14) guarantees that no vertex-collson happens. When the sngularty s nearly to occur, the upper-bound B n wll approach to zero. Hence the evoluton cannot move beyond the sngular pont for tme. Remark 3.3. When the sngularty s nearly to occur, the upper-bound B n wll approach to zero. Ths wll be a very low effcency process. So a threshold value ɛ 0 should be put on the mnmal B n.ifthe determned B n s smaller than the threshold value, we termnate the evoluton process (see (3.17) (3.18)) Other mportant ssues Mesh regularzaton The surface moton by the geometrc PDEs descrbed n Secton 2 may cause a very rregular (nonunform) dstrbuton of the mesh vertces. Hence, ntroducng a regularzaton mechansm n the evoluton process s necessary. Snce the tangental dsplacement does not nfluence the geometry of the deformaton, just ts parameterzaton (see (Epsten and Gage, 1987)), we also add a tangental dsplacement to the moton. Hence, the general form of our geometrc evoluton problem could be wrtten as p t = V(p,t)+ V t(p)t (p), M(0) = M 0, (3.15) }.

13 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) where T(p)s a tangent drecton at the surface pont p, V t (p) s the tangental velocty. In the process of numercal soluton of Eq. (3.15), V t (p)t (p) s chosen as U 0 (p (n) ) ( U 0 (p (n) ), N(p (n) j N 1 () (p(n) ) ) N(p (n) ) (3.16) p (n) ), N s the surface normal computed from the lmt sur- where U 0 (p (n) 1 ) = card(n 1 ()) j face of Loop s subdvson. Ths dscretzaton of V t (p)t (p) s very smlar to the one gven by Ohtake et al. (2000), whch s U 0 (p (n) ) (U 0 (p (n) ), N(p (n) ))U 0 (p (n) ). The dfference s that our dsplacement s n the tangent plane. In (3.16), U 0 (p (n) ) could be replaced by U 0 (p (n+1) ) to use as many of the new values as possble, and stll yeld a lnear system. However, such a treatment destroys the symmetrc property of the coeffcent matrx. The tangental moton (3.16) s also used by Wood et al. (2000) and Ohtake et al. (2001) Stoppng crtera We need to determne the mnmal teraton number n, so that the evoluton procedure stops at t = t n. The followng two crtera are used M(tn ) M(0) ɛ1 or B n <ɛ 0 (3.17) M(t n+1 ) M(t n ) /τ (n) ɛ 2 or B n <ɛ 0 (3.18) where ɛ are gven control constants, B n s the determned upper-bound for τ (n). Crteron (3.17) s for short tme evoluton, where we requre M(nτ (n) ) near M(0). Crteron (3.18) s for long tme evoluton, where we are lookng for a stable status of the soluton. Condton B n <ɛ 0 s mposed for avodng dead-loop around the sngular pont of tme Constructon of ntal surface mesh To provde an ntal soluton to the geometrc evoluton problem, we need to construct an ntal trangular surface mesh ( fller ) for each openng usng any of a number of automatc or sem-automatc free-form surface constructon technques (Bajaj and Ihm, 1992; Bajaj et al., 1993; Davs et al., 2002; Grener, 1994; Peters and Wttman, 1996; Xu et al., 2001). One can also nteractvely edt ths fller to meet the weak assumptons for an ntal soluton shape. Snce the openng to be flled could be topologcally complcated, we solve the problem n two steps. In the frst step we ft each openng by an mplct algebrac surface or splne whch nterpolates or approxmates the boundary data (Bajaj et al., 1993; Bajaj and Xu, 1994; Peters and Wttman, 1996). The approach we used s the one developed by Bajaj et al. (1992, 1993, 1994). In ths approach, the data to be nterpolated or approxmated could be ponts or curves (even wth normals). For ours, the boundary data are always ponts. Of course, ths approach may not guarantee to produce topologcally correct surfaces. If ths happens, we break the openng nto several parts by nsertng a few curves (polygons) and then repeat the surface fttng for each part untl we acheve a reasonable shape for the fller. After the algebrac surface s obtaned, a trangulaton step s employed. Snce ths trangulaton should be consstent wth the boundary polygon of the openng, we adopted the expanson technque developed n (Bajaj and Xu, 1994). Usng ths approach, we trangulate the surfaces startng from the boundary of the openng. Remark 3.4. Comparng wth fnte element approach, the fnte dfference approach descrbed above s easy to mplement and t treats the equatons wth dfferent orders n a unform fashon. In the fnte

14 138 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) element approach, one has to make efforts to derve a varatonal form for each of the PDEs. For hgher order flows, hybrd method s used n general, such an approach wll ntroduce much more unknowns, and therefore the resulted lnear system s much larger. For example, n order to use fnte element method (lnear element) for the surface dffuson flow, Bänsch et al. (2002) splt the PDE nto a system of four equatons. 4. Comparatve examples In ths secton, we gve several examples to show how the PDEs are used to solve dfferent problems n a unform fashon. We also compare the effects of flows (2.8) and (2.9). All the fgures produced by the fourth and sxth flows are generated usng (2.9), except for the fgures of the second row of Fg. 4 and thrd row of Fg. 6. These fgures are produced usng the flow (2.8). When we compare the effects of (2.8) and (2.9), we use the same number of teratons but double tme step sze for (2.8) because the factor 2 n the relaton p = 2HN Comparson of the flows The frst three fgures of the frst row of Fg. 4 show the long tme evoluton solutons of the mean curvature flow, the fourth order flow, and the sxth order flow (2.9) for the nput sem-sphere wth an ntal constructon of the openng, a trangulated dsk. The mean curvature flow does not change the dsk. (b) and (c) are the results after 10 teratons wth τ (n) = 0.1 andτ (n) = 0.001, respectvely. Further teratons do not have a sgnfcant change on the shape of the soluton surface. The fourth and sxth order flows yeld convex surfaces and the smoothness s clearly observed. Also notce that the sxth order flow Fg. 4. The frst and second row show the results of (2.9) and (2.8), respectvely. (a) (same as (g)) The nput sem-sphere (left part) wth an ntal planar trangulaton of the dsk openng. The mean curvature flow does not change the dsk (ntal mesh). (b) The result of fourth order flow after 10 teraton wth τ (n) = 0.1. (c) The result of the sxth order flow after 10 teraton wth τ (n) = (d), (e) and (f) show three ntermedate results of the sxth order flow wth τ (n) = 0.001, and 1, 6 and 10 teratons, respectvely. (h) The result of the surface dffuson flow after 10 teraton wth τ (n) = 0.2. () The result of the sxth order flow (2.8) after 10 teraton wth τ (n) = (j), (k) and (l) show three ntermedate results of the sxth order flow (2.8) wth τ (n) = 0.002, and 1, 6 and 10 teratons, respectvely.

15 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) Fg. 5. Comparson of dfferent flows. k represents 2k order flow (2.9) s used. AM denote the averaged mean curvature flow. The tme step szes for the second, fourth and sxth order flows are chosen to be 0.1, , and , respectvely. (c), (e), (g) are the fared nterpolatng surface meshes after 6 teratons, where the contnutes at the boundary curves are set to 0, 2 and 0, respectvely. (d), (f), (h) are the mean curvature (MC) plots of (c), (e), (g), respectvely. recovers the sphere accurately. The last three fgures show three ntermedate results of the sxth order flow. The second and thrd fgures of the second row of Fg. 4 show the evoluton solutons of the surface dffuson flow and sxth order flows (2.8) for the nput sem-sphere wth an ntal constructon of the openng. (h) and () are produced usng the same number of teratons as (b) and (c), respectvely, and double tme step szes. Agan, the last three fgures show three ntermedate results of the sxth order flow. Comparng wth the fgures of the frst row, the geometrc flows change the surface shape n a much slower rate. Remark 4.1. We have ponted that the geometrc flows (2.8) have volume preservng propertes for a closed surface. However, for an open surface wth fxed boundary, the volume preservng propertes are not guaranteed. (h) and () show that the volume preservng property s not vald. Fg. 5 shows the combned use of dfferent flows. The am of ths toy example s to llustrate the dfference of these flows, especally the contnuty on the patch boundares. (a) shows four crcles to be nterpolated. Two of the crcles are n the xz-plane, the other two are n the yz-plane. (b) shows an ntal G 0 surface mesh constructed usng (Bajaj and Ihm, 1992) wth some addtonal nose added. (c), (e) and (g) are the fared nterpolatng surfaces after 6 teratons usng dfferent combnatons of the flows. The tme step szes for the second, fourth and sxth order flows are chosen to be 0.1, , and , respectvely. Snce the hgher order flows evolve faster than the lower order flows, we use smaller tme step szes for hgher order flows to obtan nearly the same surface evoluton speed. Each of the meshes

16 140 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) conssts of four surface patches. The left two patches are n the regons R + := {(x,y,z): x 0, y 0} and R := {(x,y,z): x 0, y 0}, respectvely, and generated by one type of flow. The rght two patches are n the regons R ++ := {(x,y,z): x 0, y 0} and R + := {(x,y,z): x 0, y 0}, respectvely, and generated by a dfferent flow. (d), (f) and (h) are the mean curvature plots of (c), (e) and (g), respectvely. The mean curvature at each vertex s computed by (3.2). The am of (c) s to show the dfference between the mean curvature flow and the averaged mean curvature flow, where the left part s generated by the averaged mean curvature flow and the rght part s produced by the mean curvature flow. The mean curvature flow shrnks the surface very fast whle the averaged mean curvature flow does not. Further evoluton usng the mean curvature flow wll yeld a pnch-off of the surface. Therefore, f we model a surface patch usng second order flows wth G 0 boundary condton, the averaged mean curvature flow s more desrable than the mean curvature flow. The patches n R + and R of (e) are produced by the sxth order flow (2.9) (wth k = 3), whle the patches n R ++ and R + are produced by the fourth order flow (2.9). As a whole, the surface looks smooth, our curvature plot reveals the smoothness dfference at the ntersecton curves, the sxth order flow gves a smoother result than the fourth order flow. (g) s produced as (e), but the contnuty order at the four crcles are set to zero. Hence G 0 contnuty s acheved there Surface blendng Gven a collecton surface mesh wth boundares, we construct a far surface to blend the meshes at the boundares wth specfed geometrc contnuty. Fg. 6 shows the case, where three cylnders to be blended are gven (a) wth an ntal G 0 constructon (b) usng (Bajaj and Ihm, 1992) wth some addtonal nose added. The blendng surfaces (c), (e) and (g) are the fared blendng meshes generated usng the flow (2.9) wth k = 1, 2, 3, respectvely. These fgures show the results after 32, 32 and 60 teratons wth tme step szes 0.01, 0.001, and , respectvely. (d), (f) and (h) show the mean curvature plots correspondngly. These fgures clearly show the dfference of smoothness acheved at blendng boundares. The mean curvature flow gves G 0 contnuty results. The fourth order flow produces smooth surfaces at boundares. The sxth order flow produces even smoother surfaces as expected. () and (k) are the fared blendng meshes generated usng the flow (2.8) wth k = 1, 2, respectvely. These fgures show the results after 32 and 60 teratons wth tme step szes and , respectvely. (j) and (l) show the mean curvature plots of () and (k), respectvely. It should be noted that the flows (2.9) generate lttle fatter surface than the flows (2.8) N-sded hole fllng Gven a surface mesh wth a hole, we construct a far surface to fll the hole wth specfed geometrc contnuty on the boundary. Fg. 1 shows such an example, where a head mesh wth a hole n the nose subregon s gven as nput (a). An ntal G 0 reconstructon of the nose s shown n (b) usng (Bajaj and Ihm, 1992) and then evolved wth the mean curvature flow. The blendng surfaces ((c) and (d)) are generated usng the flow (2.9) wth k = 2 and 3, respectvely. It should be observed that the sxth order flow yelds a better restoraton surface. The head mesh wth the hole n the nose subregon s avalable from

17 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) Fg. 6. (a) shows three cylnders to be blended. (b) shows the ntal constructon. (c), (e) and (g) are the fared blendng meshes generated usng the flow (2.9) wth k = 1, 2, 3, respectvely. These fgures show the results after 32, 32 and 60 teratons wth tme step szes 0.01, 0.001, and , respectvely. (d), (f) and (h) show the mean curvature plots correspondngly. () and (k) are the blendng meshes generated usng the flow (2.8) wth k = 1, 2, respectvely. These fgures show the results after 32 and 60 teratons wth tme step szes and , respectvely. (j) and (l) show the mean curvature plots of () and (k), respectvely Free-form surface constructon For the free-form surface fttng problem, we are gven some curves, or partal patches, or ponts as nput, and we wsh to construct a far surface mesh to nterpolate ths mult-dmensonal data. Fg. 7 shows the approach of free-form surface constructon, where some nput curves wth G 0 contnuty requrement are gven to preserve the sharp edges, and also gven are some surface bands wth a G 1 contnuty requrement (see (a)). (b) shows an ntal constructon of the G 0 surface mesh usng the patch fllng scheme (Xu et al., 2001) wth added nose. (c) s the fared surfaces, after 12 teratons, generated usng the flow (2.9) wth k = 2. The tme step sze s chosen to be (d), (e) and (f) are zoomed n vews of (a), (b) and (c), respectvely. Fg. 8 shows the free-form fttng approach from an nput trangular mesh, where (a) shows the nput surface trangular mesh wth a G 1 contnuty requrement at the vertces (see (a)). (b) shows an ntal

18 142 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) Fg. 7. Interpolatng curves and patches: (a) shows some nput curves wth G 0 contnuty requrement and some bands of mesh wth G 1 contnuty requrement. (b) shows an ntal constructon of the surface mesh. (c) s the fared surfaces, after 12 teratons, generated usng the flow (2.9) wth k = 2. The tme step sze s chosen to be (d), (e) and (f) are the zoom n results of (a), (b) and (c), respectvely. constructon of the surface mesh, where each nput trangle s approxmated wth 16 sub-trangles. The newly ntroduced vertces are treated as unknowns and the nput vertces are fxed n the farng process. (c) and (d) are the fared meshes, after 2 teratons wth τ (n) = 0.01, generated usng the mean curvature flow and the averaged mean curvature flow, respectvely. (e) s the fared mesh by fourth order flow, after 2 teratons wth τ (n) = (f) s the mean curvature plot of (e). The area shrnkng of the mean curvature flow makes the nput vertces to be nterpolated become thorns (see (c)), whle the area shrnkng and the volume preservaton of the averaged mean curvature flow make some of nput vertces become thorns and some others become pts (see (d)). However, the fourth order flow does not suffer from ths problem (see (e)). The obtaned surface nterpolates the nput ponts and exhbts G 1 smoothness everywhere as well. 5. Conclusons We have presented a general scheme for usng PDEs to solve several surface modellng problems and wth hgh order boundary contnuty condtons. Our scheme has the followng features: It produces very far and desrable soluton surfaces. It s smple and easy to mplement. Specfcally, t solves the free-form blendng problem, the N-sded hole fllng problem and free-form surface fttng problem n a unform fashon, and solves the hgh order boundary contnuty problem n an easy and natural way and avods pror estmaton of normals or dervatve jets on the boundares. The mplementaton results

19 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) Fg. 8. Interpolatng ponts: (a) shows some nput ponts and ther trangulaton. (b) shows an ntal constructon of the surface mesh. (c) and (d) are the fared surfaces, after 2 teratons wth τ (n) = 0.01, usng the mean curvature flow and the averaged mean curvature flow, respectvely. (e) s fared surfaces, after 2 teratons wth τ (n) = 0.001, usng the fourth order flow (2.9). (f) s the mean curvature plot of (e). show that our soluton works well for a wde range of surface models. Note that the C 1 or hgher order contnuty nterpolatory surface blendng soluton produced by, e.g., (Bajaj and Ihm, 1992; Peters and Wttman, 1996) for complcated corners, or holes wth many boundary curve segments, are usually of very hgh algebrac degree and thereby prone to be wth unsutable for certan applcatons. The current soluton of startng wth G 0 low degree blends, coupled wth hgher order flow evoluton, yelds n general a much better alternatve for very smooth surface solutons. Both the geometrc flows and quas geometrc flows yeld smooth surfaces at the boundares. However, quas geometrc flows (2.9) have some attractve features, ncludng ease of mplementaton, smaller and better behaved coeffcent matrces and no requrement of dervatves (normal) estmaton. Acknowledgement The authors are grateful to the referees for ther carefully readng of the manuscrpt and for ther helpful comments on mprovng the fnal verson of ths paper.

20 144 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) References Bajaj, C., Ihm, I., Algebrac surface desgn wth Hermte nterpolaton. ACM Trans. Graph. 19 (1), Bajaj, C., Xu, G., Ratonal splne approxmatons of real algebrac curves and surfaces. In: Dksht, H.P., Mchell, C. (Eds.), Approxmatons and Decomposton Seres. In: Advances n Computatonal Mathematcs. World Scentfc, Sngapore, pp Bajaj, C., Xu, G., Ansotropc dffuson of surface and functons on surfaces. ACM Trans. Graph. 22 (1), Bajaj, C., Ihm, I., Warren, J., Hgher order nterpolaton and least squares approxmaton usng mplct algebrac surfaces. ACM Trans. Graph. 12 (4), Bajaj, C., Wu, Q., Xu, G., Level-set based volumetrc ansotropc dffuson for 3D mage denosng. ICES Techncal Report 03-10, Unversty of Texas at Austn. Bansch, E., Morn, P., Nochetto, R.H., Fnte element methods for surface dffuson. In: Proc. of the Internatonal Conference on Free Boundary Problems, Theory and Applcatons, Trento, Italy. Bertalmo, M., Sapro, G., Cheng, L.T., Osher, S., A framework for solvng surface partal dfferental equatons for computer graphcs applcatons. CAM Report 00-43, UCLA, Mathematcs Department. Bloor, M.I.G., Wlson, M.J., Generatng blend surfaces usng partal dfferental equatons. Computer-Aded Desgn 21 (3), Bloor, M.I.G., Wlson, M.J., Usng partal dfferental equatons to generate free-form surfaces. Computer-Aded Desgn 22 (4), Breen, D., Whtaker, R., A level-set approach for the metamorphoss of sold models. IEEE Trans. Vs. Comput. Graph. 7 (2), do Carmo, M.P., Dfferental Geometry of Curves and Surfaces. Prentce-Hall, Englewood Clffs, NJ. Chopp, D.L., Sethan, J.A., Moton by ntrnsc Laplacan of curvature. Interfaces and Free Boundares 1, Clarenz, U., Dewald, U., Dzuk, G., Rumpf, M., Rusu, R., A fnte element method for surface restoraton wth boundary condtons. Computer Aded Geometrc Desgn 21 (5), Clarenz, U., Dewald, U., Rumpf, M., Ansotropc geometrc dffuson n surface processng. In: Proceedngs of Vz2000, IEEE Vsualzaton, Salt Lake Cty, Utah, pp Davs, J., Marschner, S.R., Garr, M., Levoy, M., Fllng holes n complex surfaces usng volumetrc dffuson. In: Proc. Frst Internatonal Symposum on 3D Data Processng, Vsualzaton, Transmsson. Deckelnck, K., Dzuk, G., A fully dscrete numercal scheme for weghted mean curvature flow. Numer. Math. 91, Desbrun, M., Meyer, M., Schröder, P., Barr, A.H., Implct farng of rregular meshes usng dffuson and curvature flow. In: SIGGRAPH99, Los Angeles, USA, pp do Carmo, M., Remannan Geometry. Boston. Dzuk, G., An algorthm for evolutonary surfaces. Numer. Math. 58, Epsten, C.L., Gage, M., The curve shortenng flow. In: Chorn, A., Majda, A. (Eds.), Wave Moton: Theory, Modelng, and Computaton. Sprnger-Verlag, New York. Escher, J., Smonett, G., The volume preservng mean curvature flow near spheres. Proc. Amer. Math. Soc. 126 (9), Escher, J., Mayer, U.F., Smonett, G., The surface dffuson flow for mmersed hypersurfaces. SIAM J. Math. Anal. 29 (6), Grener, G., Varatonal desgn and farng of splne surface. Computer Graphcs Forum 13, Guskov, I., Sweldens, W., Schröder, P., Mutresoluton sgnal processng for meshes. In: SIGGRAPH 99 Proceedngs, pp Huskens, G., The volume preservng mean curvature flow. J. Rene Angew. Math. 382, Kobbelt, L., Dscrete farng. In: Goodman, T., Martn, R. (Eds.), The Mathematcs of Surfaces VII. Informaton Geometers, pp Kobbelt, L., Campagna, S., Vorsatz, J., Sedel, H.-P., Interactve mut-resoluton modelng on arbtrary meshes. In: SIG- GRAPH98, pp Kobbelt, L., Botsch, M., Schwanecke, U., Sedel, H.P., Feature senstve surface extracton from volume data. In: SIG- GRAPH2001, pp

21 G. Xu et al. / Computer Aded Geometrc Desgn 23 (2006) Lang, J., Adaptve Multlevel Soluton of Nonlnear Parabolc PDE Systems: Theory, Algorthm, and Applcatons. Sprnger, Berln. Meyer, M., Desbrun, M., Schröder, P., Barr, A., Dscrete dfferental-geometry operator for trangulated 2-manfolds. In: Proceedngs of Vsual Mathematcs 02, Berln, Germany. Museth, K., Breen, D., Whtaker, R., Barr, A., Level set surface edtng operators. In: SIGGRAPH02, pp Ohtake, Y., Belyaev, A.G., Bogaevsk, I.A., Polyhedral surface smoothng wth smultaneous mesh regularzaton. In: Geometrc Modelng and Processng Proceedngs, pp Ohtake, Y., Belyaev, A.G., Bogaevsk, I.A., Mesh regularzaton and adaptve smoothng. Computer-Aded Desgn 33, Osher, S.J., Fedkw, R.P., Level set methods. CAM Report 00-07, UCLA, Mathematcs Department. Peters, J., Wttman, M., Smooth blendng of basc surfaces usng trvarate box splne. In: IMA 96, The Mathematcs of Surfaces. Dundee, UK. Preußer, T., Rumpf, M., An adaptve fnte element method for large scale mage processng. In: Scale-Space Theores n Computer Vson, pp Saad, Y., Iteratve Methods for Sparse Lnear Systems, second edton wth correctons. Sapro, G., Geometrc Partal Dfferental Equatons and Image Analyss. Cambrdge Unversty Press, Cambrdge. Schneder, R., Kobbelt, L., Generatng far meshes wth G 1 boundary condtons. In: Geometrc Modelng and Processng, Hong Kong, Chna, pp Schneder, R., Kobbelt, L., Geometrc farng of rregular meshes for free-form surface desgn. Computer Aded Geometrc Desgn 18 (4), Smonett, G., The Wllmore flow for near spheres. Dfferental and Integral Equatons 14 (8), Taubn, G., A sgnal processng approach to far surface desgn. In: SIGGRAPH 95 Proceedngs, pp Taubn, G., Sgnal processng on polygonal meshes. In: EUROGRAPHICS. Weckert, J., Ansotropc Dffuson n Image Processng. B.G. Teubner, Stuttgart. Westermann, R., Johnson, C., Ertl, T., A level-set method for flow vsualzaton. In: Proceedngs of Vz2000, IEEE Vsualzaton, Salt Lake Cty, Utah, pp Whtaker, R., Breen, D., Level set models for the deformaton of sold objects. In: Proceedngs of the 3rd Internatonal Workshop on Implct Surfaces, Eurographcs Assocaton, pp Whte, B., Evoluton of curves and surfaces by mean curvature. In: Proceedngs of the Internatonal Congress of Mathematcans, vol. I, Bejng, pp Wllmore, T.J., Remannan Geometry. Clarendon Press, Oxford. Wood, Z.J., Breen, D., Desbrun, M., Sem-regular mesh extracton from volumes. In: IEEE Vsualzaton Proceedngs of the conference on Vsualzaton 00, Salt Lake Cty, Utah, Unted States, pp Xu, G., 2004a. Convergence of dscrete Laplace Beltram operators over surfaces. Comput. Math. Appl. 48, Xu, G., 2004b. Dscrete Laplace Beltram operators and ther convergence. Computer Aded Geometrc Desgn 21, Xu, G., Bajaj, C., Huang, H., C 1 modelng wth A-patches from ratonal trvarate functons. Computer Aded Geometrc Desgn 18 (3), Yoshzawa, S., Belyaev, A.G., Far trangle mesh generaton wth dscrete elastca. In: Geometrc Modelng and Processng, Satama, Japan, pp Zhao, H.K., Osher, S., Merrman, B., Kang, M., Implct and non-parametrc shape reconstructon from unorganzed ponts usng varatonal level set method. Computer Vson and Image Understandng 80 (3),

Fair Triangle Mesh Generation with Discrete Elastica

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

More information

Adaptive Fairing of Surface Meshes by Geometric Diffusion

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

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

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

More information

G 2 Surface Modeling Using Minimal Mean-Curvature-Variation Flow

G 2 Surface Modeling Using Minimal Mean-Curvature-Variation Flow G 2 Surface Modelng Usng Mnmal Mean-Curvature-Varaton Flow Guolang Xu 1 Qn Zhang 2 1,2 LSEC, Insttute of Computatonal Mathematcs, Academy of Mathematcs and System Scences, Chnese Academy of Scences, Bejng

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Interpolation of the Irregular Curve Network of Ship Hull Form Using Subdivision Surfaces

Interpolation of the Irregular Curve Network of Ship Hull Form Using Subdivision Surfaces 7 Interpolaton of the Irregular Curve Network of Shp Hull Form Usng Subdvson Surfaces Kyu-Yeul Lee, Doo-Yeoun Cho and Tae-Wan Km Seoul Natonal Unversty, kylee@snu.ac.kr,whendus@snu.ac.kr,taewan}@snu.ac.kr

More information

Polyhedral Surface Smoothing with Simultaneous Mesh Regularization

Polyhedral Surface Smoothing with Simultaneous Mesh Regularization olyhedral Surface Smoothng wth Smultaneous Mesh Regularzaton Yutaka Ohtake The Unversty of Azu Azu-Wakamatsu Cty Fukushma 965-8580 Japan d800@u-azu.ac.jp Alexander G. Belyaev The Unversty of Azu Azu-Wakamatsu

More information

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

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

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Mesh Editing in ROI with Dual Laplacian

Mesh Editing in ROI with Dual Laplacian Mesh Edtng n ROI wth Dual Laplacan Luo Qong, Lu Bo, Ma Zhan-guo, Zhang Hong-bn College of Computer Scence, Beng Unversty of Technology, Chna lqngng@sohu.com, lubo@but.edu.cn,mzgsy@63.com,zhb@publc.bta.net.cn

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Feature-Preserving Mesh Denoising via Bilateral Normal Filtering

Feature-Preserving Mesh Denoising via Bilateral Normal Filtering Feature-Preservng Mesh Denosng va Blateral Normal Flterng Ka-Wah Lee, Wen-Png Wang Computer Graphcs Group Department of Computer Scence, The Unversty of Hong Kong kwlee@cs.hku.hk, wenpng@cs.hku.hk Abstract

More information

Vectorization of Image Outlines Using Rational Spline and Genetic Algorithm

Vectorization of Image Outlines Using Rational Spline and Genetic Algorithm 01 Internatonal Conference on Image, Vson and Computng (ICIVC 01) IPCSIT vol. 50 (01) (01) IACSIT Press, Sngapore DOI: 10.776/IPCSIT.01.V50.4 Vectorzaton of Image Outlnes Usng Ratonal Splne and Genetc

More information

Modeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach

Modeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach Modelng, Manpulatng, and Vsualzng Contnuous Volumetrc Data: A Novel Splne-based Approach Jng Hua Center for Vsual Computng, Department of Computer Scence SUNY at Stony Brook Talk Outlne Introducton and

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

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

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

More information

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme Mathematcal and Computatonal Applcatons Artcle A Fve-Pont Subdvson Scheme wth Two Parameters and a Four-Pont Shape-Preservng Scheme Jeqng Tan,2, Bo Wang, * and Jun Sh School of Mathematcs, Hefe Unversty

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

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

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

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

In the planar case, one possibility to create a high quality. curve that interpolates a given set of points is to use a clothoid spline,

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

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

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

More information

Radial Basis Functions

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

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

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

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

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Wavefront Reconstructor

Wavefront Reconstructor A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes

More information

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Accounting for the Use of Different Length Scale Factors in x, y and z Directions 1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,

More information

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

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

More information

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

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

More information

LECTURE : MANIFOLD LEARNING

LECTURE : MANIFOLD LEARNING LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors

More information

Parameterization of Quadrilateral Meshes

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

More information

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

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

More information

Related-Mode Attacks on CTR Encryption Mode

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

More information

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

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

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

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

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

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

Lecture 4: Principal components

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

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

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

More information

Reading. 14. Subdivision curves. Recommended:

Reading. 14. Subdivision curves. Recommended: eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.-6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton

More information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

Parallel matrix-vector multiplication

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

More information

Electrical analysis of light-weight, triangular weave reflector antennas

Electrical analysis of light-weight, triangular weave reflector antennas Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna

More information

F Geometric Mean Graphs

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

More information

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

High resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices

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

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume

More information

Multiblock method for database generation in finite element programs

Multiblock method for database generation in finite element programs Proc. of the 9th WSEAS Int. Conf. on Mathematcal Methods and Computatonal Technques n Electrcal Engneerng, Arcachon, October 13-15, 2007 53 Multblock method for database generaton n fnte element programs

More information

A Geometric Approach for Multi-Degree Spline

A Geometric Approach for Multi-Degree Spline L X, Huang ZJ, Lu Z. A geometrc approach for mult-degree splne. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 27(4): 84 850 July 202. DOI 0.007/s390-02-268-2 A Geometrc Approach for Mult-Degree Splne Xn L

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

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

More information

Barycentric Coordinates. From: Mean Value Coordinates for Closed Triangular Meshes by Ju et al.

Barycentric Coordinates. From: Mean Value Coordinates for Closed Triangular Meshes by Ju et al. Barycentrc Coordnates From: Mean Value Coordnates for Closed Trangular Meshes by Ju et al. Motvaton Data nterpolaton from the vertces of a boundary polygon to ts nteror Boundary value problems Shadng Space

More information

Support Vector Machines

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

More information

Load Balancing for Hex-Cell Interconnection Network

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

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

Simplification of 3D Meshes

Simplification of 3D Meshes Smplfcaton of 3D Meshes Addy Ngan /4/00 Outlne Motvaton Taxonomy of smplfcaton methods Hoppe et al, Mesh optmzaton Hoppe, Progressve meshes Smplfcaton of 3D Meshes 1 Motvaton Hgh detaled meshes becomng

More information

Smooth Approximation to Surface Meshes of Arbitrary Topology with Locally Blended Radial Basis Functions

Smooth Approximation to Surface Meshes of Arbitrary Topology with Locally Blended Radial Basis Functions 587 Smooth Approxmaton to Surface eshes of Arbtrary Topology wth Locally Blended Radal Bass Functons ngyong Pang 1,, Weyn a 1, Zhgeng Pan and Fuyan Zhang 1 Cty Unversty of Hong Kong, mewma@ctyu.edu.hk

More information

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On Some Entertaining Applications of the Concept of Set in Computer Science Course On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

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

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

More information

Solving two-person zero-sum game by Matlab

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

More information

AMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain

AMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain AMath 483/583 Lecture 21 May 13, 2011 Today: OpenMP and MPI versons of Jacob teraton Gauss-Sedel and SOR teratve methods Next week: More MPI Debuggng and totalvew GPU computng Read: Class notes and references

More information

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

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

More information

CHAPTER 2 DECOMPOSITION OF GRAPHS

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

More information

Harmonic Coordinates for Character Articulation PIXAR

Harmonic Coordinates for Character Articulation PIXAR Harmonc Coordnates for Character Artculaton PIXAR Pushkar Josh Mark Meyer Tony DeRose Bran Green Tom Sanock We have a complex source mesh nsde of a smpler cage mesh We want vertex deformatons appled to

More information

Discrete Schemes for Gaussian Curvature and Their Convergence

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

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

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

More information

Fuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches

Fuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of

More information

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

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

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton

More information

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

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

More information

The Shortest Path of Touring Lines given in the Plane

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

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge Detection in Noisy Images Using the Support Vector Machines Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona

More information

Review of approximation techniques

Review of approximation techniques CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated

More information

Smoothing Spline ANOVA for variable screening

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

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

Active Contours/Snakes

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

More information

Kinematics of pantograph masts

Kinematics of pantograph masts Abstract Spacecraft Mechansms Group, ISRO Satellte Centre, Arport Road, Bangalore 560 07, Emal:bpn@sac.ernet.n Flght Dynamcs Dvson, ISRO Satellte Centre, Arport Road, Bangalore 560 07 Emal:pandyan@sac.ernet.n

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

A new paradigm of fuzzy control point in space curve

A new paradigm of fuzzy control point in space curve MATEMATIKA, 2016, Volume 32, Number 2, 153 159 c Penerbt UTM Press All rghts reserved A new paradgm of fuzzy control pont n space curve 1 Abd Fatah Wahab, 2 Mohd Sallehuddn Husan and 3 Mohammad Izat Emr

More information

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

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

More information

An inverse problem solution for post-processing of PIV data

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

More information

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

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

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

arxiv: v3 [cs.na] 18 Mar 2015

arxiv: v3 [cs.na] 18 Mar 2015 A Fast Block Low-Rank Dense Solver wth Applcatons to Fnte-Element Matrces AmrHossen Amnfar a,1,, Svaram Ambkasaran b,, Erc Darve c,1 a 496 Lomta Mall, Room 14, Stanford, CA, 9435 b Warren Weaver Hall,

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

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

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

More information

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? Célne GALLET ENSICA 1 place Emle Bloun 31056 TOULOUSE CEDEX e-mal :cgallet@ensca.fr Jean Luc LACOME DYNALIS Immeuble AEROPOLE - Bat 1 5, Avenue Albert

More information

An Image Fusion Approach Based on Segmentation Region

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

More information

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

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

More information

Intra-Parametric Analysis of a Fuzzy MOLP

Intra-Parametric Analysis of a Fuzzy MOLP Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral

More information