ACM Home Page
Please provide us with feedback. Feedback
Progressive multiresolution meshes for deforming surfaces
Full text PdfPdf (7.62 MB)
Source Symposium on Computer Animation archive
Proceedings of the 2005 ACM SIGGRAPH/Eurographics symposium on Computer animation table of contents
Los Angeles, California
SESSION: Deformable models table of contents
Pages: 191 - 200  
Year of Publication: 2005
ISBN:1-7695-2270-X
Authors
Scott Kircher  University of Illinois at Urbana-Champaign
Michael Garland  University of Illinois at Urbana-Champaign
Sponsors
Eurographics: Eurographics Association
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 80,   Citation Count: 6
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1073368.1073395
What is a DOI?

ABSTRACT

Time-varying surfaces are ubiquitous in movies, games, and scientific applications. For reasons of efficiency and simplicity of formulation, these surfaces are often generated and represented as dense polygonal meshes with static connectivity. As a result, such deforming meshes often have a tremendous surplus of detail, with many more vertices and polygons than necessary for any given frame. An extensive amount of work has addressed the issue of simplifying a static mesh: however, these methods are inadequate for time-varying surfaces when there is a high degree of non-rigid deformation. We thus propose a new multiresolution representation for deforming surfaces that, together with our dynamic improvement scheme, provides high quality surface approximations at any level-of-detail, for all frames of an animation. Our algorithm also gives rise to a new progressive representation for time-varying multiresolution hierarchies, consisting of a base hierarchy for the initial frame and a sequence of update operations for subsequent frames. We demonstrate that this provides a very effective means of extracting static or view-dependent approximations for a deforming mesh over all frames of an animation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
{AM00} Alexa M., Muller W.: Representing animations by principal components. In Eurographics (2000), The Eurographics Association/Blackwell Publishers.
 
4
{ASCE02} Aspert N., Santa-Cruz D., Ebrahimi T.: Mesh: Measuring errors between surfaces using the hausdorff distance. In Proc. IEEE International Conference on Multimedia and Expo (2002), vol. I, pp. 705 -- 708. http://mesh.berlios.de/.
 
5
6
 
7
{CRS98} Cignoni P., Rocchini C., Scopigno R.: Metro: Measuring error on simplified surfaces. Computer Graphics Forum 17, 2 (1998), 167--174.
 
8
{DEGN98} Dey T., Edelsbrunner H., Guha S., Nekhayev D.: Topology preserving edge contraction, 1998. Technical Report RGI-Tech-98-018, Raindrop Geomagic Inc., Research Triangle Park, North Carolina.
9
 
10
{Gar99} Garland M.: Multiresolution modeling: Survey & future opportunities, 1999. In Eurographics '99 - State of the Art Reports, pages 111--131, 1999.
 
11
12
 
13
 
14
 
15
 
16
 
17
{KL70} Kernighan B. W., Lin S.: An efficient heuristic for partitioning graphs. Bell Systems Tech. J. 49 (Feb. 1970), 291--308.
 
18
 
19
 
20
 
21
 
22
{MG03} Mohr A., Gleicher M.: Deformation Sensitive Decimation. Tech. rep., University of Wisconsin Graphics Group, 2003. http://www.cs.wisc.edu/graphics/Gallery/DSD/.
23
 
24
 
25
 
26

Collaborative Colleagues:
Scott Kircher: colleagues
Michael Garland: colleagues