FastV: From-point Visibility Culling on Complex Models

Simple item page
dc.contributor.authorChandak, Anishen_US
dc.contributor.authorAntani, Lakulishen_US
dc.contributor.authorTaylor, Micahen_US
dc.contributor.authorManocha, Dineshen_US
dc.date.accessioned2015-02-23T14:56:36Z
dc.date.available2015-02-23T14:56:36Z
dc.date.issued2009en_US
dc.description.abstractWe 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.en_US
dc.description.number4en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume28en_US
dc.identifier.doi10.1111/j.1467-8659.2009.01501.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages1237-1246en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2009.01501.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleFastV: From-point Visibility Culling on Complex Modelsen_US
Files
Collections
28-Issue 4
EGSR09: 20th Eurographics Symposium on Rendering