Results 1 -
4 of
4
Physically Based Deformable Models in Computer Graphics
- EUROGRAPHICS 2005 STAR – STATE OF THE ART REPORT
, 2005
"... Physically based deformable models have been widely embraced by the Computer Graphics community. Many problems outlined in a previous survey by Gibson and Mirtich [GM97] have been addressed, thereby making these models interesting and useful for both offline and real-time applications, such as motio ..."
Abstract
-
Cited by 164 (3 self)
- Add to MetaCart
Physically based deformable models have been widely embraced by the Computer Graphics community. Many problems outlined in a previous survey by Gibson and Mirtich [GM97] have been addressed, thereby making these models interesting and useful for both offline and real-time applications, such as motion pictures and video games. In this paper, we present the most significant contributions of the past decade, which produce such impressive and perceivably realistic animations and simulations: finite element/difference/volume methods, mass-spring systems, meshfree methods, coupled particle systems and reduced deformable models based on modal analysis. For completeness, we also make a connection to the simulation of other continua, such as fluids, gases and melting objects. Since time integration is inherent to all simulated phenomena, the general notion of time discretization is treated separately, while specifics are left to the respective models. Finally, we discuss areas of application, such as elastoplastic deformation and fracture, cloth and hair animation, virtual surgery simulation, interactive entertainment and fluid/smoke animation, and also suggest areas for future research.
Hierarchical RLE level set: A compact and versatile deformable surface representation
, 2006
"... This article introduces the Hierarchical Run-Length Encoded (H-RLE) Level Set data structure. This novel data structure combines the best features of the DT-Grid (of Nielsen and Museth [2004]) and the RLE Sparse Level Set (of Houston et al. [2004]) to provide both optimal efficiency and extreme vers ..."
Abstract
-
Cited by 49 (9 self)
- Add to MetaCart
This article introduces the Hierarchical Run-Length Encoded (H-RLE) Level Set data structure. This novel data structure combines the best features of the DT-Grid (of Nielsen and Museth [2004]) and the RLE Sparse Level Set (of Houston et al. [2004]) to provide both optimal efficiency and extreme versatility. In brief, the H-RLE level set employs an RLE in a dimensionally recursive fashion. The RLE scheme allows the compact storage of sequential nonnarrowband regions while the dimensionally recursive encoding along each axis efficiently compacts nonnarrowband planes and volumes. Consequently, this new structure can store and process level sets with effective voxel resolutions exceeding 500030003000 (45 billion voxels) on commodity PCs with only 1 GB of memory. This article, besides introducing the H-RLE level set data structure and its efficient core algorithms, also describes numerous applications that have benefited from our use of this structure: our unified implicit object representation, efficient and robust mesh to level set conversion, rapid ray tracing, level set metamorphosis, collision detection, and fully sparse fluid simulation (including RLE vector and matrix representations.) Our comparisons of the popular octree level set and Peng level set structures to the H-RLE level set indicate that the latter is superior in both narrowband sequential access speed and overall memory usage
Large-scale Fluid Simulation using Velocity-Vorticity Domain Decomposition
"... through smoke (c) smoke flow around a sphere. We achieve up to three orders of magnitude of performance over standard grid-only techniques. Simulating fluids in large-scale scenes with appreciable quality using state-of-the-art methods can lead to high memory and compute requirements. Since memory r ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
through smoke (c) smoke flow around a sphere. We achieve up to three orders of magnitude of performance over standard grid-only techniques. Simulating fluids in large-scale scenes with appreciable quality using state-of-the-art methods can lead to high memory and compute requirements. Since memory requirements are proportional to the product of domain dimensions, simulation performance is limited by memory access, as solvers for elliptic problems are not computebound on modern systems. This is a significant concern for largescale scenes. To reduce the memory footprint and memory/compute ratio, vortex singularity bases can be used. Though they form a compact bases for incompressible vector fields, robust and efficient modeling of nonrigid obstacles and free-surfaces can be challenging with these methods. We propose a hybrid domain decomposition approach that couples Eulerian velocity-based simulations with vortex singularity simulations. Our formulation reduces memory footprint by using smaller Eulerian domains with compact vortex bases, thereby improving the memory/compute ratio, and simulation performance by more than 1000x for single phase flows as well as significant improvements for free-surface scenes. Coupling these two heterogeneous methods also affords flexibility in using the most appropriate method for modeling different scene features, as well as allowing robust interaction of vortex methods with free-surfaces and nonrigid obstacles.
Fluid Dynamic Simulation for Cutting in Virtual Environment
"... In this paper, we introduce a 3D fluid dynamics solver for real-time interactions in virtual environment. We approach the solution of differential equations based on the cubic interpolated propagation (CIP) technique on GPU. Since the CIP combine the solution for fluid equations and their interactio ..."
Abstract
- Add to MetaCart
In this paper, we introduce a 3D fluid dynamics solver for real-time interactions in virtual environment. We approach the solution of differential equations based on the cubic interpolated propagation (CIP) technique on GPU. Since the CIP combine the solution for fluid equations and their interactions with the environment together, the Navier-Stokes equation can be solved efficiently. Furthermore, to achieve high performance results without involving a supercomputer, we take advantage of the parallelism and programmability of the GPU. Simulation is performed on pixels that can be considered to be a grid of cells; therefore processing on multiple vertices and pixels can be done simultaneously in parallel. This strategy is effective enough to simulate fluid dynamic model for real-time virtual cutting in 3D computer graphic. Experimental results demonstrate that the skin cutting followed by blood flowing over the anatomical surface run smoothly in a real-time interaction and realistic visual effect is achieved.