FastV: From-point Visibility Culling on Complex Models
Loading...
Date
2009
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association and Blackwell Publishing Ltd
Abstract
We present an efficient technique to compute the potentially visible set (PVS) of triangles in a complex 3D scene from a viewpoint. The algorithm computes a conservative PVS at object space accuracy. Our approach traces a high number of small, volumetric frusta and computes blockers for each frustum using simple intersection tests. In practice, the algorithm can compute the PVS of CAD and scanned models composed of millions of triangles at interactive rates on a multi-core PC. We also use the visibility algorithm to accurately compute the reflection paths from a point sound source. The resulting sound propagation algorithm is 10-20X faster than prior accurate geometric acoustic methods.
Description
@article{10.1111:j.1467-8659.2009.01501.x,
journal = {Computer Graphics Forum},
title = {{FastV: From-point Visibility Culling on Complex Models}},
author = {Chandak, Anish and Antani, Lakulish and Taylor, Micah and Manocha, Dinesh},
year = {2009},
publisher = {The Eurographics Association and Blackwell Publishing Ltd},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.2009.01501.x}
}