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.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We introduce an inclusion-field technique for fast detection of collisions between a highly deformable object and another object with limited deformations. We mainly target the cloth simulation application where cloth (highly deformable) collides with deforming skin of a moving human model (has limited deformation as skin stretches and compacts within finite spacial and temporal limits specified by the bending angle and speed). Our technique intermixes concepts from space voxelization and distance fields to make use of the limited deformation nature of human skin. The technique works by discretizing the space containing the object into cells, and giving each cell an inclusion property. This property specifies whether this cell lies inside, outside, or on the surface of the deforming object. As the object deforms, the cells’ inclusion properties are updated to maintain the correctness of the collision detection process. We tested our technique on a generally deforming Bezier surface, and on cloth simulation to detect collisions between cloth and several articulated and deforming human body parts. Results showed that the inclusion field allows real-time collision detection between cloth and limited deformable objects on a standard PC. The technique is simple and easy to implement.
    Journal of Advanced Research. 01/2012; 3(3):245-252.
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a method of self-intersection detection and resolution for dynamic cylindrical-lattice-based free-form deformation (FFD). The lattice-based approach allows efficient computation of deformation of complex geometries. But excessive deformation can cause visual anomalies such as surface infiltration and distortion. This paper derives a geometrically intuitive sufficient condition to guarantee that the FFD function is a homeomorphism and there is no self-intersection. The FFD function is defined by linear and quadratic B-Spline functions with the control points of the cylindrical lattice cell. The sufficient condition is satisfied if each trilinear function of the nine prism-shaped pentahedrons derived from the cell has a positive Jacobian determinant. The positivity is satisfied if the 12 tetrahedrons derived from the pentahedron have positive volumes. Based on the sufficient condition, the proposed method converts the self-intersection problem into a point-face collision detection and response problem suitable for dynamic simulation. The efficiency and accuracy of the self-intersection detection algorithm is analyzed and compared with a previous method. The results show that the proposed technique allows simulation of excessive deformation of tubular objects in an efficient and realistic manner.
    IEEE transactions on visualization and computer graphics. 04/2011; 17(4):515-26.
  • [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 - TOG. 01/2012;

Full-text (2 Sources)

Available from
May 28, 2014