39 results about "Occlusion culling" patented technology

Techniques, systems, arrangements, and computer program products are operable in computer graphics systems to make shadow volumes more general with respect to the meshes that can serve as occluding geometry in such computer graphics systems, as well as for accelerating shadow volume techniques, particularly for large and complex input scenes.

A rendering processing apparatus is provided which performs occlusion culling for excluding from rendering targets a hidden object behind another object as seen from a point of view, when given a plurality of objects. An object input unit stores a plurality of objects in an object storing unit. An internal volume generating unit generates an internal volume which is included in a target object. A reduced Z-buffer updating unit updates a reduced Z-buffer based on the internal volume. An external volume generating unit generates an external volume which includes the target object subject to culling test. A culling determination unit consults the reduced Z-buffer and performs a Z culling test on the target object based on the external volume.

Embodiments of the invention disclose an occlusion culling method for virtual role and a server, which are used to prevent the client's perspective type plug-in and to avoid the round-off error generated in the rasterization process. In the method, the server projects an obstacle onto the projection plane of a second virtual character to obtain a convex polygon of the obstacle on the projection plane, and the obstacle is located between a first virtual character and the second virtual character. The server performs rasterization on the convex polygon. The server determines whether the convex polygon completely covers the projected area occupied by the second virtual character on the projection plane based on the result of the rasterization processing. If the convex polygon completely covers the projected area of the second virtual character, the server removes the second virtual character from the field of view of the first virtual character and sends the first occlusion culling result to the client. If the convex polygon does not completely cover the projected area of the second virtual character, the server sends the second occlusion culling result to the client.

A rendering processing apparatus is provided which performs occlusion culling for excluding from rendering targets a hidden object behind another object as seen from a point of view, when given a plurality of objects. An object input unit stores a plurality of objects in an object storing unit. An internal volume generating unit generates an internal volume which is included in a target object. A reduced Z-buffer updating unit updates a reduced Z-buffer based on the internal volume. An external volume generating unit generates an external volume which includes the target object subject to culling test. A culling determination unit consults the reduced Z-buffer and performs a Z culling test on the target object based on the external volume.

A plurality of rows of tiles is defined in a graphics display field comprising a plurality of rows of pixels, each tile including pixels from at least two rows of pixels. Occlusion flags for respective tiles of a row of tiles for a graphics primitive are set based on whether respective representative depth values for the tiles of the row of tiles meet an occlusion criterion. Pixels in rows of pixels corresponding to the row of tiles are processed for the graphics primitive in a row-by-row manner responsive to the occlusion flags. The processing may include processing rows of pixels in the row of tiles using a zig-zag traversal algorithm.

Z-buffer rendering of three-dimensional scenes is made more efficient through a method for occlusion culling by which occluded geometry is removed prior to rasterization. The method uses hierarchical z-buffering to reduce the quantity of image and depth information that needs to be accessed. A separate culling stage in the graphics pipeline culls occluded geometry and passes visible geometry on to a rendering stage. The culling stage maintains its own z-pyramid in which z-values are stored at low precision (e.g., in 8 bits). The efficiency of hierarchical z-buffering is improved through hierarchical evaluation of line and plane equations.

An apparatus and a method for generating 3-dimensional computer graphic images. The image is first sub-divided into a plurality of rectangular areas. A display list memory is loaded with object data for each rectangular area. The image and shading data for each picture element of each rectangular area are derived from the object data in the image synthesis processor and a texturizing and shading processor. A depth range generator derives a depth range for each rectangular area from the object data as the imaging and shading data is derived. This is compared with the depth of each new object to be provided to the image synthesis processor and the object may be prevented from being provided to the image synthesis processor independence on the result of the comparison.

Techniques, systems, arrangements, and computer program products are operable in computer graphics systems to make shadow volumes more general with respect to the meshes that can serve as occluding geometry in such computer graphics systems, as well as for accelerating shadow volume techniques, particularly for large and complex input scenes.

Z-buffer rendering of three-dimensional scenes is made more efficient through a method for occlusion culling by which occluded geometry is removed prior to rasterization. The method uses hierarchical z-buffering to reduce the quantity of image and depth information that needs to be accessed. A separate culling stage in the graphics pipeline culls occluded geometry and passes visible geometry on to a rendering stage. The culling stage maintains its own z-pyramid in which z-values are stored at low precision (e.g., in 8 bits). The efficiency of hierarchical z-buffering is improved through hierarchical evaluation of line and plane equations.

A rendering processing apparatus is provided which performs occlusion culling for excluding from rendering targets a hidden object behind another object as seen from a point of view, when given a plurality of objects. An object input unit stores a plurality of objects in an object storing unit. An internal volume generating unit generates an internal volume which is included in a target object. A reduced Z-buffer updating unit updates a reduced Z-buffer based on the internal volume. An external volume generating unit generates an external volume which includes the target object subject to culling test. A culling determination unit consults the reduced Z-buffer and performs a Z culling test on the target object based on the external volume.

A method for accelerating occlusion culling in a graphics computer is disclosed. A depth test is performed on a fragment for a first time to determine if the fragment is visible. The fragment can be marked as potentially visible if the depth test concluded that the fragment is visible. Subsequently, the depth test is performed on the fragment for a second time to determine if the fragment is visible. If the depth test concludes that the fragment is visible, graphics processing for the fragment can be stopped at this point.

The invention describes a method and system for use in occlusion culling of polygons in an interactive environment, such as a game. The invention employs a boundary box to simplify the testing of occludee polygons. Occluders and occludees are also transformed into non-interpenetrating, non-overlapping polygons. Winged-edges are employed to minimize a per occludee computational cost due to precision problems that may arise at non-overlapping edges. The invention then proceeds through an active edge list to identify edge discontinuities (e.g., where an edge is added or removed from the active edge list). Depth analysis is employed to determine whether an occluder occludes an occludee at the edge discontinuity. Moreover, the invention only performs depth analysis for those locations of a screen display where an occludee is determined to reside, thereby minimizing unnecessary computations.

Rows of tiles are defined in a graphics display field including rows of pixels, each tile including pixels from at least two rows of pixels. According to whether the respective representative depth values ​​of the fragments in the row of fragments satisfy the occlusion standard, an occlusion flag is set for the corresponding fragments of the row of fragments of the primitive. Pixels in a row of pixels corresponding to the row of fragments are processed for the primitive in a row-by-row manner in response to the occlusion flag. The processing may include processing rows of pixels in the row of tiles using a zigzag traversal algorithm.

A virtual reality (VR) system that includes a three-dimensional (3D) point cloud having a plurality of points, a VR viewer having a current position, a graphics processing unit (GPU), and a central processing unit (CPU). The CPU determines a field-of-view (FOV) based at least in part on the current position of the VR viewer, selects, using occlusion culling, a subset of the points based at least in part on the FOV, and provides them to the GPU. The GPU receives the subset of the plurality of points from the CPU and renders an image for display on the VR viewer based at least in part on the received subset of the plurality of points. The selecting a subset of the plurality of points is at a first frame per second (FPS) rate and the rendering is at a second FPS rate that is faster than the first FPS rate.