Bounded normal trees for reduced deformations of triangulated surfaces

Sara C. Schvartzman, Jorge Gascón, Miguel A. Otaduy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

25 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationSymposium on Computer Animation 2009 - ACM SIGGRAPH / Eurographics Symposium Proceedings
Pages75-82
Number of pages8
DOIs
StatePublished - 2009
EventSymposium on Computer Animation 2009 - ACM SIGGRAPH / Eurographics Symposium - New Orleans, LA, United States
Duration: Aug 1 2009Aug 2 2009

Publication series

NameComputer Animation, Conference Proceedings

Conference

ConferenceSymposium on Computer Animation 2009 - ACM SIGGRAPH / Eurographics Symposium
Country/TerritoryUnited States
CityNew Orleans, LA
Period08/1/0908/2/09

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design

Fingerprint

Dive into the research topics of 'Bounded normal trees for reduced deformations of triangulated surfaces'. Together they form a unique fingerprint.

Cite this