Scalable Methods for Processing Massive Geometric Meshes

Shaffer, Eric Gene

Permalink

https://hdl.handle.net/2142/11061 Copy

Description

Title

Scalable Methods for Processing Massive Geometric Meshes

Author(s)

Shaffer, Eric Gene

Issue Date

2005-08

Keyword(s)

computer graphics

Abstract

Polygonal meshes are easily the most common surface representation currently employed in computer graphics, finding application in fields as diverse as the visual arts and scientific computation. Technological advances in the areas of three-dimensional scanning, digital storage, and computer processing speeds have enabled the acquisition of geometric meshes of unprecedented size and detail. Too large to fit in-core on most computing systems, these meshes have sizes that exceed the address space of many conventional operating systems. Efficient processing of these meshes requires fundamentally new algorithms, designed specifically for scalability. This dissertation describes novel algorithms for adaptive simplification and smoothing of massive meshes. It also proposes a new multiresolution representation for massive meshes that enables operations such as view-dependent rendering and collision detection.

Type of Resource

text

Permalink

http://hdl.handle.net/2142/11061

Copyright and License Information

You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).

Owning Collections