Smoothing and accelerated computations in the element free Galerkin method
Journal of Computational and Applied Mathematics - Special issue on TICAM symposium
Interactive Simulation of Surgical Cuts
PG '00 Proceedings of the 8th Pacific Conference on Computer Graphics and Applications
A virtual node algorithm for changing mesh topology during simulation
ACM SIGGRAPH 2004 Papers
A state machine for real-time cutting of tetrahedral meshes
Graphical Models - Special issue on pacific graphics 2003
Computer Animation and Virtual Worlds - Special Issue: The Very Best Papers from CASA 2004
Meshless animation of fracturing solids
ACM SIGGRAPH 2005 Papers
Real-time meshless deformation: Collision Detection and Deformable Objects
Computer Animation and Virtual Worlds - CASA 2005
Meshless Thin-Shell Simulation Based on Global Conformal Parameterization
IEEE Transactions on Visualization and Computer Graphics
Splitting cubes: a fast and robust technique for virtual cutting
The Visual Computer: International Journal of Computer Graphics
Stable Cutting of Deformable Objects in Virtual Environments Using XFEM
IEEE Computer Graphics and Applications
Splitting meshless deforming objects with explicit surface tracking
Graphical Models
A dynamic bounding volume hierarchy for generalized collision detection
Computers and Graphics
High fidelity haptic rendering for deformable objects undergoing topology changes
EuroHaptics'10 Proceedings of the 2010 international conference on Haptics: generating and perceiving tangible sensations, Part I
Meshless simulation of brittle fracture
Computer Animation and Virtual Worlds
Ray tracing dynamic scenes using selective restructuring
EGSR'07 Proceedings of the 18th Eurographics conference on Rendering Techniques
| Hi-index | 0.00 |
This paper proposes a novel method for a real-time cutting simulation of deformable objects using meshless method. The method utilizes a rapid refinement of topological relations among the simulation nodes of meshless deformable objects. Topological relations are defined as an undirected graph based on a visibility criterion. The graph connects the adjacent nodes that lie within a support of each node. The topological relations are refined by removing the edges of the graph that is intersected by the cut surface during the cutting simulation. Our approach utilizes a bounding volume hierarchy (BVH) to accelerate the computation of the intersection test. The BVH reconstruction algorithm is proposed to account for the cases where pieces of the object are completely cut out from the object. Algorithms to examine the connectivity among simulation nodes and accordingly reconstructing the BVH using two-level BVH are presented. The proposed approach achieves real-time cutting simulation of deformable objects through the rapid refinement of the topological relation. In addition, the computational performance of the cutting procedure is preserved during the entire simulation, thanks to the real-time reconstruction of the BVH. Copyright © 2012 John Wiley & Sons, Ltd.