Multi-Resolution Rendering of Complex Animated Scenes

We present a novel multi‐resolution point sample rendering algorithm for keyframe animations. The algorithm accepts triangle meshes of arbitrary topology as input which are animated by specifying different sets of vertices at keyframe positions. A multi‐resolution representation consisting of prefil...

Full description

Saved in:
Bibliographic Details
Published inComputer graphics forum Vol. 21; no. 3; pp. 483 - 491
Main Authors Wand, M., Straßer, W.
Format Journal Article
LanguageEnglish
Published Oxford, UK Blackwell Publishing, Inc 01.09.2002
Online AccessGet full text
ISSN0167-7055
1467-8659
DOI10.1111/1467-8659.t01-1-00608

Cover

More Information
Summary:We present a novel multi‐resolution point sample rendering algorithm for keyframe animations. The algorithm accepts triangle meshes of arbitrary topology as input which are animated by specifying different sets of vertices at keyframe positions. A multi‐resolution representation consisting of prefiltered point samples and triangles is built to represent the animated mesh at different levels of detail. We introduce a novel sampling and stratification algorithm to efficiently generate suitable point sample sets for moving triangle meshes. Experimental results demonstrate that the new data structure can be used to render highly complex keyframe animations like crowd scenes in real‐time. Categories and Subject Descriptors: I.3.3 [Computer Graphics]: Picture / Image Generation — Display Algorithms; I.3.6 [Computer Graphics]: Methodology and Techniques — Graphics data structures and data types; G.3 [Mathematics of Computing]: Probability and Statistics — Probabilistic algorithms.
Bibliography:istex:0B74B75865A969962309475902D4EAEC3B40ACF5
ark:/67375/WNG-KRKZXVSF-B
ArticleID:CGF608
As easy to see, the area of a triangle with linearly interpolated vertices is a 4
rd
th
*
In their paper, they also describe a fully adaptive sampling technique for parametric surfaces. However, this method cannot be applied to general 3d‐models.
Of course, the algorithm will work in any case, i.e. on arbitrary volumes of sample points.
degree polynomial in time. Thus, the time of maximum area can be calculated by solving the derivative which is a 3
degree polynomial.
ISSN:0167-7055
1467-8659
DOI:10.1111/1467-8659.t01-1-00608