DSpace Repository

Search Results

Now showing 1 - 10 of 225

Real-time Inextensible Hair with Volume and Shape
(The Eurographics Association, 2015) Sánchez-Banderas, Rosa María; Barreiro, Héctor; García-Fernández, Ignacio; Pérez, Mariano; Mateu Sbert and Jorge Lopez-Moreno
Hair simulation is a common topic extensively studied in computer graphics. One of the many challenges in this field is simulating realistic hair in a real-time environment. In this paper, we propose a unified simulation scheme to consider three of the key features in hair simulation; inextensibility, shape preservation and hair-hair interaction. We use an extension to the Dynamic Follow the Leader (DFTL) method to include shape preservation. Our implementation is also coupled with a Lagrangian approach to address the hair-hair interaction dynamics. A GPU-friendly scheme is proposed that is able to exploit the massive parallelism these devices offer, being able to simulate thousands of strands in real-time. The method has been integrated in a game development platform with a shading model for rendering and several test applications have been developed using this implementation.
Patch-Collaborative Spectral Point-Cloud Denoising
(The Eurographics Association and Blackwell Publishing Ltd., 2013) Rosman, G.; Dubrovina, A.; Kimmel, R.; Holly Rushmeier and Oliver Deussen
We present a new framework for point cloud denoising by patch-collaborative spectral analysis. A collaborative generalization of each surface patch is defined, combining similar patches from the denoised surface. The Laplace–Beltrami operator of the collaborative patch is then used to selectively smooth the surface in a robust manner that can gracefully handle high levels of noise, yet preserves sharp surface features. The resulting denoising algorithm competes favourably with state‐of‐the‐art approaches, and extends patch‐based algorithms from the image processing domain to point clouds of arbitrary sampling. We demonstrate the accuracy and noise‐robustness of the proposed algorithm on standard benchmark models as well as range scans, and compare it to existing methods for point cloud denoising.We present a new framework for point cloud denoising by patch‐collaborative spectral analysis. A collaborative generalization of each surface patch is defined, combining similar patches from the denoised surface. The Laplace‐Beltrami operator of the collaborative patch is then used to selectively smooth the surface in a robust manner that can gracefully handle high levels of noise, yet preserves sharp surface features.
Managing Temporal Change of Cities with CityGML
(The Eurographics Association, 2014) Morel, Maxime; Gesquière, Gilles; Gonzalo Besuievsky and Vincent Tourre
An increasing number of cities are developing digital models. It becomes thus necessary to take into account changes over time. Interoperability and thus the use of standards is also recommended. In this paper, we propose a new method, based on CityGML to take into account changes in the objects which compose the city. This method is efficient for any kind of changes of the city objects (semantic, geometry, topology or appearance). We then propose an extension of our method in order to consider more frequent changes as it is the case with sensors data that can be linked with part of city objects.
Vega: Non-Linear FEM Deformable Object Simulator
(The Eurographics Association and Blackwell Publishing Ltd., 2013) Sin, F. S.; Schroeder, D.; Barbic, J.; Holly Rushmeier and Oliver Deussen
This practice and experience paper describes a robust C++ implementation of several non-linear solid three-dimensional deformable object strategies commonly employed in computer graphics, named the Vega finite element method (FEM) simulation library. Deformable models supported include co-rotational linear FEM elasticity, Saint-Venant Kirchhoff FEM model, mass-spring system and invertible FEM models: neo-Hookean, Saint-Venant Kirchhoff and Mooney-Rivlin. We provide several timestepping schemes, including implicit Newmark and backward Euler integrators, and explicit central differences. The implementation of material models is separated from integration, which makes it possible to employ our code not only for simulation, but also for deformable object control and shape modelling. We extensively compare the different material models and timestepping schemes. We provide practical experience and insight gained while using our code in several computer animation and simulation research projects.This practice and experience paper describes a robust C++ implementation of several nonlinear solid 3D deformable object strategies commonly employed in computer graphics, named the Vega FEM simulation library. Deformable models supported include co-rotational linear FEM elasticity, Saint-Venant Kirchhoff FEM model, mass-spring system, and invertible FEM models: neo-Hookean, Saint-Venant Kirchhoff, and Mooney-Rivlin. We provide several timestepping schemes, including implicit Newmark and backward Euler integrators, and explicit central differences. The implementation of material models is separated from integration, which makes it possible to employ our code not only for simulation, but also for deformable object control and shape modeling. We extensively compare the different material models and timestepping schemes. We provide practical experience and insight gained while using our code in several computer animation and simulation research projects.
Sketch-based Image-independent Editing of 3D Tumor Segmentations using Variational Interpolation
(The Eurographics Association, 2012) Heckel, Frank; Braunewell, Stefan; Soza, Grzegorz; Tietjen, Christian; Hahn, Horst K.; Timo Ropinski and Anders Ynnerman and Charl Botha and Jos Roerdink
In the past years sophisticated automatic segmentation algorithms for various medical image segmentation problems have been developed. However, there are always cases where automatic algorithms fail to provide an acceptable segmentation. In these cases the user needs efficient segmentation correction tools, a problem which has not received much attention in research. Cases to be manually corrected are often particularly difficult and the image does often not provide enough information for segmentation, so we present an image-independent method for intuitive sketch-based editing of 3D tumor segmentations. It is based on an object reconstruction using variational interpolation and can be used in any 3D modality, such as CT or MRI. We also discuss sketch-based editing in 2D as well as a hole-correction approach for variational interpolation. Our manual correction algorithm has been evaluated on 89 segmentations of tumors in CT by 2 technical experts with 6+ years of experience in tumor segmentation and assessment. The experts rated the quality of our correction tool as acceptable or better in 92.1% of the cases. They needed a median number of 4 correction steps with one step taking 0.4s on average.
Sparse Iterative Closest Point
(The Eurographics Association and Blackwell Publishing Ltd., 2013) Bouaziz, Sofien; Tagliasacchi, Andrea; Pauly, Mark; Yaron Lipman and Hao Zhang
Rigid registration of two geometric data sets is essential in many applications, including robot navigation, surface reconstruction, and shape matching. Most commonly, variants of the Iterative Closest Point (ICP) algorithm are employed for this task. These methods alternate between closest point computations to establish correspondences between two data sets, and solving for the optimal transformation that brings these correspondences into alignment. A major difficulty for this approach is the sensitivity to outliers and missing data often observed in 3D scans. Most practical implementations of the ICP algorithm address this issue with a number of heuristics to prune or reweight correspondences. However, these heuristics can be unreliable and difficult to tune, which often requires substantial manual assistance. We propose a new formulation of the ICP algorithm that avoids these difficulties by formulating the registration optimization using sparsity inducing norms. Our new algorithm retains the simple structure of the ICP algorithm, while achieving superior registration results when dealing with outliers and incomplete data. The complete source code of our implementation is provided at http://lgg.epfl.ch/sparseicp.
Non-rigid 3D Shape Retrieval via Sparse Representation
(The Eurographics Association, 2013) Wan, Lili; Li, Shuai; Miao, Zhenjiang J.; Cen, Yigang G.; Bruno Levy and Xin Tong and KangKang Yin
Shape descriptor design is an important but challenging problem for non-rigid 3D shape retrieval. Recently, bagof- words based methods are widely used to integrate a model's local shape descriptors into a global histogram. In this paper, we present a new method to pool the local shape descriptors into a global shape descriptor by means of sparse representation. Firstly, we employ heat kernel signature (HKS) to depict the multi-scale local shape. Then, for each model in the training dataset, we take the HKSs corresponding to its mesh vertices to serve as training signals, and thus an over-complete dictionary can be learned from them. Finally, the HKSs of each 3D model are sparsely coded based on the learned dictionary, and such sparse representations can be further integrated to form an object-level shape descriptor. Moreover, we conduct extensive experiments on the state-of-the-art benchmarks, wherein comprehensive evaluations state our method can achieve better performance than other bag-of-words based approaches.
Linear-Time Smoke Animation with Vortex Sheet Meshes
(The Eurographics Association, 2012) Brochu, Tyson; Keeler, Todd; Bridson, Robert; Jehee Lee and Paul Kry
We present the first quality physics-based smoke animation method which runs in time approximately linear in the size of the rendered two-dimensional visual detail. Our fundamental representation is a closed triangle mesh surface dividing space between clear air and a uniformly smoky region, on which we compute vortex sheet dynamics to accurately solve inviscid buoyant flow. We handle arbitrary moving no-stick solid boundaries and by default handle an infinite domain. The simulation itself runs in time linear to the number of triangles thanks to the use of a well-conditioned integral equation treatment together with a Fast Multipole Method for linear-time summations, providing excellent performance. Basic zero-albedo smoke rendering, with embedded solids, is easy to implement for interactive rates, and the mesh output can also serve as an extremely compact and detailed input to more sophisticated volume rendering.
Smoke Sheets for Graph-Structured Vortex Filaments
(The Eurographics Association, 2012) Barnat, Alfred; Pollard, Nancy S.; Jehee Lee and Paul Kry
Smoke is one of the core phenomena which fluid simulation techniques in computer graphics have attempted to capture. It is both well understood mathematically and important in lending realism to computer generated effects. In an attempt to overcome the diffusion inherent to Eulerian grid-based simulators, a technique has recently been developed which represents velocity using a sparse set of vortex filaments. This has the advantage of providing an easily understandable and controllable model for fluid velocity, but is computationally expensive because each filament affects the fluid velocity over an unbounded region of the simulation space. We present an alternative to existing techniques which merge adjacent filament rings, instead allowing filaments to form arbitrary structures, and we develop a new set of reconnection criteria to take advantage of this filament graph. To complement this technique, we also introduce a method for smoke surface tracking and rendering designed to minimize the number of sample points without introducing excessive diffusion or blurring. Though this representation lends itself to straightforward real-time rendering, we also present a method which renders the thin sheets and curls of smoke as diffuse volumes using any GPU capable of supporting geometry shaders.
A Data-Driven Approach to Realistic Shape Morphing
(The Eurographics Association and Blackwell Publishing Ltd., 2013) Gao, Lin; Lai, Yu-Kun; Huang, Qi-Xing; Hu, Shi-Min; I. Navazo, P. Poulin
Morphing between 3D objects is a fundamental technique in computer graphics. Traditional methods of shape morphing focus on establishing meaningful correspondences and finding smooth interpolation between shapes. Such methods however only take geometric information as input and thus cannot in general avoid producing unnatural interpolation, in particular for large-scale deformations. This paper proposes a novel data-driven approach for shape morphing. Given a database with various models belonging to the same category, we treat them as data samples in the plausible deformation space. These models are then clustered to form local shape spaces of plausible deformations. We use a simple metric to reasonably represent the closeness between pairs of models. Given source and target models, the morphing problem is casted as a global optimization problem of finding a minimal distance path within the local shape spaces connecting these models. Under the guidance of intermediate models in the path, an extended as-rigid-as-possible interpolation is used to produce the final morphing. By exploiting the knowledge of plausible models, our approach produces realistic morphing for challenging cases as demonstrated by various examples in the paper.

Filters

Author

Subject

Date

Has files

Settings

Sort By

Results per page

Search Results