Physically based morphing of point-sampled surfaces
|
|
- Jerome Thomas
- 6 years ago
- Views:
Transcription
1 COMPUTER ANIMATION AND VIRTUAL WORLDS Comp. Anm. Vrtual Worlds 005; 16: Publshed onlne n Wley InterScence ( DOI: /cav.100 Anmatng Geometrcal Models Physcally based morphng of pont-sampled surfaces By Yunfan Bao*, Xaohu Guo and Hong Qn Ths paper presents an nnovatve method for naturally and smoothly morphng pontsampled surfaces va dynamc meshless smulaton on pont-sampled surfaces. Whle most exstng lterature on shape morphng emphaszes the ssue of fndng a good correspondence map between two object representatons, ths research prmarly nvestgates the challengng problem of how to fnd a smooth, physcally-meanngful transton path between two homeomorphc pont-set surfaces. We analyze the deformaton of surface nvolved n the morphng process usng concepts n dfferental geometry and contnuum mechancs. The morphng paths can be determned by optmzng an energy functonal, whch characterzes the ntrnsc deformaton of the surface away from ts rest shape. As demonstrated n the examples, our method automatcally produces a seres of natural and physcally-plausble n-between shapes, whch greatly allevates the shrnkng, stretchng, and self-ntersecton problems that often occur when lnear nterpolaton s employed for the morphng of two objects. We envson that our new technque wll contnue to broaden the applcaton scope of pont-set surfaces and ther dynamc anmaton. Copyrght # 005 John Wley & Sons, Ltd. KEY WORDS: physcally based anmaton; dynamc shape modelng; morphng; meshless method; pont-based geometry Introducton Pont-based representaton for surfaces has ganed strength and become an attractve, powerful modelng, and renderng alternatve n computer graphcs n recent years. The rapd development of the 3D scannng devces has greatly facltated the acquston of the pont samples from real-world physcal objects. Snce pont-sampled geometry can be represented by a set of dscrete ponts, no explct connectvty nformaton needs to be mantaned. Ths leads to a more compact and flexble representaton of geometry n terms of data *Correspondence to: Yunfan Bao, Computer Scence Department, State Unversty of New York at Stony Brook, Stony Brook, NY, 11794, U.S.A. E-mal: ybao@cs.sunysb.edu; xguo@cs.sunysb.edu; qn@cs.sunysb.edu Contract/grant sponsor: NSF; contract/grant number: ACI Contract/grant sponsor: ITR; contract/grant number: IIS storage and transfer. Many researchers have devoted consderable amount of effort to the accurate representaton, effcent processng, and renderng of pontsampled geometry. However, rapd and accurate anmaton/smulaton of pont-sampled geometry s stll a challengng area that demands a great deal of research endeavor wthn pont-based graphcs. As a popular anmaton technque n dgtal entertanment, shape morphng (or blendng) has been a very actve research topc n computer graphcs. Gven a source object and a target object, morphng technques can be employed to create a seres of n-between shapes that transform the source object nto the target one. In ths paper, we systematcally develop a physcally based meshless method to morph two objects represented only by ponts. To our best knowledge, ths s a frst attempt to conduct a dynamc, physcallymeanngful shape morphng between two pontsampled surfaces. In contrast, most exstng morphng technques nowadays are based on the polygonal mesh representaton, owng to the popularty and long hstory Copyrght # 005 John Wley & Sons, Ltd.
2 Y. BAO, X. GUO AND H. QIN of mesh geometry (as the domnant shape representaton) n Graphcs. Despte the wdespread use of meshbased shape morphng technques, certan drawbacks persst. For example, the map overlay algorthm needed to generate any ntermedate mesh wth consstent connectvty from source and target surface meshes are notorously dffcult to mplement. Ths remeshng process can be crcumvented by usng pont sampled surfaces snce no connectvty nformaton s necessary durng shape morphng. Gven two shapes, there are nfnte possble morphng paths. Our method focuses on fndng an deal transformaton va physcs-based energy optmzaton. We approach the morphng path problem from the vewpont of both dfferental geometry and contnuum mechancs. Our method s completely mesh free and only the vcnty nformaton of the pont set s utlzed n the morphng procedure. In our framework, the pont-sampled geometry s modeled as a meshless thn shell surface. The energy functonal s defned usng the ntrnsc measurement of surface deformaton derved from dfferental geometry. The morphng path s then automatcally derved by mnmzng the energy functonal. One key beneft of our method s that t mnmzes unnecessary dstorton such as shrnkng, stretchng, and self-ntersecton of the surface as demonstrated n Fgure 1, whch often exsts n lnearnterpolaton-based methods. Furthermore, surface crack problem assocated wth pont-based morphng 1 can be avoded n our physcally based system. Therefore, the ntermedate shapes generated by our method are both physcally plausble and vsually natural as shown n Fgure. Fgure 1. The undesrable artfact caused by lnear blendng. (a) Intal shape. (b) 50 % morph. (c) Fnal shape. Fgure. Our method leads to a physcally-plausble ntermedate shape. (a) Intal shape. (b) 50% morph. (c) Fnal shape. Related Work Shape Morphng Shape morphng s an actve and nterestng research area n computer anmaton. A complete survey s beyond the scope of ths paper and we shall only brefly revew several lteratures that are most relevant to our work here. The readers are referred to References [,3] for more detals. The key to mesh-based morphng s to establsh a good mappng between the source object and the target object, whch s known as the correspondence problem. Defnng such a mappng s far from trval, snce t usually nvolves parameterzaton 4 of surfaces of arbtrary genus and the problem becomes much more challengng when the two surfaces have dfferent topology. After the parameterzaton step, a map overlay algorthm s used to generate the common connectvty. Whle the correspondence problem has been extensvely studed by researchers, the path problem s relatvely less-explored, hence demandng more research effort towards further mprovement. The goal of the path problem s to fnd an deal transton path between the source and target shapes. However, the fundamental queston of What consttutes an deal path? s rather subjectve. A nave choce for most morphng applcatons s lnear nterpolaton because of ts smplcty. However, a straghtforward applcaton of lnear nterpolaton can somehow lead to dspleasng vsual results as shown n Fgure 1, especally n cases that nvolve dramatc, near-rgd-body transformaton between the end shapes. To address ths knd of problems, Sederberg et al. 5 ntroduced a technque that mnmzes the deformaton of the boundares of D shapes. Alexa et al. 6 took the nteror of shapes nto account and decomposed an affne transformaton to mprove the morphng qualty. One smlar work to ours s that of Yan et al., 7 whch s based on nonlnear stran feld nterpolaton derved from physcs. Whle ther method can only morph two planar polygons, our novel Copyrght # 005 John Wley & Sons, Ltd. 510 Comp. Anm. Vrtual Worlds 005; 16:
3 MORPHING OF POINT-SAMPLED SURFACES method handles complcated 3D pont-sampled surfaces. Furthermore, we derve the formulaton for meshless, thn-shell dynamcs as lnear systems, whch s then solved to reconstruct the n-between shapes. PhyscallyBasedAnmatonandMeshless Methods Followng the poneerng work of Terzopoulos et al., 8 a large amount of research has been carred out n the feld of physcally based anmaton. For example, many mesh-based methods for physcal smulaton of deformable objects have been proposed n computer graphcs based on ether the boundary element method 9 or the fnte element method. 10 Cloth, whch can be modeled as a thn-plate, was recently studed. 11,1 Compared wth cloth, thn-shell objects are naturally curved and can not be modeled usng plate formulatons. 13 Grnspun et al. 14 proposed a smple dscrete shell model that can be derved geometrcally for trangle meshes. Most of the exstng physcal smulaton approaches are based on mesh structures. For pont-sampled surfaces, however, t would be extremely challengng to smulate the contnuum mechancs wthout the explct nformaton of mesh connectvty. In recent years, consderable research has been devoted to the effcent modelng and anmaton of pontsampled geometry. In Reference [15], the Pontshop 3D system was presented for nteractve shape and appearance edtng of 3D pont sampled geometry. Later, Pauly et al. 16 presented a free-form shape modelng framework for pont-sampled geometry usng the mplct surface defnton of the movng least squares (MLS) approxmaton. More recently, Guo et al. 17 developed a framework for local and global edtng of pont set surfaces based on level-set method. Mueller et al. 18 developed a method for anmatng elastc, plastc, and meltng pontbased volumetrc objects based on the MLS approxmaton of the gradent of the dsplacement feld. Xao et al. 1 proposed an approach for nteractve morphng of pont surfaces based on Floater s 19 meshless parameterzaton. Most recently, Pauly et al. 0 presented a new meshless anmaton framework for elastc and plastc materals that fracture. Guo and Qn 1 combned the meshless method wth the modal warpng technque to acheve real-tme deformaton. In ths paper, we wll demonstrate that the meshless method s a natural and ntutve soluton to performng physcal smulaton drectly on pont-sampled surfaces, hence leadng to the automatc, physcally-plausble shape morphng of pont-set geometry. Deformaton Analyss Deformaton of Surface The deformaton of surfaces and solds has been wellstuded n elastcty theory and contnuum mechancs. In ths paper, we defne the deformaton of a surface usng concepts n dfferental geometry []. A surface n R 3 can be defned parametrcally as a vector functon Xð 1 ; Þ, where 1 and are the parametrc coordnates of the surface. The quadratc form (n Ensten summaton conventon) ds ¼ g j d d j measures the length of an arc element on the surface, and s known as the frst fundamental form. The coeffcents g j are components of a covarant tensor whch s called the metrc tensor or fundamental tensor: g j ðxþ ¼X X j where X Intutvely, the frst fundamental form measures the stretchng and shearng of the underlyng surface. The frst fundamental form alone does not completely determne the shape of a surface, because the curvature can be altered wthout affectng the metrc. Hence the second fundamental form whch takes the form b j d d j needs to be ntroduced. The second fundamental form measures the curvature of a surface and the coeffcents b j are components of a tensor called the curvature tensor: b j ðxþ ¼X j n ¼ X n j where X j j, n and n s the unt normal vector. The second fundamental form, together wth the frst fundamental form, can entrely determne the shape of a surface and therefore s an ntrnsc measurement of the shape of the surface. Deformaton Energy Havng defned the metrc tensor and the curvature tensor, the elastc stran energy for a deformable surface s gven by 8 Z ¼ ðjjg n g 0 jj þ jjb n b 0 jj Þd where g 0, b 0 are the metrc tensor and curvature tensor assocated wth the rest shape of the surface; g n, b n are correspondng tensors assocated wth the deformed Copyrght # 005 John Wley & Sons, Ltd. 511 Comp. Anm. Vrtual Worlds 005; 16:
4 Y. BAO, X. GUO AND H. QIN shape of the surface and jj jj s the Frobenus norm. The frst term n the stran energy formulaton s the membrane energy, whch ressts stretchng and shearng, and the second term s the bendng energy, whch ressts bendng and twstng. The membrane and bendng energy dstrbuton of a deformng torus s shown n Fgure 7. The above formulaton of the deformaton energy s purely motvated by dfferental geometry and apples to any surface n R 3. For any pont-sampled surfaces, f we assume that one dmenson,.e., the thckness, of the surface body s sgnfcantly smaller than the other two dmensons, we can consder the pont-sampled surface as a thn shell. The generc confguraton of the shell can be descrbed as S ¼ x R 3 jx ¼ Xð 1 ; Þþ 3 X 3 ð 1 ; Þ; 1 ; and h 3 h where X 3 s a unt drector vector normal to the mddle surface of the shell both n the reference and deformed confguraton under the Krchhoff Love hypothess. In the Krchhoff Love thn shell framework, the deformaton of the surface body s fully characterzed by the deformaton of the mddle surface. The Green Lagrange stran tensor can therefore be derved from the frst and second fundamental forms of the mddle surface of the shell. The membrane and bendng stran tensors are related to the deformaton of the shell surface as follows j ¼ 1 X X j X 0 X 0 j j ¼ 1 X X 3j X 0 X 0 3j Here, we use the superscrpt 0 to denote the measurement n the orgnal (reference) confguraton. Assumng lnearzed knematcs, the dsplacement feld of the mddle surface s ntroduced as uð 1 ; Þ¼ Xð 1 ; Þ X 0 ð 1 ; Þ. Thus, the lnearzed membrane and bendng stran can be wrtten as j ¼ 1 j ¼ 1 X0 u j þ X 0 j u X0 X 3j þ X 0 j X 3 þ u X 0 3j þ u j X 0 3 ð1þ ðþ Introducng the Krchhoff Love hypothess explctly here, the deformed shell drector vector s constraned to concde wth the unt normal vector to the deformed mddle surface of the shell,.e., X 3 ¼ J 1 ðx 1 X Þ where J ¼jX 1 X j. Therefore, the dervatves of the drector vector n the reference confguraton are X 0 3 ¼ðJ0 Þ 1 X 0 1 X0 þ X0 1 X0 ð3þ The ncrement X 3 ¼ X 3 X 0 3 can also be derved straghtforwardly by only keepng lnear terms. X 3 ðj 0 Þ 1 u 1 X 0 þ X0 1 u Smlar to the dervaton of Equaton (3), we can wrte the dervatves of X 3 as follows X 3 ¼ðJ 0 Þ 1 u 1 X 0 þ X 1 X 0 þ X0 1 u þ X 0 1 u Fnally, the bendng stran can be expressed n terms of the dsplacement feld as h j ¼ u j X 0 3 þðj0 Þ 1 u 1 X 0 j X0 þ u X 0 1 X0 j ð4þ Note that the dervaton of the membrane stran s ndependent of the ntroducton of the Krchhoff Love hypothess. Gven two homeomorphc pont-set surfaces, we can measure the metrc tensor and curvature tensor pontwsely on the two surfaces. Through the use of nterpolaton, we can obtan the tensor feld for any ntermedate tme step t ½0; 1Š. The dfference between the nterpolated tensor feld and the tensor feld of the rest confguraton gves us the stran feld that characterzes the ntrnsc deformaton of the surface away from ts rest, ntal shape. We can then apply the lnear membrane (Equaton 1) and bendng stran (Equaton 4), whch are functons of the dsplacement to mnmze the followng energy W ¼ 1 Z jjðuþ t jj þ jjðuþ t jj d ð5þ where t and t are the membrane and bendng stran obtaned by nterpolaton at tme step t. In our examples, we use smple lnear nterpolaton for the membrane and bendng stran: t ¼ t ðg n g 0 Þ and t ¼ t ðb n b 0 Þ. More sophstcated nterpolaton scheme can be used for smoother vsual qualty. Copyrght # 005 John Wley & Sons, Ltd. 51 Comp. Anm. Vrtual Worlds 005; 16:
5 MORPHING OF POINT-SAMPLED SURFACES MeshlessTechnques Snce the nventon of the fnte element method (FEM) n the 1950s, FEM has become the most popular and wdely used method n engneerng, scentfc computng, and computer anmaton. In FEM, the ndvdual elements are connected together by a topologcal map, whch s usually called a mesh. The fnte element nterpolaton functons are then bult upon the mesh, whch ensures the compatblty of the nterpolaton. However, ths procedure s not always advantageous, because the numercal compatblty condton s not the same as the physcal compatblty condton of a contnuum. For nstance, n a Lagrangan type of computatons, one may experence mesh dstorton, whch can ether end the computaton altogether or result n drastc deteroraton of accuracy. Therefore, t would be computatonally effcacous to dscretze a contnuum by only a set of nodal ponts wthout mesh constrants. In ths paper, we utlze MLS approxmaton method whch s used n the Element Free Galerkn (EFG) method 3 to arrve at the numercal dscretzaton. MLS Approxmaton The local approxmaton u h of a feld functon uðxþ defned n a soluton doman of arbtrary dmenson,, can be expressed as the nner product of a vector of the polynomal bass, pðxþ, and a vector of the coeffcents, aðxþ u h ðxþ ¼p T ðxþaðxþ ¼ Xm j¼1 p j ðxþa j ðxþ ð6þ where m s the number of monomals n the polynomal bass. In our current work on two-manfold surfaces, a lnear bass, p T ¼ð1; x; yþ correspondng to m ¼ 3, s used. If the feld values at a set of nodes, x, ¼ 1;...; n, are known a pror, the coeffcent vector aðxþ can be determned by mnmzng a weghted, dscrete L error norm defned as: L ¼ Xn ¼1 wðx; x Þ½u h ðx Þ u Š ð7þ Fgure 3. The smaller red balls represent the smulaton nodes and the larger translucent whte hemspheres represent the support rad of two of the smulaton nodes. where wðx; x Þ s a weghtng functon defned over a compact support (also called the doman of nfluence of node ), u s the nodal value at x, and n the number of nodes whose doman of nfluence contans the evaluaton pont x. The statonary of L wth respect to aðxþ leads to the soluton of aðxþ. Substtuton of aðxþ nto Equaton (6) gves u h ðxþ ¼ Xn ¼1 ðxþu ð8þ wth ðxþ beng the MLS shape functon. More detals on the dervaton of the shape functons can be found n Reference [4]. Fgure 3 shows the smulaton nodes scattered over a thn plane and ther correspondng support regons. Meshless Dscretzaton It now sets the stage for us to address the dscretzaton ssue of the energy defned n Equaton (5) that we attempt to mnmze. To make the mathematcal formulaton concse and consstent, we arrange the elements n symmetrc tensors nto 3 1 vectors and, for membrane and bendng stran, respectvely ¼ 4 5; ¼ Usng ths notaton, the energy functonal to be mnmzed can be reformulated as Z W ¼ f½ðuþ t Š T ½ðuÞ t Š þ ½ðuÞ t Š T ½ðuÞ t Šgd Settng the dervatve wth respect to u to be 0, we @u ½ðuÞ ½ðuÞ t Š d ¼ 0 Copyrght # 005 John Wley & Sons, Ltd. 513 Comp. Anm. Vrtual Worlds 005; 16:
6 Y. BAO, X. GUO AND H. QIN Applyng Equaton (8), the dsplacement feld can be approxmated by the MLS shape functons I ð 1 ; Þ as u h ð 1 ; Þ¼ XN I¼1 I ð 1 ; Þu I ð9þ where u I are the nodal dsplacement vectors and N s the number of smulaton nodes. Substtutng Equaton (9) nto Equaton (1) and Equaton (4) gves the approxmated membrane and bendng stran n matrx form ð 1 ; Þ¼ XN I¼1 ð 1 ; Þ¼ XN I¼1 M I ð 1 ; Þu I B I ð 1 ; Þu I ð10þ ð11þ where M I and B I are the membrane and bendng stran matrces assocated wth smulaton node I. Fnally, ntroducng Equaton (10) nto Equaton (11) yelds the lnear equaton: Ku ¼ f ð1þ where K s the stffness matrx, and u s the nodal dsplacement vector, and f s the vrtual nodal force vector. The global stffness matrx K s a block matrx whch can be convenently assembled by fllng n lowlevel 3 3 stffness matrces defned as Z h K IJ ¼ ðm I Þ T M J þ ðb I Þ T B J d And the vrtual nodal force vector can be assembled smlarly Z h f I ¼ ðm I Þ T I þ ðb I Þ T I d The lnear system n Equaton (1) can be solved usng the b-conjugate gradent method. Local Parameterzaton In prevous dscusson, we have assumed that a common analyss doman exsts for both the source and target pont-set surfaces, however, ths may not be true n general. In fact, n order to obtan such a global analyss doman, global parameterzaton of the pontset surfaces s needed. In ths paper, we adopt local parameterzaton to bypass the expensve global parameterzaton step, and the physcal smulaton can be drectly performed on the pont-based surfaces usng the vcnty nformaton only. We proceed by defnng, for every surface pont p,a neghborhood of surface ponts N. The neghborhood can be obtaned by smply takng the K nearest neghborng ponts. In our mplementaton, we set K to be between 0 and 30. The local parameterzaton s defned on the local tangent space, whch can be computed usng prncple component analyss (PCA). The two egenvectors correspondng to the two largest egenvalues span the tangent space at pont p. The coordnate of any pont n the vcnty of p s then obtaned by projectng the pont onto ts local tangent space. In order to compute the stran matrces, partal dervatves of X up to the second order are needed. We compute the dervatves by mnmzng an MLS error functon. As an example, we consder the x-component of the poston n the neghborhood of a pont p.by Taylor expanson, we can approxmate the x-component of the surface poston on the local parameter doman to frst order as ~xðxðp ÞþXÞ xðxðp ÞÞþrxj p X where Xðp Þ s the local parameter value of pont p. Therefore, we can estmate the dervatve rxj p by mnmzng the followng weghted least square error: ~L ¼ X jn w j ½~xðXðp j ÞÞ xðxðp j ÞÞŠ Note that, these partal dervatves are only defned on the local parameter doman of p and therefore all coordnate values must be computed wth respect to the local tangent space of p. The second order partal dervatves of p can be obtaned smlarly after the frst order partal dervatves for all neghborng ponts of p have been computed. Incremental Update Due to the fact that lnear membrane and bendng strans are used to mnmze the energy functonal Equaton (5), large deformaton from the rest confguraton can lead to dstorton artfacts as shown n Fgure 4(a). We correct ths problem by ncrementally updatng the global stffness matrx K. Each updatng step only recomputes the partal dervatves and tensors of the surface wth respect to the fxed local parameter doman. Ths process of ncrementally updatng the stffness matrx can be consdered as usng small lnear Copyrght # 005 John Wley & Sons, Ltd. 514 Comp. Anm. Vrtual Worlds 005; 16:
7 MORPHING OF POINT-SAMPLED SURFACES Fgure 4. Physcally based morphng of a bendng bar: (a) wthout and (b) wth ncrementally updatng stffness matrx. steps to approxmate the nonlnear deformaton n ts lmt. The corrected shape s shown n Fgure 4(b). The updatng step sze can be adaptvely controlled by settng threshold of the resdual energy after mnmzng the energy functonal W. Once the resdual energy exceeds the threshold, the stffness matrx s dynamcally updated. Our experment shows that recomputng the stffness matrx 10 tmes wth unform step length yelds satsfactory results for most of our experments. Numercal Integraton Assemblng the stffness matrx K and the vrtual nodal force f nvolves numercal ntegraton over a global analyss doman. Ths ntegraton s typcally computed usng Gaussan quadrature. Snce our computaton s performed on local parameter doman, such ntegraton s nfeasble. Alternatvely, we approxmate the ntegraton as K IJ ¼ XNP f I ¼ XNP h w ðm I Þ T M J þ ðb I Þ T B J h w ðm I Þ T I þ ðb I Þ T I Fgure 5. Algorthmc overvew and flowchart. Model Surfels Nodes Frames Tme Bar Torus Iss Rabbt Moa Sphere Table 1. Model statstcs and computatonal cost (seconds/frame) where NP s the number of surface ponts and w s the surface area approxmaton assocated wth the surface pont p. Implementaton and Results We have mplemented our prototype pont-based morphng system on a Mcrosoft Wndows XP PC wth Xeon. GHz CPU, 1.0 GB RAM, and an nvda Quadro4 700 XGL GPU. The system s wrtten n VCþþ 6.0 and the renderer s bult upon OpenGL. The algorthmc flow of our system s descrbed n Fgure 5. The computaton tme for generatng the ntermedate morphng frames s documented n Table 1. Fgure 6. Dfferent number of smulaton nodes for the same pont-set surface. Copyrght # 005 John Wley & Sons, Ltd. 515 Comp. Anm. Vrtual Worlds 005; 16:
8 Y. BAO, X. GUO AND H. QIN Fgure 7. Temporal change of deformaton energy when morphng a standard torus to a squeezed one. Upper row: Stretchng energy. Lower row: Bendng energy. Fgure 8. Morphng frames of a bowng ss statue. Ideally, we would lke to ncorporate all the pont samples on the surface as smulaton nodes. However, ths becomes numercally prohbtve for densely sampled pont set n terms of both memory storage and computaton tme. For extremely dense pont sets, we acqure the smulaton nodes by smplfyng the source surface. In our mplementaton, we use the adaptve herarchcal clusterng method 5 to select a subset of the orgnal surface sample ponts as the smulaton nodes. The number of smulaton nodes ranges from 500 to 000 for the examples that we have demonstrated. Fgure 6 shows dfferent number of smulaton nodes for the same pont surface. Usng the smplfed pont set as smulaton nodes wll undoubtedly lose many deformaton detals snce the generated dsplacement feld s relatvely smooth based on MLS approxmaton. Ths problem can be tackled by usng the multresoluton modelng framework of Reference [6] to capture the deformaton detals. We can compute the offset dstance between the orgnal pont surface and the low-pass fltered surface based on smplfed smulaton nodes. For the source and target shape, we can compute ther offset dstance 0 and n, respectvely. The offset dstance assocated wth each frame can be smply calculated va lnear nterpolaton between 0 and n. See Fgures 7 11 for some morphng experments that we have conducted. One mportant characterstc of our system s that materal propertes can be assocated wth the surface by manpulatng the weghts assocated wth the two energy terms n Equaton (5). In our mplementaton, we adopt the weghts assocated wth sotropc materals ¼ Eh 1 v ; ¼ Eh 3 1ð1 v Þ Fgure 9. Morphng frames of a rabbt model twstng ts head. Copyrght # 005 John Wley & Sons, Ltd. 516 Comp. Anm. Vrtual Worlds 005; 16:
9 MORPHING OF POINT-SAMPLED SURFACES Fgure 10. Morphng frames of an nflatng moa model. Fgure 11. Morphng from sphere to moa. where E s Young s modulus and v s Posson s rato. In fact, the user can ether fne-tune the materal property by settng approprate values for the Young s modulus and the Posson s rato or manpulate the weghts drectly. Further extendng our system to accommodate ansotropc propertes can be easly acheved by makng both and spatally-varyng functons across the entre pont-set surface durng the morphng process. Concluson In ths paper, we have systematcally developed an automatc and novel method to apply the dynamc, meshless thn-shell smulaton prncple to the physcally-plausble morphng of pont-based models. Our nnovatve framework s nspred and derved from dfferental geometry and contnuum mechancs. The physcallyplausble, natural morphng s the drect result of physcs-based energy optmzaton, thus mnmzng user nterventon. Moreover, our method s based on local parameterzaton of the underlyng pont set surface, and therefore, s computatonally effcent. In essence, our method s equvalent to solvng a boundary-value PDE problem, where all the vrtual forces are derved from the change of the ntrnsc geometrc measurement of the surface. Our experments show that the proposed pont surface morphng technque can generate physcally-meanngful, convncng morphng sequences whle avodng most of the undesrable, mesh-based artfacts (such as trangle flp-over or pont surface cracks). Some mmedate future work to further extend our framework s functonaltes are as follows. Frst, we shall consder usng the mature technque for multresoluton analyss and herarchcal decomposton to handle extremely complcated, large-scale, pont-based objects. Second, we shall seek a practcal soluton to the problem of fndng best possble correspondence between two pont-set surfaces. ACKNOWLEDGEMENTS Ths research work was partally supported by the NSF grant ACI , the ITR grant IIS , and Alfred P. Sloan Fellowshp to Hong Qn. The Iss model and the rabbt model are courtesy of Cyberware, Inc. References 1. Xao C, Zheng W, Peng Q, Forrest AR. Robust morphng of pont-sampled geometry. Computer Anmaton and Vrtual Worlds 004; 15: Lazarus F, Verroust A. Three-dmensonal metamorphoss: a survey. The Vsual Computer 1998; 14: Alexa M. Recent advances n mesh morphng. Computer Graphc Forum 00; 1(): Floater MS, Hormann K. Surface parameterzaton: a tutoral and survey. Advances n Multresoluton for Geometrc Modellng 005; Sprnger: Copyrght # 005 John Wley & Sons, Ltd. 517 Comp. Anm. Vrtual Worlds 005; 16:
10 Y. BAO, X. GUO AND H. QIN 5. Sederberg TW, Gao P, Wang G, Mu H. -d shape blendng: an ntrnsc soluton to the vertex path problem. In SIG- GRAPH 1993, 1993, pp Alexa M, Cohen-Or D, Levn D. As-rgd-as-possble shape nterpolaton. In SIGGRAPH 000, 000, pp Yan H-B, Hu S-M, Martn R. Morphng based on stran feld nterpolaton. Computer Anmaton and Vrtual Worlds 004; 15: Terzopoulos D, Platt J, Barr A, Flescher K. Elastcally deformable models. In SIGGRAPH 1987, 1987, pp James DL, Pa DK. Artdefo: accurate real tme deformable objects. In SIGGRAPH 1999, 1999, pp Debunne G, Desbrun M, Can M-P, Barr AH. Dynamc real-tme deformatons usng space and tme adaptve samplng. In SIGGRAPH 001, 001, pp Baraff D, Wtkn A. Large steps n cloth smulaton. In SIG- GRAPH 1998, 1998, pp Brdson R, Fedkw R, Anderson J. Robust treatment of collsons, contact and frcton for cloth anmaton. In SIG- GRAPH 00, 00, pp Crak F, Ortz M, Schröder P. Subdvson surfaces: a new paradgm for thn-shell fnte element analyss. Internatonal Journal of Numercal Methods Engneerng 000; 47: Grnspun E, Hran AN, Desbrun M, Schröder P. Dscrete shells. In ACM SIGGRAPH/Eurographcs Symposum on Computer Anmaton San Dego, Calforna, Eurographcs Assocaton, Swtzerland, 003, pp Zwcker M, Pauly M, Knoll O, Gross M. Pontshop 3d: An nteractve system for pont-based surface edtng. In SIG- GRAPH 00, 00, pp Pauly M, Keser R, Kobbelt LP, Gross M. Shape modelng wth pont-sampled geometry. ACM Transactons on Graphcs 003; (3): Guo X, Hua J, Qn H. Scalar-functon-drven edtng on pont set surfaces. IEEE Computer Graphcs and Applcatons 004; 4(4): Muller M, Keser R, Nealen A, Pauly M, Gross M, Alexa M. Pont based anmaton of elastc, plastc and meltng objects. In ACM SIGGRAPH/Eurographcs Symposum on Computer Anmaton 004, pp Floater MS, Remers M. Meshless parameterzaton and surface reconstructon. Computer Aded Geometrc Desgn 001; 18(): Pauly M, Keser R, Adams B, Dutré P, Gross M, Gubas LJ. Meshless anmaton of fracturng solds. ACM Trans. Graph 005; 4(3): Guo X, Qn H. Real-tme meshless deformaton. Computer Anmaton and Vrtual Worlds 005; 16(3 4).. Kreyszg E. Dfferental Geometry. Dover Publcatons, Inc: New York, 1991; Belytschko T, Lu YY, Gu L. Element free galerkn methods. Internatonal Journal on Numercal Methods Engneerng 1994; 37: Guo X, Qn H. Pont-based dynamc deformaton and crack propagaton. Techncal Report, Stony Brook Unversty, October Pauly M, Gross M, Kobbelt LP. Effcent smplfcaton of pont-sampled surfaces. In IEEE Vsualzaton 0, 00, pp Pauly M, Gross M, Kobbelt LP. Multresoluton modelng of pont-sampled geometry. Techncal Report, ETH Zurch, 00. Authors bographes: Yunfan Bao s a Ph.D. student n the Computer Scence Department at SUNY Stony Brook. He receved a B.Sc. degree (003) n Computer Scence and Engneerng from Zhejang Unversty, Chna. Hs research nterests nclude shape modelng, physcs-based modelng, anmaton and human computer nteracton. For further nformaton, please vst Xaohu Guo s Ph.D. canddate n the Department of Computer Scence at SUNY Stony Brook. He has a B.S. n Computer Scence from the Unversty of Scence and Technology of Chna. Hs research nterests nclude geometrc and physcs-based modelng, computer anmaton and smulaton, nteractve 3D graphcs, scentfc vsualzaton, human-computer nteracton, and vrtual realty. For more nformaton, please vst Hong Qn s Assocate Professor (wth tenure) of Computer Scence at State Unversty of New York at Stony Brook. He receved hs Ph.D. (1995) degree n Computer Scence from the Unversty of Toronto. In 1997, Dr Qn was awarded NSF CAREER Award from the U.S. Natonal Scence Foundaton (NSF). In December 000, Dr Qn receved Honda Intaton Grant Award. In Aprl 001, Dr Qn was selected as an Alfred P. Sloan Research Fellow by the Sloan Foundaton. He was the conference Co-Char of Computer Graphcs Internatonal 005. At present, he s Assocate Edtor of IEEE Transactons on Vsualzaton and Computer Graphcs and The Vsual Computer (Internatonal Journal of Computer Graphcs). Hs research nterests nclude graphcs, geometrc and physcs-based modelng, CAD, anmaton, smulaton, and vrtual envronments. For further nformaton, please vst sunysb.edu/~qn. Copyrght # 005 John Wley & Sons, Ltd. 518 Comp. Anm. Vrtual Worlds 005; 16:
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 informationS.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 informationHigh-Boost Mesh Filtering for 3-D Shape Enhancement
Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,
More informationModule 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell
Module 6: FEM for Plates and Shells Lecture 6: Fnte Element Analyss of Shell 3 6.6. Introducton A shell s a curved surface, whch by vrtue of ther shape can wthstand both membrane and bendng forces. A shell
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationSolving 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 informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationThe 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 informationAn 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 informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationAccounting for the Use of Different Length Scale Factors in x, y and z Directions
1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,
More informationMesh 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 informationFitting: Deformable contours April 26 th, 2018
4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.
More informationFeature-Preserving Denoising of Point-Sampled Surfaces
Feature-Preservng Denosng of Pont-Sampled Surfaces Jfang L College of Computer Scence and Informaton Technology Zhejang Wanl Unversty Nngbo 315100 Chna Abstract: Based on samplng lkelhood and feature ntensty,
More information12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification
Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationParameterization 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 informationD shape manipulation via topology-aware rigid grid. Introduction. By Wenwu Yang and Jieqing Feng *
COMPUTER ANIMATION AND VIRTUAL WORLDS Comp. Anm. Vrtual Worlds 2009; 20: 175 184 Publshed onlne 1 June 2009 n Wley InterScence (www.nterscence.wley.com).285 2D shape manpulaton va topology-aware rgd grd
More informationSimplification 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 informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationVery 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 informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationChapter 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 informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationReview 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 informationNUMERICAL 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 informationAnalysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress
Analyss of 3D Cracks n an Arbtrary Geometry wth Weld Resdual Stress Greg Thorwald, Ph.D. Ted L. Anderson, Ph.D. Structural Relablty Technology, Boulder, CO Abstract Materals contanng flaws lke nclusons
More informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationFinite 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 informationReading. 14. Subdivision curves. Recommended:
eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.-6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton
More informationClassification / Regression Support Vector Machines
Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More informationComplex Deformable Objects in Virtual Reality
Complex Deformable Obects n Vrtual Realty Young-Mn Kang Department of Computer Scence Pusan Natonal Unversty ymkang@pearl.cs.pusan.ac.kr Hwan-Gue Cho Department of Computer Scence Pusan Natonal Unversty
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationInterpolation 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 informationLECTURE : 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 informationFair 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 informationContent 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 informationA 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 information3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method
NICOGRAPH Internatonal 2012, pp. 114-119 3D Vrtual Eyeglass Frames Modelng from Multple Camera Image Data Based on the GFFD Deformaton Method Norak Tamura, Somsangouane Sngthemphone and Katsuhro Ktama
More informationLecture #15 Lecture Notes
Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal
More informationCloth Simulation. Burak Ertekin i MSc Computer Animation and Visual Effects
Cloth Smulaton Burak Ertekn 7637445 MSc Computer Anmaton and Vsual Effects November 17, 2014 1 Abstract In ths paper, we explan how to make a Cloth Smulaton usng Mass Sprng Model. We explaned the nternal
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationThe Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole
Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng
More informationWavefront Reconstructor
A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes
More informationMeshless Elasticity Model and Contact Mechanics-based Verification Technique
Meshless Elastcty Model and Contact Mechancs-based Verfcaton Technque Rfat Aras 1, Yuzhong Shen 1, Mchel Audette 1, Stephane Bordas 2 1 Department of Modelng, Smulaton, and Vsualzaton Engneerng, Old Domnon
More informationMachine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)
Machne Learnng Support Vector Machnes (contans materal adapted from talks by Constantn F. Alfers & Ioanns Tsamardnos, and Martn Law) Bryan Pardo, Machne Learnng: EECS 349 Fall 2014 Support Vector Machnes
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationImage 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 informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More informationA Topology-aware Random Walk
A Topology-aware Random Walk Inkwan Yu, Rchard Newman Dept. of CISE, Unversty of Florda, Ganesvlle, Florda, USA Abstract When a graph can be decomposed nto clusters of well connected subgraphs, t s possble
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More information2D Shape Deformation Based on Rigid Square Matching
D Shape Deformaton Based on Rgd Square Matchng A. Author Author s Afflaton Author s E-Mal Author s Webste B. Author Author s Afflaton Author s E-Mal Author s Webste C. Author Author s Afflaton Author s
More informationA unified library of nonlinear solution schemes
A unfed lbrary of nonlnear soluton schemes Sofe E. Leon, Glauco H. Paulno, Anderson Perera, Ivan F. M. Menezes, Eduardo N. Lages 7/27/2011 Motvaton Nonlnear problems are prevalent n structural, flud, contnuum,
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationReproducing Works of Calder
Reproducng Works of Calder Dongkyoo Lee*, Hee-Jung Bae*, Chang Tae Km*, Dong-Chun Lee*, Dae-Hyun Jung*, Nam-Kyung Lee*, Kyoo-Ho Lee*, Nakhoon Baek**, J. Won Lee***, Kwan Woo Ryu* and James K. Hahn*** *
More informationDetermining 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 informationComputer 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 informationOverview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION
Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup
More informationRadial 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 informationJournal of Computational Physics
Journal of Computatonal Physcs 230 (2011) 2540 2561 Contents lsts avalable at ScenceDrect Journal of Computatonal Physcs journal homepage: www.elsever.com/locate/jcp A grd based partcle method for solvng
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationHelsinki 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 informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationA 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 informationIn the planar case, one possibility to create a high quality. curve that interpolates a given set of points is to use a clothoid spline,
Dscrete Farng of Curves and Surfaces Based on Lnear Curvature Dstrbuton R. Schneder and L. Kobbelt Abstract. In the planar case, one possblty to create a hgh qualty curve that nterpolates a gven set of
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationConcurrent Apriori Data Mining Algorithms
Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng
More informationTopology Design using LS-TaSC Version 2 and LS-DYNA
Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool
More informationInteractive Rendering of Translucent Objects
Interactve Renderng of Translucent Objects Hendrk Lensch Mchael Goesele Phlppe Bekaert Jan Kautz Marcus Magnor Jochen Lang Hans-Peter Sedel 2003 Presented By: Mark Rubelmann Outlne Motvaton Background
More informationK-means and Hierarchical Clustering
Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your
More informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationVectorization of Image Outlines Using Rational Spline and Genetic Algorithm
01 Internatonal Conference on Image, Vson and Computng (ICIVC 01) IPCSIT vol. 50 (01) (01) IACSIT Press, Sngapore DOI: 10.776/IPCSIT.01.V50.4 Vectorzaton of Image Outlnes Usng Ratonal Splne and Genetc
More informationFeature-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 informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationStructured Grid Generation Via Constraint on Displacement of Internal Nodes
Internatonal Journal of Basc & Appled Scences IJBAS-IJENS Vol: 11 No: 4 79 Structured Grd Generaton Va Constrant on Dsplacement of Internal Nodes Al Ashrafzadeh, Razeh Jalalabad Abstract Structured grd
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationMultiblock 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 informationA 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 informationSENSITIVITY ANALYSIS WITH UNSTRUCTURED FREE MESH GENERATORS IN 2-D AND 3-D SHAPE OPTIMIZATION.
SENSITIVITY ANALYSIS WITH UNSTRUCTURED FREE MESH GENERATORS IN 2-D AND 3-D SHAPE OPTIMIZATION. P. Duysnx, W.H. Zhang, C. Fleury. Aerospace Laboratory, LTAS, Unversty of Lège B-4000 LIEGE, BELGIUM. ABSTRACT.
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationHybrid Non-Blind Color Image Watermarking
Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,
More informationScan Conversion & Shading
1 3D Renderng Ppelne (for drect llumnaton) 2 Scan Converson & Shadng Adam Fnkelsten Prnceton Unversty C0S 426, Fall 2001 3DPrmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationComputer models of motion: Iterative calculations
Computer models o moton: Iteratve calculatons OBJECTIVES In ths actvty you wll learn how to: Create 3D box objects Update the poston o an object teratvely (repeatedly) to anmate ts moton Update the momentum
More informationF Geometric Mean Graphs
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.
More informationA Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme
Mathematcal and Computatonal Applcatons Artcle A Fve-Pont Subdvson Scheme wth Two Parameters and a Four-Pont Shape-Preservng Scheme Jeqng Tan,2, Bo Wang, * and Jun Sh School of Mathematcs, Hefe Unversty
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationCategories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms
3. Fndng Determnstc Soluton from Underdetermned Equaton: Large-Scale Performance Modelng by Least Angle Regresson Xn L ECE Department, Carnege Mellon Unversty Forbs Avenue, Pttsburgh, PA 3 xnl@ece.cmu.edu
More information