Abstract: Techniques are disclosed for simplifying an occluder representing 3D graphics data. Graphics data corresponding to one or more 3D objects is voxelized. A plurality of planes is generated to intersect the voxelized graphics data. Intersections between the planes and the voxelized graphics data are evaluated to identify corresponding slice polygons from the intersections. A subset of the planes is selected to maximize a correctness of a simplified occluder. The simplified occluder representing the object is generated from a union of the selected subset of the planes.

Abstract: Embodiments presented herein provide techniques for creating and simplifying a cell and portal graph. The simplified cell and portal graph may be used to make a conservative determination of whether an element of geometry is visible for a given view frustum (and therefore needs to be rendered). That is, the simplified cell and portal graph retains the encoded visibility for given set of geometry. The simplified cell and portal graph provides a “conservative” determination of visibility as it may indicate that some objects are visible that are not (resulting in unneeded rendering), but not the other way around. Further, this approach allows cell and portal graphs to be generated dynamically, allowing the cell and portal graphs to be used for scenes where the geometry can change (e.g., as 3D world of a video game).

Abstract: Embodiments presented herein provide techniques for creating and simplifying a cell and portal graph. The simplified cell and portal graph may be used to make a conservative determination of whether an element of geometry is visible for a given view frustum (and therefore needs to be rendered). That is, the simplified cell and portal graph retains the encoded visibility for given set of geometry. The simplified cell and portal graph provides a “conservative” determination of visibility as it may indicate that some objects are visible that are not (resulting in unneeded rendering), but not the other way around. Further, this approach allows cell and portal graphs to be generated dynamically, allowing the cell and portal graphs to be used for scenes where the geometry can change (e.g., as 3D world of a video game).

Abstract: Embodiments presented herein provide techniques for creating and simplifying a cell and portal graph. The simplified cell and portal graph may be used to make a conservative determination of whether an element of geometry is visible for a given view frustum (and therefore needs to be rendered). That is, the simplified cell and portal graph retains the encoded visibility for given set of geometry. The simplified cell and portal graph provides a “conservative” determination of visibility as it may indicate that some objects are visible that are not (resulting in unneeded rendering), but not the other way around. Further, this approach allows cell and portal graphs to be generated dynamically, allowing the cell and portal graphs to be used for scenes where the geometry can change (e.g., as 3D world of a video game).

Abstract: Embodiments presented herein provide techniques for creating and simplifying a cell and portal graph. The simplified cell and portal graph may be used to make a conservative determination of whether an element of geometry is visible for a given view frustum (and therefore needs to be rendered). That is, the simplified cell and portal graph retains the encoded visibility for given set of geometry. The simplified cell and portal graph provides a “conservative” determination of visibility as it may indicate that some objects are visible that are not (resulting in unneeded rendering), but not the other way around. Further, this approach allows cell and portal graphs to be generated dynamically, allowing the cell and portal graphs to be used for scenes where the geometry can change (e.g., as 3D world of a video game).