14 results
Search Results
Now showing 1 - 10 of 14
Item Fast Arbitrary Splitting of Deforming Objects(The Eurographics Association, 2006) Steinemann, Denis; Otaduy, Miguel A.; Gross, Markus; Marie-Paule Cani and James O'BrienWe present a novel algorithm for efficiently splitting deformable solids along arbitrary piecewise linear crack surfaces in cutting and fracture simulations. We propose the use of a meshless discretization of the deformation field, and a novel visibility graph for fast update of shape functions in meshless discretizations. We decompose the splitting operation into a first step where we synthesize crack surfaces as triangle meshes, and a second step where we use the newly synthesized surfaces to update the visibility graph, and thus the meshless discretization of the deformation field. The separation of the splitting operation into two steps, along with our novel visibility graph, enables high flexibility and control over the splitting trajectories, provides fast dynamic update of the meshless discretization, and facilitates an easy implementation, making our algorithm scalable, versatile, and suitable for a large range of applications, from computer animation to interactive medical simulation.We present a novel algorithm for efficiently splitting deformable solids along arbitrary piecewise linear crack surfaces in cutting and fracture simulations. We propose the use of a meshless discretization of the deformation field, and a novel visibility graph for fast update of shape functions in meshless discretizations. We decompose the splitting operation into a first step where we synthesize crack surfaces as triangle meshes, and a second step where we use the newly synthesized surfaces to update the visibility graph, and thus the meshless discretization of the deformation field. The separation of the splitting operation into two steps, along with our novel visibility graph, enables high flexibility and control over the splitting trajectories, provides fast dynamic update of the meshless discretization, and facilitates an easy implementation, making our algorithm scalable, versatile, and suitable for a large range of applications, from computer animation to interactive medical simulation.Item Fast Adaptive Shape Matching Deformations(The Eurographics Association, 2008) Steinemann, Denis; Otaduy, Miguel A.; Gross, Markus; Markus Gross and Doug JamesWe present a new shape-matching deformation model that allows for efficient handling of topological changes and dynamic adaptive selection of levels of detail. Similar to the recently presented Fast Lattice Shape Matching (FLSM), we compute the position of simulation nodes by convolution of rigid shape matching operators on many overlapping regions, but we rely instead on octree-based hierarchical sampling and an interval-based region definition. Our approach enjoys the efficiency and robustness of shape-matching deformation models, and the same algorithmic simplicity and linear cost as FLSM, but it eliminates its dense sampling requirements. Our method can handle adaptive spatial discretizations, allowing the simulation of more degrees of freedom in arbitrary regions of interest at little additional cost. The method is also versatile, as it can simulate elastic and plastic deformation, it can handle cuts interactively, and it reuses the underlying data structures for efficient handling of (self-)collisions. All this makes it especially useful for interactive applications such as videogames.Item Bounded Normal Trees for Reduced Deformations of Triangulated Surfaces(ACM SIGGRAPH / Eurographics Association, 2009) Schvartzman, Sara C.; Gascón, Jorge; Otaduy, Miguel A.; Eitan Grinspun and Jessica HodginsSeveral reduced deformation models in computer animation, such as linear blend skinning, point-based animation, embedding in finite element meshes, cage-based deformation, or subdivision surfaces, define surface vertex positions through convex combination of a rather small set of linear transformations. In this paper, we present an algorithm for computing tight normal bounds for a surface patch with an arbitrary number of triangles, with a cost linear in the number of governor linear transformations. This algorithm for normal bound computation constitutes the key element of the Bounded Normal Tree (BN-Tree), a novel culling data structure for hierarchical self-collision detection. In situations with sparse self-contact, normal-based culling can be performed with a small output-sensitive cost, regardless of the number of triangles in the surface.Item CLODs: Dual Hierarchies for Multiresolution Collision Detection(The Eurographics Association, 2003) Otaduy, Miguel A.; Lin, Ming C.; Leif Kobbelt and Peter Schroeder and Hugues HoppeWe present "contact levels of detail" (CLOD), a novel concept for multiresolution collision detection. Given a polyhedral model, our algorithm automatically builds a "dual hierarchy", both a multiresolution representation of the original model and its bounding volume hierarchy for accelerating collision queries.We have proposed various error metrics, including object-space errors, velocity dependent gap, screen-space errors and their combinations. At runtime, our algorithm uses these error metrics to select the appropriate levels of detail independently at each potential contact location. Compared to the existing exact collision detection algorithms, we observe significant performance improvement using CLODs on some benchmarks, with little degradation in the visual rendering of simulations.Item Texturing Internal Surfaces from a Few Cross Sections(The Eurographics Association and Blackwell Publishing Ltd, 2007) Pietroni, Nico; Otaduy, Miguel A.; Bickel, Bernd; Ganovelli, Fabio; Gross, MarkusWe introduce a new appearance-modeling paradigm for synthesizing the internal structure of a 3D model from photographs of a few cross-sections of a real object. When the internal surfaces of the 3D model are revealed as it is cut, carved, or simply clipped, we synthesize their texture from the input photographs. Our texture synthesis algorithm is best classified as a morphing technique, which efficiently outputs the texture attributes of each surface point on demand. For determining source points and their weights in the morphing algorithm, we propose an interpolation domain based on BSP trees that naturally resembles planar splitting of real objects. In the context of the interpolation domain, we define efficient warping and morphing operations that allow for real-time synthesis of textures. Overall, our modeling paradigm, together with its realization through our texture morphing algorithm, allow users to author 3D models that reveal highly realistic internal surfaces in a variety of artistic flavors.Item Fast Simulation of Deformable Models in Contact Using Dynamic Deformation Textures(The Eurographics Association, 2006) Galoppo, Nico; Otaduy, Miguel A.; Mecklenburg, Paul; Gross, Markus; Lin, Ming C.; Marie-Paule Cani and James O'BrienWe present an efficient algorithm for simulating contacts between deformable bodies with high-resolution surface geometry using dynamic deformation textures, which reformulate the 3D elastoplastic deformation and collision handling on a 2D parametric atlas to reduce the extremely high number of degrees of freedom in such a computa- tionally demanding simulation. We perform proximity queries for deformable bodies using a two-stage algorithm directly on dynamic deformation textures, resulting in output-sensitive collision detection that is independent of the combinatorial complexity of the deforming meshes. We present a robust, parallelizable formulation for computing constraint forces using implicit methods that exploits the structure of the motion equations to achieve highly stable simulation, while taking large time steps with inhomogeneous materials. The dynamic deformation textures can also be used directly for real-time shading and can easily be implemented using SIMD architecture on commodity hardware. We show that our approach, complementing existing pioneering work, offers significant computational advantages on challenging contact scenarios in dynamic simulation of deformable bodies.Item Soft Articulated Characters with Fast Contact Handling(The Eurographics Association and Blackwell Publishing Ltd, 2007) Galoppo, Nico; Otaduy, Miguel A.; Tekin, Serhat; Gross, Markus; Lin, Ming C.Fast contact handling of soft articulated characters is a computationally challenging problem, in part due to complex interplay between skeletal and surface deformation. We present a fast, novel algorithm based on a layered representation for articulated bodies that enables physically-plausible simulation of animated characters with a high-resolution deformable skin in real time. Our algorithm gracefully captures the dynamic skeleton-skin interplay through a novel formulation of elastic deformation in the pose space of the skinned surface. The algorithm also overcomes the computational challenges by robustly decoupling skeleton and skin computations using careful approximations of Schur complements, and efficiently performing collision queries by exploiting the layered representation. With this approach, we can simultaneously handle large contact areas, produce rich surface deformations, and capture the collision response of a character/s skeleton.Item Pose-Space Animation and Transfer of Facial Details(The Eurographics Association, 2008) Bickel, Bernd; Lang, Manuel; Botsch, Mario; Otaduy, Miguel A.; Gross, Markus; Markus Gross and Doug JamesThis paper presents a novel method for real-time animation of highly-detailed facial expressions based on a multi-scale decomposition of facial geometry into large-scale motion and fine-scale details, such as expression wrinkles. Our hybrid animation is tailored to the specific characteristics of large- and fine-scale facial deformations: Large-scale deformations are computed with a fast linear shell model, which is intuitively and accurately controlled through a sparse set of motion-capture markers or user-defined handle points. Fine-scale facial details are incorporated using a novel pose-space deformation technique, which learns the correspondence of sparse measurements of skin strain to wrinkle formation from a small set of example poses. Our hybrid method features real-time animation of highly-detailed faces with realistic wrinkle formation, and allows both large-scale deformations and fine-scale wrinkles to be edited intuitively. Furthermore, our pose-space representation enables the transfer of facial details to novel expressions or other facial models.Item DiFi: Fast 3D Distance Field Computation Using Graphics Hardware(The Eurographics Association and Blackwell Publishing, Inc, 2004) Sud, Avneesh; Otaduy, Miguel A.; Manocha, DineshWe present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the distance field for each slice of a uniform spatial grid baly rasterizing the distance functions of the primitives. We compute bounds on the spatial extent of the Voronoi region of each primitive. These bounds are used to cull and clamp the distance functions rendered for each slice. Our algorithm is applicable to all geometric models and does not make any assumptions about connectivity or a manifold representation. We have used our algorithm to compute distance fields of large models composed of tens of thousands of primitives on high resolution grids. Moreover, we demonstrate its application to medial axis evaluation and proximity computations. As compared to earlier approaches, we are able to achieve an order of magnitude improvement in the running time.Categories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Distance fields, Voronoi regions, graphics hardware, proximity computationsItem Simulation of High-Resolution Granular Media(The Eurographics Association, 2009) Alduan, Iván; Tena, Ángel; Otaduy, Miguel A.; Carlos Andujar and Javier LluchGranular materials enjoy vivid motion phenomena that make them highly visually attractive. However, simulating each and every physical grain imposes an extremely high computational cost, due to the stringent resolution requirements. In this paper, we introduce a method for simulating granular media that achieves high visual resolution and high mechanical fidelity at a lower computational cost than earlier methods. Our method is based on a novel spatial decomposition of the computation of internal and external forces. The method is also highly parallelizable and configurable, allowing the artist to simulate a large range of granular materials.