Sketches & Applications Siggraph 2001 logo
Main Comments
Conference Exhibition Call for Participation Presenters Media Search | Site Map
Conference Exhibition Call for Participation Exhibitors Media Search | Site Map



Rendering Optimization
Thursday, 16 August
10:30 am - 12:15 pm
Room 403


Session Chair
Randy Frank
Lawrence Livermore National Laboratories


k-DOPs as Tighter Bounding Volumes for Better Occlusion Performance
Dirk Bartz
WSI/GRIS, Universität Tübingen
Auf der Morgenstelle 10/C9
Tübingen, 72076 GERMANY
bartz@gris.uni-tuebingen.de

Using discrete orientation polytopes (k-dops) as bounding volumes for occlusion culling. They represent a much tighter shape approximation than widely used axis-aligned bounding boxes.


Multi-Resolution Depth Buffer
Eugene Lapidous
Viewspace Technologies, Inc.
P.O. Box 2008
Saratoga, California 95070 USA
eugene@viewspace.com

A new type of multi-resolution depth buffer allows applications optimized for screen Z to take advantage of the high-precision depth buffer algorithms. The balance between precision and performance is software-adjustable.


Occlusion Culling and Summed-Area Tables
Andreas Genz
Universität Bremen Informatik
PO Box 330 440
Bremen D-28334 GERMANY
genzo@informatik.uni-bremen.de

A method that integrates occlusion culling into the Catmul recursive-subdivision algorithm. Efficient culling is done via summed-area tables built from previously rasterized layers.


Computing Nearly Exact Visible Sets Within a Shaft With 4D Hierarchical Z-Buffering
Ned Greene
NVIDIA Corporation

Ned@ngreene.com

How a nearly minimal set of visible primitives within a shaft can be computed with a simple recursive subdivision procedure that performs 4D hierarchical z-buffering.


------

------
============