Conference Paper

Bounded normal trees for reduced deformations of triangulated surfaces.

DOI: 10.1145/1599470.1599480 Conference: Proceedings of the 2009 ACM SIGGRAPH/Eurographics Symposium on Computer Animation, SCA 2009, New Orleans, Louisiana, USA, August 1-2, 2009
Source: DBLP

ABSTRACT Several 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.

0 Bookmarks
 · 
73 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we accelerate self-collision detection (SCD) for a deforming triangle mesh by exploiting the idea that a mesh cannot self collide unless it deforms enough. Unlike prior work on subspace self-collision culling which is restricted to low-rank deformation subspaces, our energy-based approach supports arbitrary mesh deformations while still being fast. Given a bounding volume hierarchy (BVH) for a triangle mesh, we precompute Energy-based Self-Collision Culling (ESCC) certificates on bounding-volume-related sub-meshes which indicate the amount of deformation energy required for it to self collide. After updating energy values at runtime, many bounding-volume self-collision queries can be culled using the ESCC certificates. We propose an affine-frame Laplacian-based energy definition which sports a highly optimized certificate pre-process, and fast runtime energy evaluation. The latter is performed hierarchically to amortize Laplacian energy and affine-frame estimation computations. ESCC supports both discrete and continuous SCD with detailed and nonsmooth geometry. We observe significant culling on many examples, with SCD speed-ups up to 26X.
    ACM Transactions on Graphics 07/2012; · 3.73 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Composite finite elements (CFEs) based on a hexahedral discretization of the simulation domain have recently shown their effectiveness in physically based simulation of deformable bodies with changing topology. In this paper we present an efficient collision detection method for CFE simulation of cuts. Our method exploits the specific characteristics of CFEs, i.e., the fact that the number of simulation degrees of freedom is significantly reduced. We show that this feature not only leads to a faster deformation simulation, but also enables a faster collision detection. To address the non-conforming properties of geometric composition and hexahedral discretization, we propose a topology-aware interpolation approach for the computation of penetration depth. We show that this approach leads to accurate collision detection on complex boundaries. Our results demonstrate that by using our method cutting on high-resolution deformable bodies including collision detection and response can be performed at interactive rates.
    The Visual Computer 06/2013; 29(6-8). · 1.07 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a novel efficient culling method for continuous collision detection (CCD) problem performed by dimension reduction in subspace. The basic idea is to use a fast one-dimension (1D) reduced filter and a fast two-dimension (2D) reduced filter that remove large amount of false positives and elementary tests between the primitives. The culling method could be combined with other techniques. The algorithm has been implemented and tested on two benchmarks, including cloth-ball simulations and N-body simulations. The results demonstrate that the algorithm can efficiently reduce the number of elementary tests one order of magnitude, and improve the overall performance of collision query about one half.
    Software Engineering (WCSE), 2012 Third World Congress on; 01/2012

Full-text (2 Sources)

Download
63 Downloads
Available from
May 28, 2014