Scalable Methods for Processing Massive Geometric Meshes

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.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2015

Author dc:creator

• Shaffer, Eric Gene

Contributors dc:contributor

• Michael Garland

• Computer Science

Language dc:language

eng

Identifier

(MiAaPQ)AAI3199137

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/81693