A Material Point Method for Elastoplasticity with Ductile Fracture and Frictional Contact

Simulating physical materials with dynamic movements to photo-realistic resolution has always been one of the most crucial and challenging topics in Computer Graphics. This dissertation considers large-strain elastoplasticity theory applied to the low-to-medium stiffness regime, with topological changes and codimensional objects incorporated. We introduce improvements to the Material Point Method (MPM) for two particular objectives, simulating fracturing ductile materials and incorporation of MPM and Lagrangian Finite Element Method (FEM).Our first contribution, simulating ductile fracture, utilizes traditional particle-based MPM [SSC13, SCS94] as well as the Lagrangian energy formulation of [JSS15] which uses a tetrahedron mesh, rather than particle-based estimation of the deformation gradient and potential energy. We model failure and fracture via elastoplasticity with damage. The material is elastic until its deformation exceeds a Rankine or von Mises yield condition. At that point, we use a softening model that shrinks the yield surface until it reaches the damage thresh- old. Once damaged, the material Lam ́e coefficients are modified to represent failed material. This approach to simulating ductile fracture with MPM is successful, as MPM naturally captures the topological changes coming from the fracture. However, rendering the crack surfaces can be challenging. We design a novel visualization technique dedicated to rendering the material’s boundary and its intersection with the evolving crack surfaces. Our approach uses a simple and efficient element splitting strategy for tetrahedron meshes to create crack surfaces. It employs an extrapolation technique based on the MPM simulation. For traditional particle-based MPM, we use an initial Delaunay tetrahedralization to connect randomly sampled MPM particles. Our visualization technique is a post-process and can run after the MPM simulation for efficiency. We demonstrate our method with several challenging simulations of ductile failure with considerable and persistent self-contact and applications with thermomechanical models for baking and cooking.Our second contribution, hybrid MPM–Lagrangian-FEM, aims to simulate elastic objects like hair, rubber, and soft tissues. It utilizes a Lagrangian mesh for internal force computation and a Eulerian grid for self-collision, as well as coupling with external materials. While recent MPM techniques allow for natural simulation of hyperelastic materials represented with Lagrangian meshes, they utilize an updated Lagrangian discretization and use the Eulerian grid degrees of freedom to take variations of the potential energy. It often coarsens the degrees of freedom of the Lagrangian mesh and can lead to artifacts. We develop a hybrid approach that retains Lagrangian degrees of freedom while still allowing for natural coupling with other materials simulated with traditional MPM, e.g., sand, snow, etc. Furthermore, while recent MPM advances allow for resolution of frictional contact with codimensional simulation of hyperelasticity, they do not generalize to the case of volumetric materials. We show that our hybrid approach resolves these issues. We demonstrate the efficacy of our technique with examples that involve elastic soft tissues coupled with kinematic skeletons, extreme deformation, and coupling with various elastoplastic materials. Our approach also naturally allows for two-way rigid body coupling

CSG Tree Rendering for Point-Sampled Objects

This paper presents an algorithm for rendering of pointsampled CSG models. The approach works with arbitrary CSG trees of surfel models with arbitrary sampling densities. Edges and corners are rendered by reconstructing the involved surfaces separately. The reconstructed surfaces are clipped at intersections. This way, blurring at any magnification is avoided. As opposed to existing methods, which resample surfaces close to object intersections, the proposed approach preserves the original object representation. Since no resampling is needed, dynamic scenes can be handled very flexible. Complex intersections involving any number of objects can be rendered

CSG Tree Rendering for Point-Sampled Objects

This paper presents an algorithm for rendering of pointsampled CSG models. The approach works with arbitrary CSG trees of surfel models with arbitrary sampling densities. Edges and corners are rendered by reconstructing the involved surfaces separately. The reconstructed surfaces are clipped at intersections. This way, blurring at any magnification is avoided. As opposed to existing methods, which resample surfaces close to object intersections, the proposed approach preserves the original object representation. Since no resampling is needed, dynamic scenes can be handled very flexible. Complex intersections involving any number of objects can be rendered

Génération et édition de textures géométriques représentées par des ensembles de points

Thèse numérisée par la Division de la gestion de documents et des archives de l'Université de Montréal

Point based graphics rendering with unified scalability solutions.

Standard real-time 3D graphics rendering algorithms use brute force polygon rendering, with complexity linear in the number of polygons and little regard for limiting processing to data that contributes to the image. Modern hardware can now render smaller scenes to pixel levels of detail, relaxing surface connectivity requirements. Sub-linear scalability optimizations are typically self-contained, requiring specific data structures, without shared functions and data. A new point based rendering algorithm 'Canopy' is investigated that combines multiple typically sub-linear scalability solutions, using a small core of data structures. Specifically, locale management, hierarchical view volume culling, backface culling, occlusion culling, level of detail and depth ordering are addressed. To demonstrate versatility further, shadows and collision detection are examined. Polygon models are voxelized with interpolated attributes to provide points. A scene tree is constructed, based on a BSP tree of points, with compressed attributes. The scene tree is embedded in a compressed, partitioned, procedurally based scene graph architecture that mimics conventional systems with groups, instancing, inlines and basic read on demand rendering from backing store. Hierarchical scene tree refinement constructs an image tree image space equivalent, with object space scene node points projected, forming image node equivalents. An image graph of image nodes is maintained, describing image and object space occlusion relationships, hierarchically refined with front to back ordering to a specified threshold whilst occlusion culling with occluder fusion. Visible nodes at medium levels of detail are refined further to rasterization scales. Occlusion culling defines a set of visible nodes that can support caching for temporal coherence. Occlusion culling is approximate, possibly not suiting critical applications. Qualities and performance are tested against standard rendering. Although the algorithm has a 0(f) upper bound in the scene sizef, it is shown to practically scale sub-linearly. Scenes with several hundred billion polygons conventionally, are rendered at interactive frame rates with minimal graphics hardware support