Effective Compression Techniques for Precomputed Visibility

dc.contributor.authorPanne, Michiel van deen_US
dc.contributor.authorStewart, A. Jamesen_US
dc.contributor.editorDani Lischinski and Greg Ward Larsonen_US
dc.date.accessioned2014-01-27T13:43:56Z
dc.date.available2014-01-27T13:43:56Z
dc.date.issued1999en_US
dc.description.abstractIn rendering large models, it is important to identify the small subset of primitives that is visible from a given viewpoint. One approach is to partition the viewpoint space into viewpoint cells, and then precompute a visibility table which explicitly records for each viewpoint cell whether or not each primitive is potentially visible. We propose two algorithms for compressing such visibility tables in order to produce compact and natural descriptions of potentially-visible sets. Alternatively, the algorithms can be thought of as techniques for clustering cells and clustering primitives according to visibility criteria. The algorithms are tested on three types of scenes which have very different structures: a terrain model, a building model, and a world consisting of curved tunnels. The results show that the natural structure of each type of scene can automatically be exploited to achieve a compact representation of potentially visible sets.en_US
dc.description.seriesinformationEurographics Workshop on Renderingen_US
dc.identifier.isbn3-211-83382-Xen_US
dc.identifier.issn1727-3463en_US
dc.identifier.urihttps://doi.org/10.2312/EGWR/EGWR99/305-316en_US
dc.publisherThe Eurographics Associationen_US
dc.titleEffective Compression Techniques for Precomputed Visibilityen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
305-316.pdf
Size:
334.12 KB
Format:
Adobe Portable Document Format