ACM Transactions on Graphics

We present a boundary element based method for fast simulation of brittle fracture. By introducing simplifying assumptions that allow us to quickly estimate stress intensities and opening displacements during crack propagation, we build a fracture algorithm where the cost of each time step scales linearly with the length of the crackfront. The transition from a full boundary element method to our faster variant is possible at the beginning of any time step. This allows us to build a hybrid method, which uses the expensive but more accurate BEM while the number of degrees of freedom is low, and uses the fast method once that number exceeds a given threshold as the crack geometry becomes more complicated. Furthermore, we integrate this fracture simulation with a standard rigid-body solver. Our rigid-body coupling solves a Neumann boundary value problem by carefully separating translational, rotational and deformational components of the collision forces and then applying a Tikhonov regularizer to the resulting linear system. We show that our method produces physically reasonable results in standard test cases and is capable of dealing with complex scenes faster than previous finite- or boundary element approaches

Clustered Shape Matching法における再破断までを考慮した高速な破断面生成

筑波大学修士(情報学)学位論文・平成31年3月25日授与(41277号

Fundamental solutions for water wave animation

This paper investigates the use of fundamental solutions for animating detailed linear water surface waves. We first propose an analytical solution for efficiently animating circular ripples in closed form. We then show how to adapt the method of fundamental solutions (MFS) to create ambient waves interacting with complex obstacles. Subsequently, we present a novel wavelet-based discretization which outperforms the state of the art MFS approach for simulating time-varying water surface waves with moving obstacles. Our results feature high-resolution spatial details, interactions with complex boundaries, and large open ocean domains. Our method compares favorably with previous work as well as known analytical solutions. We also present comparisons between our method and real world examples

Fracturing artefacts into 3D printable puzzles to enhance audience engagement with heritage collections

Three-dimensional (3D) puzzles of heritage artefacts are typically used to engage audiences in the interpretation of archaeological objects in a museum gallery. The reason for this is that a puzzle can be seen as an enjoyable educational activity in the form of a game but also as a complex activity that archaeologists undertake when re-assembling fragments, for instance, of broken pottery. Until now the creation of this type of experiences is mostly a manual process and the artefacts used rarely reflect those in the collection due to the complex nature of the process. The contribution of this article is a novel digital worfklow for the design and fabrication of 3D puzzles that overcomes these limitations. The input to the workflow is an authentic artefact from a heritage collection, which is then digitised using technologies such as 3D scanning and 3D modelling. Thereafter, a puzzle generator system produces the puzzle pieces using a cell fracture algorithm and generates a set of puzzle pieces (female) and a single core piece (male) for fabrication. Finally, the pieces are fabricated using 3D printing technology and post-processed to facilitate the puzzle assembly. To demonstrate the feasibility of the proposed novel workflow, we deployed it to create a puzzle activity of the Saltdean urn, which is exhibited at the Archaeology Gallery of the Brighton Museum and Art Gallery. The workflow is also used with further artefacts to demonstrate its applicability to other shapes. The significance of this research is that it eases the task of creating puzzle-like activities and maintaining them in the long term within a busy public space such as a museum gallery

IST Austria Thesis

This thesis describes a brittle fracture simulation method for visual effects applications. Building upon a symmetric Galerkin boundary element method, we first compute stress intensity factors following the theory of linear elastic fracture mechanics. We then use these stress intensities to simulate the motion of a propagating crack front at a significantly higher resolution than the overall deformation of the breaking object. Allowing for spatial variations of the material's toughness during crack propagation produces visually realistic, highly-detailed fracture surfaces. Furthermore, we introduce approximations for stress intensities and crack opening displacements, resulting in both practical speed-up and theoretically superior runtime complexity compared to previous methods. While we choose a quasi-static approach to fracture mechanics, ignoring dynamic deformations, we also couple our fracture simulation framework to a standard rigid-body dynamics solver, enabling visual effects artists to simulate both large scale motion, as well as fracturing due to collision forces in a combined system. As fractures inside of an object grow, their geometry must be represented both in the coarse boundary element mesh, as well as at the desired fine output resolution. Using a boundary element method, we avoid complicated volumetric meshing operations. Instead we describe a simple set of surface meshing operations that allow us to progressively add cracks to the mesh of an object and still re-use all previously computed entries of the linear boundary element system matrix. On the high resolution level, we opt for an implicit surface representation. We then describe how to capture fracture surfaces during crack propagation, as well as separate the individual fragments resulting from the fracture process, based on this implicit representation. We show results obtained with our method, either solving the full boundary element system in every time step, or alternatively using our fast approximations. These results demonstrate that both of these methods perform well in basic test cases and produce realistic fracture surfaces. Furthermore we show that our fast approximations substantially out-perform the standard approach in more demanding scenarios. Finally, these two methods naturally combine, using the full solution while the problem size is manageably small and switching to the fast approximations later on. The resulting hybrid method gives the user a direct way to choose between speed and accuracy of the simulation