[图书][B] Visibility computations in densely occluded polyhedral environments
SJ Teller - 1992 - search.proquest.com
1992•search.proquest.com
… This thesis introduces general, robust, and effective techniques to precompute superset
visibility information, that is, to expend computational resources before the simulation phase
in order to accelerate the determination of more detailed visibility information during the
simulation phase. … We show that superset visibility determination is a considerably more
tractable problem than an exact visibility computation. We introduce an abstract
computational model consisting of input and two computational phases. The input is a …
visibility information, that is, to expend computational resources before the simulation phase
in order to accelerate the determination of more detailed visibility information during the
simulation phase. … We show that superset visibility determination is a considerably more
tractable problem than an exact visibility computation. We introduce an abstract
computational model consisting of input and two computational phases. The input is a …
Abstract
This thesis investigates the extent to which precomputation and storage of visibility information can be utilized to accelerate on-line culling and rendering during an interactive visual simulation of a densely occluded geometric model.
ProQuest以上显示的是最相近的搜索结果。 查看全部搜索结果