Trim Regions for Online Computation of From-Region Potentially Visible Sets

• DOI: 10.1145/3592434
• Publication Date: 2023-07-26T14:29:21Z
• Authors: Philip Voglreiter; Bernhard Kerbl; Alexander Weinrauch; Joerg Hermann Mue...; Thomas Neff; Markus Steinberger; Dieter Schmalstieg
• Keywords: Precomputation; Trim; Heuristics

Visibility computation is a key element in computer graphics applications. More specifically, from-region potentially visible set (PVS) an established tool rendering acceleration, but its high computational cost means PVS almost always precomputed. Precomputation restricts the use of to static scenes and leads storage cost, particular, if we need fine-grained regions. For dynamic applications, such as streaming content over variable-bandwidth network, online with configurable region size required. We address this trim regions, new method for generating arbitrary real time. Trim regions perform controlled erosion object silhouettes image space, implicitly applying shrinking theorem known from previous work. Our algorithm first that applies automatic unconstrained 3D scenes, including non-manifold meshes, does so time using efficient GPU execution model. demonstrate our generates tight complex outperforms methods from-viewpoint PVS. It runs at 60 Hz realistic game consisting millions triangles computes tightness matching or surpassing existing approaches.