{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81693"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81693","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Scalable Methods for Processing Massive Geometric Meshes","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Shaffer, Eric Gene"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Michael Garland"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:20:02Z","date_published":"2015-09-25T20:20:02Z","updated_at":"2026-07-22T22:26:16Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3199137"],"render_values":[{"text":"(MiAaPQ)AAI3199137","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81693","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Michael Garland"]},{"key":"dc:creator","label":"Author","values":["Shaffer, Eric Gene"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:20:02Z","10000-01-01","2005"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81693","(MiAaPQ)AAI3199137"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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.","Made available in DSpace on 2015-09-25T20:20:02Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3199137.pdf: 3311320 bytes, checksum: 3710a42ebef2ffad3e17230f601f147c (MD5) Previous issue date: 2005","Embargo set by: Seth Robbins for item 82974 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","86 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005."]},{"key":"dc:title","label":"Title","values":["Scalable Methods for Processing Massive Geometric Meshes"]}]}],"canonical_facts":{"dc:contributor":["Michael Garland"],"dc:creator":["Shaffer, Eric Gene"],"dc:date":["2015-09-25T20:20:02Z","10000-01-01","2005"],"dc:description":["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.","Made available in DSpace on 2015-09-25T20:20:02Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3199137.pdf: 3311320 bytes, checksum: 3710a42ebef2ffad3e17230f601f147c (MD5) Previous issue date: 2005","Embargo set by: Seth Robbins for item 82974 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","86 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005."],"dc:identifier":["http://hdl.handle.net/2142/81693","(MiAaPQ)AAI3199137"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Scalable Methods for Processing Massive Geometric Meshes"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:16Z"}