Publication

Hair animation with collision detection

Daniel Thalmann
1993
Conference Papers

Abstract

An efficient method is proposed for hair animation. The movement of hairs is modeled by simplified physical simulations. In particular the method can treat successfully collisions between hair and a human body or other objects, which provides realistic hair animation. The fast collision detection is achieved using cylindrical representation of the head and human body parts, despite a large number of hairs. The cylindrical representation allows collision detection to be performed by table look-up and interpolation, which assures that the computation time is independent of the complexity of the objects. A reaction constraint algorithm is also applied for the collision reaction to simulate inelastic contact. The efficiency of the method is well illustrated by the animation obtained

Official source

https://infoscience.epfl.ch/entities/publication/7f3cca7d-dfeb-4221-aa68-d4e8369f337c

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Daniel Thalmann
1993
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/7f3cca7d-dfeb-4221-aa68-d4e8369f337c

About this result

Related concepts (32)

Computer animation

Computer animation is the process used for digitally generating animations. The more general term (CGI) encompasses both static scenes (s) and dynamic images (s), while computer animation refers to moving images. Modern computer animation usually uses 3D computer graphics to generate a three-dimensional picture. The target of the animation is sometimes the computer itself, while other times it is film. Computer animation is essentially a digital successor to stop motion techniques, but using 3D models, and traditional animation techniques using frame-by-frame animation of 2D illustrations.

Computational complexity

In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.

Animation

Animation is the method by which are manipulated to create moving images. In traditional animation, images are drawn or painted by hand on transparent celluloid sheets to be photographed and exhibited on film. Today, many animations are computer animations made with (CGI). Stop motion animation, in particular claymation, has continued to exist alongside these other forms. Animation is contrasted with live-action film, although the two do not exist in isolation. Many moviemakers have produced films that are a hybrid of the two.

Related publications (30)

Hair animation with collision detection

Chat with Graph Search

Acceleration of Solvers for Plasma Simulation in the Tokamak Boundary

Efficient Krylov Methods for Linear Response in Plane-Wave Electronic Structure Calculations

Graph neural network-based surrogate modeling for fast and scalable simulations of meshed district heating networks