78 results
Search Results
Now showing 1 - 10 of 78
Item Towards Biomechanically and Visually Plausible Volumetric Cutting Simulation of Deformable Bodies(The Eurographics Association, 2019) Qian, Yinling; Huang, Wenbin; Si, Weixin; Liao, Xiangyun; Wang, Qiong; Heng, Pheng-Ann; Lee, Jehee and Theobalt, Christian and Wetzstein, GordonDue to the simplicity and high efficiency, composited finite element method(CFEM) based virtual cutting attracted much attention in the field of virtual surgery in recent years. Even great progress has been made in volumetric cutting of deformable bodies, there are still several open problems restricting its applications in practical surgical simulator. First among them is cutting fracture modelling. Recent methods would produce cutting surface immediately after an intersection between the cutting plane and the object. But in real cutting, biological tissue would first deform under the external force induced by scalpel and then fracture occurs when the stress exceeds a threshold. Secondly, it's computation-intensive to reconstruct cutting surface highly consistent with the scalpel trajectory, since reconstructed cutting surface in CFEM-based virtual cutting simulation is grid-dependent and the accuracy of cutting surface is proportional to the grid resolution. This paper propose a virtual cutting method based on CFEM which can effectively simulate cutting fracture in a biomechanically and visually plausible way and generate cutting surface which is consistent with the scalpel trajectory with a low resolution finite element grid. We model this realistic cutting as a deformation-fracture repeating process. In deformation stage, the object will deform along with the scalpel motion, while in the fracture stage cutting happens and a cutting surface will be generated from the scalpel trajectory. A delayed fracturing criteria is proposed to determine when and how the cutting fracture occurs and an influence domain adaptation method is employed to generate accurate cutting surface in both procedures of deformation and fracture. Experiments show that our method can realistically simulate volumetric cutting of deformable bodies and efficiently generate accurate cutting surface thus facilitating interactive applications.Item Modelling the Fluid-Boundary Interaction in SPH(The Eurographics Association, 2018) Perea, Juan J.; Cordero, Juan M.; GarcÃa-Fernández, Ignacio and Ureña, CarlosSmoothed Particle Hydrodynamics (SPH) is a numerical method based on mutually interacting meshfree particles, and has been widely applied to fluid simulation in Computer Graphics. Originally SPH does not define the behaviour of the particle system in the contour, so the different variants of SPH have been solving this deficiency with different techniques. Some of these techniques are based on fictitious forces, specular particles or semi-analytic fields. However, all these proposals present a drawback, that are may introduce additional inaccuracy as a divergent behaviour of the particle dynamics or an artificial separation between the fluid limits and the contour. To solve these limitations at this paper presents a new technique based on contour particles that are used during simulation to model the interaction with the fluid. The use of contour particles had already been used in other works to construct the contour like a particle layer. That solution presents problems especially when increasing the complexity of the contour shape. In addition, unlike other techniques, this paper presents an additional advantage, the possibility of obtaining all the dynamic magnitudes for improving efficiency and versatility.Item Position-Based Simulation of Elastic Models on the GPU with Energy Aware Gauss-Seidel Algorithm(The Eurographics Association and John Wiley & Sons Ltd., 2019) Cetinaslan, Ozan; Steinberger, Markus and Foley, TimIn this paper, we provide a smooth extension of the energy aware Gauss-Seidel iteration to the Position-Based Dynamics (PBD) method. This extension is inspired by the kinetic and potential energy changes equalization and uses the foundations of the recent extended version of PBD algorithm (XPBD). The proposed method is not meant to conserve the total energy of the system and modifies each position constraint based on the equality of the kinetic and potential energy changes within the Gauss-Seidel process of the XPBD algorithm. Our extension provides an implicit solution for relatively better stiffness during the simulation of elastic objects. We apply our solution directly within each Gauss-Seidel iteration and it is independent of both simulation step-size and integration methods. To demonstrate the benefits of our proposed extension with higher frame rates, we develop an efficient and practical mesh coloring algorithm for the XPBD method which provides parallel processing on a GPU. During the initialization phase, all mesh primitives are grouped according to their connectivity. Afterwards, all these groups are computed simultaneously on a GPU during the simulation phase. We demonstrate the benefits of our method with many spring potential and strain-based continuous material constraints. Our proposed algorithm is easy to implement and seamlessly fits into the existing position-based frameworks.Item Yocto/GL: A Data-Oriented Library For Physically-Based Graphics(The Eurographics Association, 2019) Pellacini, Fabio; Nazzaro, Giacomo; Carra, Edoardo; Agus, Marco and Corsini, Massimiliano and Pintus, RuggeroIn this paper we present Yocto/GL, a software library for computer graphics research and education. The library is written in C++ and targets execution on the CPU, with support for basic math, geometry and imaging utilities, path tracing and file IO. What distinguishes Yocto/GL from other similar projects is its minimalistic design and data-oriented programming style, which makes the library readable, extendible, and efficient. We developed Yocto/GL to meet our need, as a research group, of a simple and reliable codebase that lets us experiment with ease on research projects of various kind. After many iterations carried out over a few years, we settled on a design that we find effective for our purposes. In the hope of making our efforts valuable for the community, we share our experience in the development and make the library publicly available.Item Deep Fluids: A Generative Network for Parameterized Fluid Simulations(The Eurographics Association and John Wiley & Sons Ltd., 2019) Kim, Byungsoo; Azevedo, Vinicius C.; Thuerey, Nils; Kim, Theodore; Gross, Markus; Solenthaler, Barbara; Alliez, Pierre and Pellacini, FabioThis paper presents a novel generative model to synthesize fluid simulations from a set of reduced parameters. A convolutional neural network is trained on a collection of discrete, parameterizable fluid simulation velocity fields. Due to the capability of deep learning architectures to learn representative features of the data, our generative model is able to accurately approximate the training data set, while providing plausible interpolated in-betweens. The proposed generative model is optimized for fluids by a novel loss function that guarantees divergence-free velocity fields at all times. In addition, we demonstrate that we can handle complex parameterizations in reduced spaces, and advance simulations in time by integrating in the latent space with a second network. Our method models a wide variety of fluid behaviors, thus enabling applications such as fast construction of simulations, interpolation of fluids with different parameters, time re-sampling, latent space simulations, and compression of fluid simulation data. Reconstructed velocity fields are generated up to 700x faster than re-simulating the data with the underlying CPU solver, while achieving compression rates of up to 1300x.Item Elastic Flattening of Painted Pottery Surfaces(The Eurographics Association, 2018) Preiner, Reinhold; Karl, Stephan; Bayer, Paul; Schreck, Tobias; Sablatnig, Robert and Wimmer, MichaelGenerating flat images from paintings on curved surfaces is an important task in Archaeological analysis of ancient pottery. It allows comparing styles and painting techniques, e.g, for style and workshop attribution, and serves as basis for domain publications which typically use 2d images. To obtain such flat images from scanned textured 3d models of the pottery objects, current practice is to perform so-called rollouts using approximating shape primitives like cones or spheres, onto which the mesh surfaces are projected. While this process provides in intuitive deformation metaphor for the users, it naturally introduces unwanted distortions in the mapping of the surface, especially for vessels with high-curvature profiles. In this work, we perform an elastic flattening of these projected meshes, where stretch energy is minimized by simulating a physical relaxation process on a damped elastic spring model. We propose an intuitive contraction-directed physical setup which allows for an efficient relaxation while ensuring a controlled convergence. Our work has shown to produce images of significantly improved suitability for domain experts' tasks like interpretation, documentation and attribution of ancient pottery.Item Multi-Level-Memory Structures for Adaptive SPH Simulations(The Eurographics Association, 2019) Winchenbach, Rene; Kolb, Andreas; Schulz, Hans-Jörg and Teschner, Matthias and Wimmer, MichaelIn this paper we introduce a novel hash map-based sparse data structure for highly adaptive Smoothed Particle Hydrodynamics (SPH) simulations on GPUs. Our multi-level-memory structure is based on stacking multiple independent data structures, which can be created efficiently from the same particle data by utilizing self-similar particle orderings. Furthermore, we propose three neighbor list algorithms that improve performance, or significantly reduce memory requirements, when compared to Verlet-lists for the overall simulation. Overall, our proposed method significantly improves the performance of spatially adaptive methods, allows for the simulation of unbounded domains and reduces memory requirements without interfering with the simulation.Item Learning-Based Animation of Clothing for Virtual Try-On(The Eurographics Association and John Wiley & Sons Ltd., 2019) Santesteban, Igor; Otaduy, Miguel A.; Casas, Dan; Alliez, Pierre and Pellacini, FabioThis paper presents a learning-based clothing animation method for highly efficient virtual try-on simulation. Given a garment, we preprocess a rich database of physically-based dressed character simulations, for multiple body shapes and animations. Then, using this database, we train a learning-based model of cloth drape and wrinkles, as a function of body shape and dynamics. We propose a model that separates global garment fit, due to body shape, from local garment wrinkles, due to both pose dynamics and body shape. We use a recurrent neural network to regress garment wrinkles, and we achieve highly plausible nonlinear effects, in contrast to the blending artifacts suffered by previous methods. At runtime, dynamic virtual try-on animations are produced in just a few milliseconds for garments with thousands of triangles. We show qualitative and quantitative analysis of results.Item GPU Smoke Simulation on Compressed DCT Space(The Eurographics Association, 2019) Ishida, Daichi; Ando, Ryoichi; Morishima, Shigeo; Cignoni, Paolo and Miguel, EderThis paper presents a novel GPU-based algorithm for smoke animation. Our primary contribution is the use of Discrete Cosine Transform (DCT) compressed space for efficient simulation. We show that our method runs an order of magnitude faster than a CPU implementation while retaining visual details with a smaller memory usage. The key component of our method is an on-the-fly compression and expansion of velocity, pressure and density fields. Whenever these physical quantities are requested during a simulation, we perform data expansion and compression only where necessary in a loop. As a consequence, our simulation allows us to simulate a large domain without actually allocating full memory space for it. We show that albeit our method comes with some extra cost for DCT manipulations, such cost can be minimized with the aid of a devised shared memory usage.Item MLS Pressure Extrapolation for the Boundary Handling in Divergence-Free SPH(The Eurographics Association, 2018) Band, Stefan; Gissler, Christoph; Peer, Andreas; Teschner, Matthias; Andrews, Sheldon and Erleben, Kenny and Jaillet, Fabrice and Zachmann, GabrielWe propose a novel method to predict pressure values at boundary particles in incompressible divergence-free SPH simulations (DFSPH). Our approach employs Moving Least Squares (MLS) to predict the pressure at boundary particles. Therefore, MLS computes hyperplanes that approximate the pressure field at the interface between fluid and boundary particles. We compare this approach with two previous techniques. One previous technique mirrors the pressure from fluid to boundary particles. The other one extrapolates the pressure from fluid to boundary particles, but uses a gradient that is computed with Smoothed Particle Hydrodynamics (SPH). We motivate that gradient-based extrapolation is more accurate than mirroring. We further motivate that our proposed MLS gradient is less error prone than the SPH gradient at the boundary. In our experiments, we indicate artifacts in previous approaches. We show that these artifacts are significantly reduced with our approach resulting in simulation steps that can be twice as large compared to previous methods. We further present challenging and complex scenarios to illustrate the capabilities of the proposed boundary handling.