 |
16. Geometric Data Structures for Computer Graphics
Monday, Tutorial, 10:30 am - 12:15 pm
Room 15 A-B
Level: Intermediate
This course provides working knowledge of essential geometric data structures and their elegant use in several representative and current areas of research in computer graphics: terrain visualization, texture synthesis, modeling, and others. Attendees learn to recognize geometric problems and acquire thorough understanding of suitable algorithms.
Prerequisites
Familiarity with the basic principles of computer graphics and typical problems in the field. This course is designed for practitioners working in 3D computer graphics (VR, CAD/CAM, animation, etc.) and advanced students in both computer graphics and computational geometry.
Topics
Geometric data structures (quadtrees,
Voronoi/Delaunay diagrams, distance fields, and bounding volume hierarchies). Algorithms and applications (terrain visualization, iso-surfaces, point location, texture synthesis, NURBS tesselation, motion planning, modeling, collision detection, occlusion culling, and a generic dynamization technique).
Co-Organizers and Lecturers
Gabriel Zachmann
Elmar Langetepe
Rheinische Friedrich-Wilhelms-Universität Bonn
Schedule
| Component 1: Introduction |
| 10:30 |
Introduction
Zachmann and Langetepe |
| Component 2: Quadtree/Octree |
| 10:35 |
Construction, Complexity, Balancing, Navigation
Langetepe |
| 10:45 |
Terrain Visualization, Iso-Surface Generation
Zachmann |
| Component 3: Bounding Volume Hierarchies |
| 10:55 |
Definition, Construction, Hierarchical Collision Detection
Zachmann |
| Component 4: Voronoi Diagrams/Delaunay Triangulations |
| 11:10 |
Definition, Construction, Generalizations, Applications
Langetepe |
| 11:30 |
NURBS Tesselation, Texture Synthesis
Zachmann |
| Component 5: Distance Fields |
| 11:40 |
Definition, Modeling, Morphing
Zachmann |
| Component 6: Dynamization of Geometric Data Structures |
| 11:55 |
Definition, Amortized Insert, and Delete
Langetepe |
|
|
|
|
|
