35. Interactive Walkthrough of Large Geometric Databases

Full Day / Intermediate

Techniques, algorithms, data structures, and databases for interactively displaying very large geometric databases (greater than one million polygons drawn at least 10 frames per second). Beginning with a discussion of basic techniques and leading to state-of-the-art algorithms, speakers address key issues in walkthrough, including visibility computations, automatic object simplification, and memory management through database subset pre-fetching. Speakers show real applications of these algorithms to a variety of areas, including visual simulation, virtual reality, architecture, and digital mockup.

Who Should Attend
Workers in simulation, animation, virtual reality, architecture, CAD, medical imaging, and scientific visualization who deal with geometric databases much larger than the interactive display capacity of their workstations.

Eric Brechner
Microsoft Corporation

Brian Cabral
Silicon Graphics, Inc.

Ned Greene
Apple Computer, Inc.

Jarek Rossignac
IBM Corporation

Thomas Funkhouser
AT&T Bell Laboratories


8:30 am: Introduction - Brechner

Statement of the problem. Introduction of the speakers. Agenda.

8:40 am: Graphics Techniques for Walkthrough Applications - Cabral

An introduction to techniques common to most walkthrough applications with examples from the IRIS Performer toolkit. The methods include multi-tasking, view frustum culling, occlusion culling, level-of-detail, frame rate control, database paging, dynamic primitive tesselation, and texture replacement.

10:00 am: Break

10:15 am: Hierarchical Visibility and Tiling - Greene

Hierarchical approaches to accelerating visibility computations in extremely complex scenes.

12 noon: Break

1:30 pm: Geometric Simplification - Rossignac

The generation and exploitation of multi-resolution graphic models for the interactive visualization of complex mechanical or architectural 3D scenes.

3:00 pm: Break

3:15 pm: Database Management - Funkhouser

Algorithms for computing and pre-fetching a small subset of a disk-resident database to store in memory during an interactive walkthrough.

4:30 pm: Wrap-up and Future Directions - Brechner

Hierarchical level of detail, culling, and data staging for interactive walkthrough of infinite databases.

Courses Main Page ACM SIGGRAPH Contact us about:
Courses | This Web Site

Final SIGGRAPH 96 Web site update: 25 October 1996.
For complete information on the next conference and exhibition, see: http/