Fluid Animation with Dynamic Meshes

Size: px
Start display at page:

Download "Fluid Animation with Dynamic Meshes"

Transcription

1 Computer Graphcs Proceedngs, Annual Conference Seres, 2006 Flud Anmaton wth Dynamc Meshes Bryan M. Klngner Bryan E. Feldman Nuttapong Chentanez James F. O Bren Unversty of Calforna, Berkeley Fgure 1: Top: A paddle mxes smoke n a tank. Bottom: A cross-secton of the smulaton meshes used for each frame. Abstract Ths paper presents a method for anmatng flud usng unstructured tetrahedral meshes that change at each tme step. We show that meshes that conform well to changng boundares and that focus computaton n the vsually mportant parts of the doman can be generated quckly and relably usng exstng technques. We also descrbe a new approach to two-way couplng of flud and rgd bodes that, whle general, benefts from remeshng. Overall, the method provdes a flexble envronment for creatng complex scenes nvolvng flud anmaton. Keywords: Natural phenomena, physcally based anmaton, computatonal flud dynamcs. CR Categores: I.3.5 [Computer Graphcs]: Computatonal Geometry and Object Modelng Physcally based modelng; I.3.7 [Computer Graphcs]: Three-Dmensonal Graphcs and Realsm Anmaton; I.6.8 [Smulaton and Modelng]: Types of Smulaton Anmaton. 1 Introducton Although systems for physcally based flud anmaton have developed rapdly n recent years and can now relably generate producton-qualty results, they stll have some lmtatons. Smulaton domans can change substantally from step to step because of deformng boundares, movng obstacles, and evolvng flud moton, yet current systems based on fxed grds are not deally suted to handle these stuatons. We propose a method to smulate fluds wth such rapdly changng domans by generatng a new tetrahedral smulaton mesh at each tme step. When generatng the mesh, we use the poston and shape of boundares as well as crtera based on the vsually mportant parts of the flud and velocty feld to construct a szng feld that dctates the desred edge length for tetrahedra throughout the doman. We then use an effcent and relable meshng algorthm adapted from [Allez et al., 2005] to produce a mesh that s refned accordng to ths feld. We use unstructured tetrahedral meshes because they conform to curved and rregular boundares better than axs-algned grds wth the same number of grd elements and allow for precse control of refnement throughout the doman. We transfer the physcal propertes of the smulaton from the old mesh to the new mesh usng a generalzaton of the sem-lagrangan velocty advecton technque that ntroduces no addtonal smoothng. We then perform a mass conservaton step that has been extended to allow a new, sngle-step soluton of two-way couplng between flud and rgd bodes. Overall, ths approach provdes a flexble framework for flud smulaton that opens the door to many features. We have mplemented the system and tested t n a varety of scenaros such as the one shown n Fgure 1. We have found that the combnaton of unstructured tetrahedral domans and dynamc remeshng creates a versatle envronment for the creaton of complex and vsually nterestng flud anmatons. 2 E-mal: {klngner feldman nchentan job}@eecs.berkeley.edu From the ACM SIGGRAPH 2006 conference proceedngs. Permsson to make dgtal or hard copes of all or part of ths work for personal or classroom use s granted wthout fee provded that copes are not made or dstrbuted for proft or commercal advantage and that copes bear ths notce and the full ctaton on the frst page. To copy otherwse, to republsh, to post on servers or to redstrbute to lsts, requres pror specfc permsson and/or a fee. ACM SIGGRAPH 2006, Boston, MA c Copyrght ACM Background The anmaton of fluds through physcal smulaton has become an mportant tool n the vsual effects ndustry. One approach that has been popular n recent years makes use of a spatal dscretzaton based on regular, fxed, hexahedral grds. Some examples of ths approach can be found n [Foster and Metaxas, 1996], [Foster and Metaxas, 1997], [Stam, 1999], [Yngve et al., 2000], [Fedkw et al., 2001], [Foster and Fedkw, 2001], [Enrght et al., 2002], [Carlson et al., 2002], [Feldman et al., 2003], and [Goktekn et al., 2004]. The most

2 Computer Graphcs Proceedngs, Annual Conference Seres, 2006 commonly used storage scheme for these approaches s the staggered grd scheme. Ths method offsets storage of dfferent quanttes on the grd, and was frst descrbed by [Harlow and Welch, 1965]. Efforts have been made to enhance these methods to allow for better conformance to rregular boundares such as the free surface of lquds, complex obstacles, or rregularly shaped domans. [Losasso et al., 2004] descrbed an octree-based method that retans many of the advantages of regular grds whle allowng computatonal effort to be focused n partcular parts of the smulaton doman; ths enables detaled trackng of movng boundares such as lqud surfaces. Both [Carlson et al., 2004] and [Guendelman et al., 2005] have demonstrated methods for two-way couplng of obstacles to flud. Unstructured tetrahedra have also been used for flud smulaton wthn the graphcs communty. Two examples of ths are [Feldman et al., 2005a] and [Elcott et al., 2005]. The frst method uses a velocty-based approach whle the second uses a vortcty-based formulaton. It s a blend of deas from these two papers, along wth a generalzaton of the sem-lagrangan velocty advecton technque for movng meshes descrbed n [Feldman et al., 2005b] that forms the heart of our method. The dea of movng meshes ndependent of a fxed or partcle-centrc coordnate system s not a new one; arbtrary Lagrangan-Euleran (ALE) methods were desgned for just ths purpose. They have proven useful n the smulaton of hghly deformable elastc materals. ALE was frst descrbed n [Hrt et al., 1974], where t was used wth fnte dfferences to solve compressble flud problems. [Donea et al., 1977] went on to apply ALE n a fnte element settng. An excellent survey of the development of ALE methods appears n [Donea et al., 2004]. Examples wthn the graphcs lterature that feature movng meshes wthout remeshng nclude [Shah et al., 2004] and [Rasmussen et al., 2004], both of whch translate the grd to follow the vsually mportant porton of the flud. Another approach to handlng changng domans s to dspense wth the mesh altogether, nstead usng Lagrangan partcles for smulaton of fluds. A few examples of ths approach are [Terzopoulos et al., 1989], [Desbrun and Can, 1996], [Can and Desbrun, 1997], [Stora et al., 1999], [Müller et al., 2003], [Premože et al., 2003], and [Müller et al., 2004]. These meshless methods are partcularly well suted to changng domans because ponts can move freely wthout concerns about mesh qualty. Because we regenerate a new smulaton mesh at each tme step, the vablty of our method hnges on fast, hgh-qualty, relable tetrahedral mesh generaton. Whle a hstory of unstructured mesh generaton s outsde the scope of ths paper, [Owen, 1998] and [Teng and Wong, 2000] provde good surveys of the feld. For our mesh generator we selected the approach descrbed n [Allez et al., 2005]. Ths nnovatve method produces meshes whch conform to domans of arbtrary topology quckly and relably. Also, t allows for the local edge length of the tetrahedra to be specfed arbtrarly throughout space, whch allows us to easly perform adaptve mesh refnement from step to step. The meshes produced by ths technque are Delaunay, whch provdes mproved gradent estmaton and allows us to sgnfcantly smplfy some of the expressons that arse when nterpolatng velocty values stored on the mesh. 3 Methods The key contrbuton of our method s to demonstrate the freedom granted by remeshng at each smulaton tme step. The core of our system s based on the smple, effcent methods for dscretzng the nvscd Euler equatons on tetrahedral meshes descrbed n [Elcott et al., 2005] and [Feldman et al., 2005a]. We have made a few modfcatons n order to combne the best aspects of both approaches that are descrbed below. Once we have a good dscretzaton, we need a way to propagate nformaton from one mesh to the next. [Feldman et al., 2005b] detals a generalzaton of the standard sem- Lagrangan velocty advecton technque that allows smulaton state to be transferred between deformng domans wthout ncurrng addtonal smoothng. We demonstrate that ther approach can easly be appled to transfer nformaton between two arbtrary, topologcally unrelated meshes, whch s requred to acheve more general evoluton of the smulaton doman from step to step. Fnally, we need to quckly and relably generate a new tetrahedral mesh for each tme step that suts the current smulaton condtons, such as conformance to boundares and obstacles as well as any desred refnement. Although methods have long exsted to mesh arbtrary domans, most are relatvely slow n comparson to smulaton runnng tmes or don t relably termnate under realstc condtons. The avalablty of effcent, versatle meshng algorthms such as [Allez et al., 2005] has made the generaton of a new mesh at each tme step practcal. Any changes that were requred to make these peces work together harmonously are dscussed below. Also, we descrbe a new, sngle-step method to acheve two-way couplng between obstacle and flud moton. 3.1 Dscretzaton We use a staggered flud state storage scheme that stores pressures at tetrahedron crcumcenters and face-normal veloctes, the component of velocty n the drecton of the face normal, at the face crcumcenters. Smlar schemes have been used n [Botta and Hempel, 1996], [Elcott et al., 2005] and [Feldman et al., 2005a]. These methods are a generalzaton of the staggered grd scheme orgnally proposed by [Harlow and Welch, 1965]. Ths staggered method s used to dscretze the nvscd Euler equatons: u t = (u ) u p ρ + f ρ subject to the mass conservaton constrant for ncompressble fluds: u = 0. (2) In these equatons, u s the flud velocty, t tme, p pressure, ρ densty, and f any external forces. The symbol denotes the vector of dfferental operators = [ / x, / y, / z] T. We account for the changes n the mesh over a tme step drectly durng sem-lagrangan advecton (see Secton 3.2) Dscrete Dervatve Operators Dvergence and gradent operators are needed as part of the mass conservaton step. We make dscrete estmates of these dervatves followng the formulaton presented n [Losasso et al., 2004] and [Elcott et al., 2005]. The dvergence of a tetrahedron s computed as an area weghted sum of the tetrahedron s face normal veloctes. The gradent at a face crcumcenter n the drecton of the face s normal s computed usng fnte dfferences. The dfference n crcumcenter pressures adjacent to a face s dvded by the dstance between these crcumcenters. In Delaunay meshes, the lne connectng adjacent tetrahedra crcumcenters passes through the crcumcenter of the face between them and s n the drecton of that face s normal. Ths property of Delaunay meshes motvates our storage scheme at crcumcenters because the gradent estmate s equvalent to the gradent of a pecewse lnear functon that nterpolates the crcumcenter values. (1) 821

3 ACM SIGGRAPH 2006, Boston, MA, July 30 August 3, Velocty Interpolaton The staggered scheme stores only the component of velocty n the face normal drecton. For both the sem-lagrangan step and to advect smoke partcles for renderng, a full velocty vector must be found at arbtrary postons n the mesh. We nterpolate velocty vectors from face normal veloctes usng the two-step method developed n [Elcott et al., 2005]. Frst, a velocty vector, u t, s computed at each tetrahedron crcumcenter, then we nterpolate wthn Vorono cells usng u t values at the cell vertces. Velocty u t for tetrahedron t s found by solvng the small lnear system N tu t = z t where N t s a matrx contanng 4 rows of the face normals of t and z t s a vector of the 4 face normal veloctes assocated wth t. For a dvergence-free feld, ths soluton has the remarkable property that nterpolatng back to the face crcumcenters exactly recovers the orgnal face-normal veloctes. Thus nterpolatng the u t veloctes also exactly nterpolates the face-normal velocty components, and does not ncur the error one would otherwse expect from a twostep nterpolaton method. To fnd a velocty at an arbtrary pont we nterpolate wthn the Vorono cell usng the tetrahedra veloctes assocated wth the cell. Ths nterpolaton s based on the method of [Warren et al., 2004], whch presents a way to nterpolate wthn a general convex polytope. They nterpolate the value at the pont x as a weghted sum of the polytope s node values where node t s unnormalzed weght s computed as w t(x) = N t f σ t n f x + d f. (3) Here, σ t s the set of polytope faces that ntersect at node t. The denomnator s the product of dstances from x to the faces n σ t computed usng the face normals,n f, and plane offsets, d f. N t s the determnant of a matrx of face normals n σ. Weghts from all nodes are normalzed to sum to 1 before use n the weghted sum. To smplfy ths computaton we take advantage of two propertes: 1) n a Delaunay mesh, edges are n the drecton of the Vorono cell s face normals and 2) the volume of tetrahedron t s 1/6 E t where E t s a matrx formed from the three vectors of edges emanatng from a common node of t. After some manpulaton, whch s omtted for brevty, Equaton (3) appled to node weghts wthn a Vorono cell can be smplfed to w t(x) = 6Vol(t) 3 =1 (p pv) (ct x) (4) where w t(x) s the weght assocated wth the node at tetrahedra t s crcumcenter, Vol(t) s the volume of tetrahedron t, p v s the poston of the node assocated wth the Vorono cell, p are postons of the other nodes of t, c t the crcumcenter of t, and x the nterpolaton poston. A smlar observaton appears n [Ju et al., 2005], and we fnd that wth t the velocty nterpolaton s qute effcent. All quanttes appearng n Equaton (4) are already stored for use n other parts of the tmestep, savng the need to compute the terms n Equaton (3). When advectng large numbers of partcles, veloctes at nodes of tetrahedra can be frst be found usng Equaton (4) and then quckly nterpolated n a lnear fason over the tetrahedra to advect the partcles. 3.2 Generalzed Sem-Lagrangan Step The smple and stable sem-lagrangan method has become the standard tool for advecton of the velocty feld for graphcal applcatons [Stam, 1999]. The basc dea of the method y y Current step x Prevous step x x (t) Fgure 2: A two-dmensonal representaton of the generalzed sem-lagrangan advecton step. We trace back from the poston where a velocty s stored n the new mesh, x = (x, y), nterpolate the velocty usng the old mesh and velocty feld, and update the velocty n the new mesh. s that we can fnd a velocty that wll advect to a pont by tracng back from that pont and nterpolatng the old velocty feld. Ths method does not rely on veloctes beng stored at any partcular place, as long as the velocty can be nterpolated throughout space. We can extend ths technque naturally to meshes whch change arbtrarly at each tme step as n [Feldman et al., 2005b]. Ths extenson does not ncur any addtonal smoothng compared to usng sem-lagrangan advecton wth statc meshes. Suppose at tme t veloctes are stored at locatons x (t) (n our case, the face crcumcenters), and we want to fnd the velocty at a partcular face locaton x (t). We trace back from x (t) through the velocty feld of the prevous tme step to a pont x, whch has no necessary correspondence to any feature of the old mesh. Then, we update the velocty at x (t) to the value nterpolated from the old velocty feld at x. Because the veloctes from the prevous step are stored on a dfferent mesh, we have to trace back and nterpolate usng ths prevous mesh (see Fgure 2). 3.3 Remeshng The doman boundares, obstacles, and smoke are free to move and change from step to step of the smulaton. By regeneratng the mesh at each tme step we can ensure that our doman conforms well to boundares and s refned n vsually mportant areas. We accomplsh ths by usng the varatonal tetrahedral meshng algorthm presented n [Allez et al., 2005]. Ths method allows for generaton of tetrahedral meshes that conform well to an arbtrary nput surface mesh, have no restrctons on topology (.e., allow nested vods), and allow for szng of tetrahedra throughout the doman based on arbtrary crtera. Our mplementaton dffers from the orgnal algorthm n a couple of detals. As n the orgnal method, refnement of the mesh s controlled by a szng functon µ(x) that, for any pont x n the smulaton doman, returns the desred local edge length of the tetrahedra. Whle the orgnal algorthm bulds ths szng functon by fndng the mnmum combnaton of local feature sze and dstance to a boundary pont x 822

4 Computer Graphcs Proceedngs, Annual Conference Seres, The flud velocty s dvergence free and the rgd body velocty s rgd. 3. The lnear and angular momentum of the combned system s conserved. Fgure 3: Left: a vsualzaton of the szng feld for a rectangular doman wth an rregular obstacle at the top and a plume of smoke at the bottom. Rght: the resultng smulaton mesh. Obstacle faces are colored green. from x, we nstead formulate t as follows: µ(x) = k 0 + mn (k d d(x), k s (1 s(x)), k ω (1 ω(x))) (5) In ths equaton, k 0 s an offset value that controls the mnmum value of the szng feld, and hence the mnmum local edge length of tetrahedra. d(x) s the dstance to the closest obstacle or boundary whch demands refnement, s(x) s a functon of the densty of smoke partcles, and ω(x) s a functon of the vortcty of the velocty feld. The parameters k d, k s, and k ω respectvely control the weght each of these functons has on the szng feld. These three factors are the same as those used for octree refnement n [Losasso et al., 2004]. The overall goal of the szng feld s to focus computatonal effort n the most vsually mportant parts of the scene, that s, near closed boundares, where the velocty feld vares most, and where smoke s vsble. Fgure 3 shows an example of a szng feld and the resultng mesh. Fgure 4 demonstrates the benefts of refnement near areas of hgh vortcty and smoke densty. Ths meshng method s teratve, so the mesh from the prevous smulaton tme step can be used as an ntal guess for the node placement n the mesh at the next smulaton tme step. Because there s, n general, strong temporal coherence between steps of the smulaton, the szng feld does not change too much and so the nodes from the prevous step are often a good ntalzaton. Before the algorthm proceeds, the ntal node placement s corrected to match the szng feld of the current step. One other modfcaton we made to the algorthm s that, when optmzng the node postons, we move nodes to the average of the barycenters of the surroundng tetrahedra nstead of the crcumcenters. We have found that whle ths tends to slghtly decrease the average qualty of tetrahedra n the mesh, t often leads to substantal mprovements n the qualty of the worst elements of the mesh, whch are of more concern for numercal smulaton. Of course, remeshng takes tme, so t s mportant to consder the mpact t has on overall smulaton performance. The tme spent generatng meshes for each smulaton step vares, but generally accounts for less than a quarter of the overall smulaton tme. In Secton 4 we show tmng nformaton for several examples. In [Carlson et al., 2004] these condtons are enforced sequentally. Whle for many cases ths produces results that look very good, under some stuatons artfacts can be created because enforcng one of the condtons n general wll break a prevously enforced one. Examples of such artfacts mght be flud leakng through sold boundares or poor performance n pston-lke stuatons. Our mplementaton dffers from [Carlson et al., 2004] n a couple of ways, but most sgnfcantly we enforce these condtons smultaneously wthn the mass conservaton step. In general, the mass conservaton step solves for pressures that accelerate the velocty feld to be dvergence free. In prevous works, ncludng those wth two-way couplng, the mass conservaton step treats faces to behave as flud or explctly prescrbes ther veloctes. For flud faces, the pressure accelerates the velocty proportonal to the gradent of the pressure whle for prescrbed faces, the pressure does not effect the flud. For a more complete dscusson of flud/prescrbed-velocty mass conservaton see [Fedkw et al., 2001]. We extend mass conservaton to nclude a dynamc, rgd body. To do so, we solve for acceleraton of the flud and the rgd body, gnorng pressure for both. We then solve for a pressure term that satsfes boundary and ncompressblty constrants to fnd the fnal acceleratons. The rgd body acceleratons can be computed by creatng a matrx R that s multpled by a vector of the pressures that surround a rgd body. R can be formed by a seres of matrx multplcatons: R = b 1.. b k [ M I 1 ] [ A1b T 1 A k b T k ] (6) where b = [ n T (r n ) T], n s the normal of the th face, r s the vector from the rgd objects center of mass to poston of the th face, and A s the area of that face. The rghtmost matrx fnds the net force-torque couple actng on a rgd body by summng up the contrbuton due to pressure forces actng on rgd body mesh faces. The force-torque couple s converted to a lnear and angular acceleraton of 3.4 Two-way Couplng and Mass Conservaton The moton of flud and rgd bodes that mutually effect each other can be complex and vsually appealng. The nteracton occurs as a consequence of the condtons that: 1. The veloctes n the normal drecton are the same at the nterface of the flud and the rgd body surface. Fgure 4: A comparson between unform and selectvely refned smulaton meshes. Left: a frame from a smulaton usng approxmately unformly szed tetrahedra. Rght: the same frame usng approxmately tetrahedra refned near areas of hgh vortcty and smoke densty. The refned mesh preserves the fne detal n the velocty feld and near the vsble smoke, enhancng vortex acton and natural movement. The runtmes of the two are equvalent. 823

5 ACM SIGGRAPH 2006, Boston, MA, July 30 August 3, 2006 Fgure 5: Red partcles are transfered from the left tank to the rght by squeezng and releasng the central bulb. The blue valves are coupled to the flud smulaton and prevent backflow. the body by the mddle (6 6) block matrx. M s a dagonal matrx wth the mass of the rgd body on the dagonals and I s the nerta matrx. The leftmost matrx n the multplcaton returns the acceleraton of the flud-rgd faces n the drecton of the face normal due to the lnear and angular acceleraton of the rgd body. By constructon, acceleratons generated by ths matrx behave rgdly. Computng pressure acceleratons of both the flud and flud-rgd faces can be expressed as a matrx A multpled by a vector of all the pressures. A row of A that corresponds to a face wth flud on both sdes contans the same entres as the standard gradent matrx multpled by 1/ρ. A row of A that belongs to a face at the flud-rgd nterface has element values obtaned from the correspondng row of R. The elements of ths row are placed at columns correspondng to the pressures that surround the rgd-body. Wth A bult, mass conservaton ncludng two way couplng proceeds much n the same way as n the all-flud case, wth A replacng the role of the dscrete gradent matrx. For a gven vector of pressures, p, the ntermedate velocty feld, z, s accelerated to the end-of-step velocty, z, by z = z + tap. For the flud faces, z s found by applyng all terms of Equaton (1) except the pressure term. For the flud-rgd faces, z s found usng a rgd body smulator wthout pressure forces appled. To fnd a partcular pressure that accelerates z such that z s dvergence free we solve the lnear system tdap = Dz. (7) Ths lnear system can be solved effcently usng PCG snce the the matrx DA, whch replaces the dscrete Laplacan from the all flud case, s also a postve-defnte symmetrc matrx. Usng the same machnery, we can also nteract wth constraned rgd bodes. Ths smply requres fndng an R matrx that correctly computes face acceleratons due to pressure. For example, one could easly alter R such that the body was constraned to just rotate about the orgn by replacng b n Equaton (6) wth b = [ (r n ) T] and usng only the I 1 block for the center matrx. Ths dea could be extended further to nclude even artculated bodes. 4 Results and Dscusson We mplemented the method descrbed above n matlab 1 and C, makng use of Pyramd [Jonathan Shewchuck, personal communcaton] for Delaunay trangulaton and pxe 2 for all renderngs. Typcal smulaton tmes for meshes wth 100,000 tetrahedra were about 1 mnute per frame. Table 1 compares remeshng and smulaton tmes for several of the examples presented n ths paper. The mages n Fgure 1 show smoke n a tank mxed by the scrpted moton of a paddle. Refnement of the smulaton mesh near the paddle ensures good conformance to ts curved surfaces that produce nterestng vortex effects n the smoke Remeshng tme Total tme Percent per frame (mean) per frame (mean) remeshng Fgure sec 64.8 sec 20.3% Fgure sec 44.5 sec 18.7% Fgure sec 35.8 sec 16.1% Fgure sec 796 sec 39.3% Table 1: A comparson of remeshng and smulaton tme for selected examples. In Fgure 5, a pump transfers partcles from the left tank to the rght tank as the bulb n the mddle s squeezed and released. The blue valves on ether sde of the bulb prevent backflow. The moton of these valves s not scrpted. Instead, they are modeled as rgd bodes constraned to rotate about an axs and ther moton s caused by two-way nteracton wth the flud. Fgure 6 demonstrates the two-way nteracton of the Stanford bunny wth smoke cannons. On the left s a lghter bunny whch s tossed about by the force of the cannons and also affects the moton of the smoke. On the rght s a heaver bunny that drops quckly to the ground. In Fgure 7, smoke moves through an array of obstacles n a hgher resoluton mesh of over 500,000 tetradra. Although qualty of the mesh elements does not suffer at ths level of refnement, the proporton of tme spent meshng ncreases to 39.3%. The moton of the smoke at the hgher resoluton s more lvely and exhbts more fne-scale detal. A vortcty enhancement method, such as those n [Fedkw et al., 2001] and [Selle et al., 2005] could be used to further enhance the flud moton but we do not fnd such enhancement necessary and so have not mplemented t. We have presented a system for performng flud anmaton usng unstructured tetrahedral domans that can change arbtrarly at each tme step. Although our current mplementaton models completely flud-flled domans, we beleve t would be well-suted for use wth surface trackng technques for lqud smulaton. Acknowledgments We thank the other members of the Berkeley Graphcs Group for ther helpful crtcsm and comments. Ths work was supported n part by Calforna MICRO and , and by generous support from Apple Computer, Pxar Anmaton Studos, Autodesk, Intel Corporaton, Sony Computer Entertanment Amerca, and the Alfred P. Sloan Foundaton. Klngner and Feldman were supported by NSF Graduate Fellowshps. References Allez, P., Cohen-Stener, D., Yvnec, M., and Desbrun, M Varatonal tetrahedral meshng. In the Proceedngs of ACM SIG- GRAPH 2005, Botta, N., and Hempel, D A fnte volume projecton method for the numercal soluton of the ncompressble naver-stokes equatons on trangular grds. Frst Internatonal Symposum on Fnte Volumes for Complex Applcatons, (July),

6 Computer Graphcs Proceedngs, Annual Conference Seres, 2006 Fgure 6: Cannons fre smoke at a lght (left) and heavy (rght) bunny. Goktekn, T. G., Bargtel, A. W., and O Bren, J. F A method for anmatng vscoelastc fluds. In the Proceedngs of ACM SIGGRAPH 2004, Guendelman, E., Selle, A., Losasso, F., and Fedkw, R Couplng water and smoke to thn deformable and rgd shells. In the Proceedngs of ACM SIGGRAPH 2005, Harlow, F., and Welch, J Numercal calculaton of tmedependent vscous ncompressble flow of flud wth a free surface. The Physcs of Fluds 8, Hrt, C., Amsden, A., and Cook, J An arbtrary lagranganeuleran computng method for all flow speeds. Journal of Computatonal Physcs 14, Fgure 7: A hgh-resoluton smulaton of a jet of smoke movng through a set of obstacles. Can, M.-P., and Desbrun, M Anmaton of deformable models usng mplct surfaces. IEEE Transactons on Vsualzaton and Computer Graphcs 3, 1 (Jan.), Carlson, M., Mucha, P. J., Van Horn III, R. B., and Turk, G Meltng and flowng. In the ACM SIGGRAPH 2002 Symposum on Computer Anmaton, Carlson, M., Mucha, P. J., and Turk, G Rgd flud: anmatng the nterplay between rgd bodes and flud. In the Proceedngs of ACM SIGGRAPH 2004, Desbrun, M., and Can, M.-P Smoothed partcles: A new paradgm for anmatng hghly deformable bodes. In Computer Anmaton and Smulaton 1996, Donea, J., Fasol-Stella, P., and Gulan, S Lagrangan and euleran fnte element technques for transent flud-structure nteracton problems. In Trans. 4th SMIRT Conf. Donea, J., Huerta, A., Ponthot, J.-P., and Rodrı guez-ferran, A The Encyclopeda of Computatonal Mechancs. John Wley & Sons Inc., New York. Elcott, S., Tong, Y., Kanso, E., Schro der, P., and Desbrun, M Dscrete, crculaton-preservng, and stable smplcal fluds. Preprnt, Caltech. Enrght, D. P., Marschner, S. R., and Fedkw, R. P Anmaton and renderng of complex water surfaces. In the Proceedngs of ACM SIGGRAPH 2002, Fedkw, R., Stam, J., and Jensen, H. W Vsual smulaton of smoke. In the Proceedngs of ACM SIGGRAPH 2001, Feldman, B. E., O Bren, J. F., and Arkan, O Anmatng suspended partcle explosons. In the Proceedngs of ACM SIGGRAPH 2003, Feldman, B. E., O Bren, J. F., and Klngner, B. M Anmatng gases wth hybrd meshes. In Proceedngs of ACM SIGGRAPH Feldman, B. E., O Bren, J. F., Klngner, B. M., and Goktekn, T. G Fluds n deformng meshes. In ACM SIGGRAPH/Eurographcs Symposum on Computer Anmaton Foster, N., and Fedkw, R Practcal anmaton of lquds. In the Proceedngs of ACM SIGGRAPH 2001, Foster, N., and Metaxas, D Realstc anmaton of lquds. In Graphcs Interface 1996, Foster, N., and Metaxas, D Modelng the moton of a hot, turbulent gas. In the Proceedngs of ACM SIGGRAPH 97, Ju, T., Schaefer, S., Warren, J., and Desbrun, M A geometrc constructon of coordnates for convex polyhedra usng polar duals. In Eurographcs Symposum on Geometry Processng 2005, Losasso, F., Gbou, F., and Fedkw, R Smulatng water and smoke wth an octree data structure. In the Proceedngs of ACM SIGGRAPH 2004, Mu ller, M., Charypar, D., and Gross, M Partcle-based flud smulaton for nteractve applcatons. In the ACM SIGGRAPH 2003 Symposum on Computer Anmaton, Mu ller, M., Keser, R., Nealen, A., Pauly, M., Gross, M., and Alexa, M Pont based anmaton of elastc, plastc and meltng objects. In the ACM SIGGRAPH 2004 Symposum on Computer Anmaton, Owen, S. J A survey of unstructured mesh generaton technology. In the 7th Internatonal Meshng Roundtable, Premoz e, S., Tasdzen, T., Bgler, J., Lefohn, A., and Whtaker, R Partcle-based smulaton of fluds. Computer Graphcs Forum 22, 3 (Sept.), Rasmussen, N., Enrght, D., Nguyen, D., Marno, S., Sumner, N., Geger, W., Hoon, S., and Fedkw, R Drectable photorealstc lquds. In the ACM SIGGRAPH 2004 Symposum on Computer Anmaton, Selle, A., Rasmussen, N., and Fedkw, R A vortex partcle method for smoke, water, and explosons. In the Proceedngs of ACM SIGGRAPH 2005, Shah, M., Cohen, J., Patel, S., Lee, P., and Pghn, F Extended gallean nvarance for adaptve flud smulaton. In 2004 ACM SIGGRAPH / Eurographcs Symposum on Computer Anmaton, Stam, J Stable fluds. In the Proceedngs of ACM SIGGRAPH 99, Stora, D., Aglat, P.-O., Can, M.-P., Neyret, F., and Gascuel, J.D Anmatng lava flows. In Graphcs Interface 99, Teng, S.-H., and Wong, C. W Unstructured mesh generaton: Theory, practce, and perspectves. Internatonal journal of computatonal geometry applcatons 10, 3, Terzopoulos, D., Platt, J., and Flescher, K Heatng and meltng deformable models (from goop to glop). In Graphcs Interface 1989, Warren, J., Schaefer, S., Hran, A. N., and Desbrun, M Barycentrc coordnates for convex sets. To appear n Advances n Computatonal and Appled Mathematcs. Yngve, G. D., O Bren, J. F., and Hodgns, J. K Anmatng explosons. In the Proceedngs of ACM SIGGRAPH 2000,

Applications of DEC:

Applications of DEC: Applcatons of DEC: Flud Mechancs and Meshng Dscrete Dfferental Geometry Overvew Puttng DEC to good use Fluds, fluds, fluds geometrc nterpretaton of classcal models dscrete geometrc nterpretaton new geometry-based

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

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

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

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

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

Simulation of a Ship with Partially Filled Tanks Rolling in Waves by Applying Moving Particle Semi-Implicit Method

Simulation of a Ship with Partially Filled Tanks Rolling in Waves by Applying Moving Particle Semi-Implicit Method Smulaton of a Shp wth Partally Flled Tanks Rollng n Waves by Applyng Movng Partcle Sem-Implct Method Jen-Shang Kouh Department of Engneerng Scence and Ocean Engneerng, Natonal Tawan Unversty, Tape, Tawan,

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

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

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

THE PULL-PUSH ALGORITHM REVISITED

THE PULL-PUSH ALGORITHM REVISITED THE PULL-PUSH ALGORITHM REVISITED Improvements, Computaton of Pont Denstes, and GPU Implementaton Martn Kraus Computer Graphcs & Vsualzaton Group, Technsche Unverstät München, Boltzmannstraße 3, 85748

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

User Authentication Based On Behavioral Mouse Dynamics Biometrics

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

Reproducing Works of Calder

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

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

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

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

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

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

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

2D Shape Deformation Based on Rigid Square Matching

2D 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 information

FluidSimulationusingLaplacianEigenfunctions

FluidSimulationusingLaplacianEigenfunctions Onlne Submsson ID: 0245 FludSmulatonusngLaplacanEgenfunctons a b 2 3 2 3 Fgure:a) Laplacan egenfunctons of a doman form a bass for dvergence free velocty felds. They are statonary solutons to the Naver-Stokes

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

Cluster Analysis of Electrical Behavior

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

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

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

More information

Topology Design using LS-TaSC Version 2 and LS-DYNA

Topology Design using LS-TaSC Version 2 and LS-DYNA Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool

More information

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

Feature Reduction and Selection

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

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

Dynamic wetting property investigation of AFM tips in micro/nanoscale

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

More information

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

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

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

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

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

Journal of Computational Physics

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

Interaction Methods for the SPH Parts (Multiphase Flows, Solid Bodies) in LS-DYNA

Interaction Methods for the SPH Parts (Multiphase Flows, Solid Bodies) in LS-DYNA 13 th Internatonal LS-DYNA Users Conference Sesson: Flud Structure Interacton Interacton Methods for the SPH Parts (Multphase Flows, Sold Bodes) n LS-DYNA Jngxao Xu, Jason Wang Lvermore Software Technology

More information

Computer models of motion: Iterative calculations

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

Simulation and Animation of Fire

Simulation and Animation of Fire Smulaton and Anmaton of Fre Overvew Presentaton n Semnar on Motvaton Methods for smulaton of fre Physcally-based Methods for 3D-Games and Medcal Applcatons Dens Stenemann partcle-based flud-based flame-based

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

Efficient Neighbor Search for Particle-based Fluids

Efficient Neighbor Search for Particle-based Fluids Journal of the Appled Mathematcs, Statstcs and Informatcs (JAMSI), 2 (27), No. 3 Effcent Neghbor Search for Partcle-based Fluds JURAJ ONDERIK Comenus Unversty Slovaka, Bratslava and ROMAN ĎURIKOVIČ The

More information

Hybrid particle grid fluid animation with enhanced details

Hybrid particle grid fluid animation with enhanced details Vs Comput (2013) 29:937 947 DOI 10.1007/s00371-013-0849-6 ORIGINAL ARTICLE Hybrd partcle grd flud anmaton wth enhanced detals Chang-bo Wang Qang Zhang Fan-long Kong Hong Qn Publshed onlne: 1 June 2013

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

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract 12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,

More information

Analysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress

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

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

Graphical Models. Reducing numerical dissipation in smoke simulation q. Zhanpeng Huang a,, Ladislav Kavan b, Weikai Li c, Pan Hui c, Guanghong Gong a

Graphical Models. Reducing numerical dissipation in smoke simulation q. Zhanpeng Huang a,, Ladislav Kavan b, Weikai Li c, Pan Hui c, Guanghong Gong a Graphcal Models 78 (2015) 10 25 Contents lsts avalable at ScenceDrect Graphcal Models journal homepage: www.elsever.com/locate/gmod Reducng numercal dsspaton n smoke smulaton q Zhanpeng Huang a,, Ladslav

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

Virtual Noctiluca: Interaction between Light and Water using Real-time Fluid Simulation and 3D Motion Measurement

Virtual Noctiluca: Interaction between Light and Water using Real-time Fluid Simulation and 3D Motion Measurement Vrtual Noctluca: Interacton between Lght and Water usng Real-tme Flud Smulaton and 3D Moton Measurement Kyouhe Ada and Norko Nagata Kwanse Gakun Unversty, School of Scence and Technology 2-1 Gakuen, Sanda,

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

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

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

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

VISCOELASTIC SIMULATION OF BI-LAYER COEXTRUSION IN A SQUARE DIE: AN ANALYSIS OF VISCOUS ENCAPSULATION

VISCOELASTIC SIMULATION OF BI-LAYER COEXTRUSION IN A SQUARE DIE: AN ANALYSIS OF VISCOUS ENCAPSULATION VISCOELASTIC SIMULATION OF BI-LAYER COEXTRUSION IN A SQUARE DIE: AN ANALYSIS OF VISCOUS ENCAPSULATION Mahesh Gupta Mchgan Technologcal Unversty Plastc Flow, LLC Houghton, MI 49931 Hancock, MI 49930 Abstract

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

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

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

PHYSICS-ENHANCED L-SYSTEMS

PHYSICS-ENHANCED L-SYSTEMS PHYSICS-ENHANCED L-SYSTEMS Hansrud Noser 1, Stephan Rudolph 2, Peter Stuck 1 1 Department of Informatcs Unversty of Zurch, Wnterthurerstr. 190 CH-8057 Zurch Swtzerland noser(stuck)@f.unzh.ch, http://www.f.unzh.ch/~noser(~stuck)

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

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

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

Towards Large Fluid Animation using Shallow Water and Navier-Stokes Simulation with SPH

Towards Large Fluid Animation using Shallow Water and Navier-Stokes Simulation with SPH Unverzta Komenského v Bratslave Fakulta matematky, fyzky a nformatky Mgr. Mchal Chládek Autoreferát dzertačnej práce Towards Large Flud Anmaton usng Shallow Water and Naver-Stokes Smulaton wth SPH na získane

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

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

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

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Global Illumination: Radiosity

Global Illumination: Radiosity Last Tme? Global Illumnaton: Radosty Planar Shadows Shadow Maps An early applcaton of radatve heat transfer n stables. Projectve Texture Shadows (Texture Mappng) Shadow Volumes (Stencl Buffer) Schedule

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Real-time Rendering of Enhanced Shallow Water Fluid Simulations

Real-time Rendering of Enhanced Shallow Water Fluid Simulations Real-tme Renderng of Enhanced Shallow Water Flud Smulatons Jesús Ojeda a, Antono Susín b a Dept. LSI, Unverstat Poltècnca de Catalunya b Dept. MA1, Unverstat Poltècnca de Catalunya Abstract The vsualzaton

More information

Complex Deformable Objects in Virtual Reality

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

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

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

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

Fitting: Deformable contours April 26 th, 2018

Fitting: 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 information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

Positive Semi-definite Programming Localization in Wireless Sensor Networks

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

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Scan Conversion & Shading

Scan Conversion & Shading Scan Converson & Shadng Thomas Funkhouser Prnceton Unversty C0S 426, Fall 1999 3D Renderng Ppelne (for drect llumnaton) 3D Prmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng

More 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

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

Scan Conversion & Shading

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

Discretization of Functionally Based Heterogeneous Objects

Discretization of Functionally Based Heterogeneous Objects Dscretzaton of Functonally Based Heterogeneous Objects Elena Kartasheva Insttute for Mathematcal Modelng Russan Academy of Scence Moscow, Russa ekart@mamod.ru Oleg Fryaznov Insttute for Mathematcal Modelng

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

UrbaWind, a Computational Fluid Dynamics tool to predict wind resource in urban area

UrbaWind, a Computational Fluid Dynamics tool to predict wind resource in urban area UrbaWnd, a Computatonal Flud Dynamcs tool to predct wnd resource n urban area Karm FAHSSIS a, Gullaume DUPONT a, Perre LEYRONNAS a a Meteodyn, Nantes, France Presentng Author: Karm.fahsss@meteodyn.com,

More information

SENSITIVITY 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. 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 information

From: AAAI-82 Proceedings. Copyright 1982, AAAI ( All rights reserved.

From: AAAI-82 Proceedings. Copyright 1982, AAAI (  All rights reserved. From: AAAI-82 Proceedngs. Copyrght 1982, AAAI (www.aaa.org). All rghts reserved. TRACKING KNOWN THREE-DIMENSIONAL OBJECTS* Donald B. Gennery Robotcs and Teleoperator Group Jet Propulson Laboratory Pasadena,

More information

Lecture #15 Lecture Notes

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

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

y and the total sum of

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

More information

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

A COMBINED AUTOMATED GENERALIZATION MODEL OF SPATIAL ACTIVE OBJECTS

A COMBINED AUTOMATED GENERALIZATION MODEL OF SPATIAL ACTIVE OBJECTS A COMBINED AUTOMATED GENERALIZATION MODEL OF SPATIAL ACTIVE OBJECTS J. Joubran Abu Daoud, Y. Doytsher Faculty of Cvl and Envronmental Engneerng Department of Transportaton and Geo-Informaton Engneerng

More information

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO

More information

SPH and ALE formulations for sloshing tank analysis

SPH and ALE formulations for sloshing tank analysis Int. Jnl. of Multphyscs Volume 9 Number 3 2015 209 SPH and ALE formulatons for sloshng tank analyss Jngxao Xu 1, Jason Wang 1 and Mhamed Soul*, 2 1 LSTC, Lvermore Software Technology Corp. Lvermore CA

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