“Computing Nearly Exact Visible Sets within a Shaft with 4D Hierarchical Z-Buffering” by Greene
Conference:
Type(s):
Interest Area:
- Application
Title:
- Computing Nearly Exact Visible Sets within a Shaft with 4D Hierarchical Z-Buffering
Session/Category Title: Rendering Optimization
Presenter(s)/Author(s):
Abstract:
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.
Overview Page:
Submit a story:
If you would like to submit a story about this presentation, please contact us: historyarchives@siggraph.org
