Efficient Collision Detection for Brittle Fracture - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Efficient Collision Detection for Brittle Fracture

Abstract

In complex scenes with many objects, collision detection plays a key role in the simulation performance. This is particularly true for fracture simulation, where multiple new objects are dynamically created. In this paper, we present novel algorithms and data structures for collision detection in real-time brittle fracture simulations. We build on a combination of well-known efficient data structures, namely distance fields and sphere trees, making our algorithm easy to integrate on existing simulation engines. We propose novel methods to construct these data structures, such that they can be efficiently updated upon fracture events and integrated in a simple yet effective self-adapting contact selection algorithm. Altogether, we drastically reduce the cost of both collision detection and collision response. We have evaluated our global solution for collision detection on challenging scenarios, achieving high frame rates suited for hard real-time applications such as video games or haptics. Our solution opens promising perspectives for complex brittle fracture simulations involving many dynamically created objects.
Fichier principal
Vignette du fichier
SCA2012final.pdf (11.22 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00752371 , version 1 (15-11-2012)

Identifiers

  • HAL Id : hal-00752371 , version 1

Cite

Loeïz Glondu, Sara C. Schvartzman, Maud Marchal, Georges Dumont, Miguel A. Otaduy. Efficient Collision Detection for Brittle Fracture. ACM SIGGRAPH/Eurographics Symposium on Computer Animation, Jul 2012, Lausanne, Switzerland. ⟨hal-00752371⟩
287 View
348 Download

Share

Gmail Facebook X LinkedIn More