Abstract: A method for a computer system includes determining a plurality of illumination modes associated with a plurality of scene descriptors, wherein the plurality of scene descriptors includes a first scene descriptor and a second scene descriptor, determining a first plurality of weights, wherein each weight from the first plurality of weights is associated with an illumination mode from the plurality of illumination modes, determining illumination data associated with the first scene descriptor in response to the first plurality of weights and in response to the plurality of illumination modes, determining a second plurality of weights, wherein each weight from the second plurality of weights is associated with an illumination mode from the plurality of illumination modes, and determining illumination data associated with the second scene descriptor in response to the second plurality of weights and in response to the plurality of illumination modes.

Abstract: One embodiment of the present invention provides a system that dynamically refocuses an image to simulate a focus plane and a depth-of-field of a virtual camera. During operation, the system receives an input image, wherein the input image includes depth information for pixels in the input image. The system also obtains parameters that specify the depth-of-field d and the location of the focus plane for the virtual camera. Next, the system uses the depth information and the parameters for the virtual camera to refocus the image. During this process, for each pixel in the input image, the system uses the depth information and the parameters for the virtual camera to determine a blur radius B for the pixel. The system then uses the blur radius B for the pixel to determine whether the pixel contributes to neighboring pixels in the refocused image.

Abstract: 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.

Abstract: The invention relates to flexible occlusion rendering, including receiving a first set of three dimensional image data including image data for a surface of interest and image data for a region occluding the surface of interest from a desired viewpoint. The purpose of this invention is to improve occlusion rendering via imaging by locating the occluding surface of the incoming three-dimensional data and, and modifying the characteristics of this data, to show the surface that is being occluded so that the image includes viewing through the occlusion to the surface of interest.

Abstract: A measurement system for obtaining a predetermined estimated value, including a measuring section for acquiring measurement data with respect to a measurement object, a display section for displaying indication concerning a measurement, a display controller, a measurement controller, a storing section for storing the measurement data, a computing section for obtaining the estimated value based on the measurement data, and a checking section for checking whether a required number of measurement data has been acquired. The display controller causes the display section to display first information relating to measurement elements required for acquiring the measurement data, and second information, for allowing an operator to recognize whether the measurement has been completed. The measurement controller causes the selection information to function as a site for accepting a command indicating start of the measurement of the measurement element relating to the individual selection information.

Abstract: 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.

Abstract: A method and apparatus for a frustum culling algorithm suitable for hardware implementation. In one embodiment, the method includes the separation of coordinates of a normal vector of each frustum plane of a frustum view into positive normal coordinates and negative normal coordinates. In one embodiment, the separation of the coordinates of each normal vector of the frustum planes enables implicit selection of the coordinates of a negative vertex (N-vertex) of an axis-aligned bounded box (AABB). Once implicitly selected, it is determined whether the N-vertex of the AABB is outside at least one frustum plane. In one embodiment, a determination that the N-vertex of the AABB is outside at least one of the frustum planes provides a trivial reject of objects enclosed by the AABB that are therefore is excluded from the rendering process. Other embodiments are described and claimed.

Abstract: 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.

Abstract: An image processing apparatus includes a first and second Z value calculators that calculate a polygon Z value and a block Z value, respectively. The polygon Z value is a coordinate value of a pixel located at a closest point to a viewpoint. The block Z value is a coordinate value of a pixel located at a closest point to the viewpoint in a block. The apparatus also includes a Z value selector that selects a Z value of a pixel closer to the viewpoint from the polygon Z value and the block Z value as an estimate Z value; and a hidden-surface removal unit that eliminates drawing of the polygon in the block when a pixel corresponding to the estimate Z value is located at a farther point from the viewpoint than a pixel located at a farthest point from the viewpoint.

Abstract: The present invention provides a scheme for compressing and decompressing the depth, or Z, components of image data. Image data is grouped into a plurality of tiles. A test is performed to determine if a tile can be compressed so that its size after compression is less than its size before compression. If so, the tile is compressed. A tile table includes a flag that can be set for each tile that is compressed. In one scheme, each tile comprises a 4×4 block of pixels. For each pixel, the visible depth complexity is determined where each visible level of depth complexity is represented by a plane equation. Depending on the depth complexity, a compression scheme is chosen that stores multiple plane equations in cache lines. The compression scheme can be used with unsampled or multisampled data and provides higher levels of compression in multisampled environments.

Abstract: Technology is disclosed for improving the rendering of a three-dimensional (3D) object. In one aspect, the technology applies multi-scale visibility patches and adjacency heuristics to restore proper face and normals orientation at a per-object and per-polygon level; and target where best to apply ray-casting metrics to refine visibility determination.

Abstract: For ray tracing systems, described methods, media, apparatuses provide for accounting of light energy that will be collected at pixels of a 2-D representation without recursive closure of a tree of ray/primitive intersections, and also provide for adaptivity in ray tracing based on importance indicators of each ray, such as a weight, which may be carried in data structures representative of the rays. Examples of such adaptivity may include determining a number of children to issue for shading an identified intersecting primitive, culling rays, and adding rays to achieve more accurate sampling, if desired. All such adaptivity may be triggered with goal-based indicators, such as a threshold value representative of rendering progress to a time-based goal, such as a frame rate.

Abstract: Systems and methods for creating and viewing three dimensional digital slides are provided. One or more microscope slides are positioned in an image acquisition device that scans the specimens on the slides and makes two dimensional images at a medium or high resolution. These two dimensional digital slide images are provided to an image viewing workstation where they are viewed by an operator who pans and zooms the two dimensional image and selects an area of interest for scanning at multiple depth levels (Z-planes). The image acquisition device receives a set of parameters for the multiple depth level scan, including a location and a depth. The image acquisition device then scans the specimen at the location in a series of Z-plane images, where each Z-plane image corresponds to a depth level portion of the specimen within the depth parameter.

Abstract: A method for imaging a myocardial surface includes receiving an image volume. A myocardial surface is segmented within the received image volume. A polygon mesh of the segmented myocardial surface is extracted. A surface texture is calculated from voxel information taken along a path normal to the surface of the myocardium. A view of the myocardial surface is rendered using the calculated surface texture.

Abstract: A graphics processing platform includes a rasteriser 50 that receives primitives representing an image to be displayed for processing. The rasteriser 50 determines which sets of sampling points of the image include sampling points that are covered by a given primitive, and then generates a fragment for rendering for each set of sampling points found to include a sampling point that is covered by the primitive and passes those fragments to a renderer 51 for rendering. The renderer 51 carries out rendering operations on the fragments that it receives, and stores the rendered fragment data in tile buffers 52. The rendered fragment data is stored in multiple copies in the appropriate sample positions in the tile buffers 52, so as to provide a separate set of fragment data for each individual sample position taken of the image. The data from the tile buffers 52 is input to a downsampling unit 53, and thence output to a frame buffer 54 of a display device 55 for display.

Abstract: A system to apply a smoothing filter during anti-aliasing at a post-rendering stage. An embodiment of the system includes a three-dimensional renderer, an edge detector, and a smoothing filter. The three-dimensional renderer is configured to render a three-dimensional scene. The edge detector is coupled to the three-dimensional renderer. The edge detector is configured to read values of a depth buffer and to apply edge detection criteria to the values of the depth buffer in order to detect an object edge within the three -dimensional scene. The smoothing filter coupled to the edge detector. The smoothing filter is configured to read values of a color buffer and to apply a smoothing coefficient to the values of the color buffer. The values of the color buffer include a pixel sample at the detected object edge.

Abstract: A system and method for rendering an MIP image that has reduced high frequency component loss and reduced chessboard artifacts. The method includes accessing volumetric data, having random noise. Rays are shot, or cast, through the volumetric data, onto a voxel grid, which has grid points. Sampling data along each ray is performed to obtain selected sample data points on the ray and a distance from a selected point to a nearest grid point is determined. A voxel intensity value is accessed at each selected point, as a function of the position of the selected point relative to the nearest grid point. The difference between the voxel intensity at each selected point is minimized an image is rendered from the volumetric data as a function of the minimizing step. Multiple methods may be used to minimize the difference between the voxel intensity at each selected point. These include for example 1.) applying a localized low pass filter, 2.) applying a localized high order interpolation kernel, and 3.

Abstract: 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.

Abstract: Various embodiments for reducing external bandwidth requirements for transferring graphics data are included. One embodiment includes a system for reducing the external bandwidth requirements for transferring graphics data comprising a prediction error calculator configured to generate a prediction error matrix for a pixel tile of z-coordinate data, a bit length calculator configured to calculate the number of bits needed to store the prediction error matrix, a data encoder configured to encode the prediction error matrix into a compressed block and a packer configured to shift the compressed block in a single operation to an external memory location.

Abstract: System and methods of displaying anatomical structures and their surrounding area, are disclosed. For a viewing point the anatomical structures are rendered separate from their surrounding and saved. The surrounding area of the anatomical structure within a viewing frustum is extracted, interpolated and rendered. The rendered anatomical structures and calculated image of the surrounding are combined into a complete rendering of the anatomical structures with its nearby surrounding areas.

Abstract: A method for multi-planar reconstruction of digitized medical images includes providing an image volume, sampling the neighborhood about each point in a planar region and saving a color value and a depth, providing a projection plane onto which rendering rays are projected from a viewing point through said image volume, advancing sampling points along rays through the image volume, computing depths of each sampling point, determining for sampling points on rays that penetrates the planar region if a depth of said sampling point is less than the buffer depth of a corresponding point in the planar region and sampling neighborhoods of points about such sampling points, determining if sampling points are near said planar region, applying first transfer function to sample values interpolated from first volume for sampling points close to or inside the planar region, and otherwise applying second transfer function to sample values interpolated from second volume.

Abstract: An image signal composed of sequential frames is input to a 3-dimensional image creating apparatus, frame by frame. A controller (102) designates the presence/absence of reduction, the presence/absence of joining and 2D select. An image converter (101) creates image data in the format designated by the presence/absence of reduction and the presence/absence of joining. A 3D information creator (103) creates 3D information necessary for displaying the image as a 3-dimensional image by formatting the presence/absence of reduction, the presence/absence of joining and 2D select. A multiplexer (104) converts image data and 3D information in a predetermined format and outputs them to the outside. In this way, it is possible to make the image data for 3-dimensional display versatile and select an arbitrary viewpoint image efficiently.

Abstract: The invention discloses a method for the transforming of a 2D image into a 3D image. The method comprises the steps of: (a) selecting an object of 2D image; (b) setting a base line in the 2D image; (c) base on the base line, judging whether the object is located on the foreground or background of the 2D image; (d) offering a displacement to the object; (e) moving the object with the displacement to generate a plurality of continuous images; and (f) sequentially outputting each of the continuous images to generate the 3D image. Accordingly, after the user selects an object of 2D image, the method of the invention will automatically transform the 2D image into the 3D image.

Abstract: A computer-implemented graphics system that includes a rasterizer and a shader has a mode of operation in which primitive coverage information is generated for real sample locations and virtual sample locations for use in anti-aliasing. An individual pixel includes a single real sample location and at least one virtual sample location. In some instances, a primitive may cover only virtual sample locations and does not cover a real sample location. These instances can be identified in the coverage information sent from the rasterizer to the shader, so that the shader can determine whether or not it can write color information, depth information and/or stencil information for the real sample location to a framebuffer.

Abstract: A texturing system for use in a three-dimensional graphics system has an input for receiving object data for an object to be textured. Encrypted texture data is obtained from a store and decrypted in a decryption unit. The decrypted texture data generates texture image data for a frame buffer from which the texture image data can be outputted for display. A method for producing a software application for using in a three-dimensional graphics system which creates instructions for a software application and static texture data for using in conjunction with the instructions is also provided. The static texture data is encrypted and provided as encrypted texture data with the software instructions.

Abstract: Embodiments of the present invention sets forth a method and system for reducing memory bandwidth requirements for an anti-aliasing operation. The first virtual coverage information for a pixel involved in an anti-aliasing operation is maintained in memory. If a certain operating condition of the anti-aliasing operation deterministically implies the second virtual coverage information for this pixel, the second virtual coverage information, as opposed to the first virtual coverage information, is used in the anti-aliasing operation. In such situations, since the virtual coverage information is implied, it does not have to be accessed from memory, thereby improving overall system performance.

Abstract: A high-resolution remote sensing image is processed through a true ortho-rectification. A totally new idea of H-buffer is provided to store heights of objects on the ground. The ortho-rectification includes a hidden analysis, a hidden detection and a hidden compensation. The process uses polygon patch of a building or a roadway as process unit. In the end, seam lines after hidden compensation are smoothed. The whole process time is reduced in calculations, assures quality of the orthoimage, and meets a requirement of a high-accuracy and high-resolution digital mapping.

Abstract: A graphic apparatus that draws an object three-dimensionally using a level plane and a height-axis perpendicular to the level plane includes a receiving unit, a calculating unit, and a drawing unit. The receiving unit receives vertex data identifying a position of a top surface of the object on the level plane. The calculating unit calculates a modulation coefficient of luminance for the top surface based on a normal vector for the top surface and a light-source vector indicating a direction of a light source on the level plane. The drawing unit draws the top surface using the vertex data and the modulation coefficient, and a top surface of another object using the modulation coefficient.

Abstract: A method, system, and computer-readable storage medium are disclosed for rendering artwork using a graphics processing unit (GPU). The GPU may comprise a depth buffer and a stencil buffer. Artwork input comprising one or more dirty regions and one or more clip paths may be received at the GPU. A culling operation may be performed on the artwork input. The culling operation may comprise configuring the depth buffer to reject pixels located outside a union of the one or more dirty regions. A clipping operation may be performed on the artwork input. The clipping operation may comprise configuring the stencil buffer to reject pixels located outside an intersection of the one or more clip paths.

Abstract: A graphics system coalesces Z data and color data for a raster operations stage. The Z data and color data are stored in a memory aligned tile format. In one embodiment, rendering modes in which the tile does not have a data capacity corresponding to Z data or color data for a whole number of pixels have data for at least one pixel split across entries to improve packing efficiency. Rendering modes having a number of bits for Z data or color data that does not equal a power of two such as 24 bits, 48 bits, and 96 bits, may be implemented with a high packing efficiency in tile formats having a data capacity corresponding to a power of 2 bits.

Abstract: A method including identifying a set of shadow casters and a set of shadow receivers in a frame of a scene lighted by at least a first light source, constructing a first 3D grid from the first light source's point of view fully enclosing a first volume of the scene, projecting each of the one or more shadow casters and growing each cell of the first 3D grid that includes one or more projected casters. Constructing a second 3D grid from the first light source's point of view fully enclosing the first volume and growing each cell of the second 3D grid that includes at least a portion of one or more shadow receivers and for which a corresponding cell of the first 3D grid has been grown. Forming a third 3D grid by intersecting the first 3D grid with the second 3D grid and marking for rendering into a shadow map each shadow caster that intersects the third 3D grid.

Abstract: A drawing apparatus which can display image data about a plurality of objects including opaque objects and semitransparent objects, each having information about a depth direction, on a computer display screen.

Abstract: According to some embodiments, systems, methods, apparatus, computer program code and means are provided to set a first depth value associated with a plurality of pixels of a video image comprising a plurality of planes, create a first clear rectangle with respect to the first depth value, color render the pixels that are not associated with the first clear rectangle, and render the plurality of planes.

Abstract: An image processing apparatus capable of efficient rendering is provided. In an image processing apparatus which renders, in a screen coordinate system, unit figures each constituting the surface of a three-dimensional object to be rendered, a rasterizing unit divides a rendering area corresponding to a screen into multiple unit areas, while a first unit figure is projected onto a screen coordinate system, and outputs the unit areas. A similar process is applied to second and subsequent unit figures so that the multiple unit areas constituting each unit figure are sequentially output. An area divider divides each of the unit areas sequentially output from the rasterizing unit into multiple subareas. An area discarder discards as necessary a subarea obtained by the division by the area divider according to a predetermined rule. An area writer re-merges subareas that survived the discarding process by the area discarder and writes merged areas obtained by re-merge in the memory.

Abstract: An image processing system for performing a transformation of an input image associated with an input viewpoint to an output image associated with an output viewpoint. The input image is a pre-filtered 2D representation of 3D objects as seen from the input viewpoint, and comprises for each input pixel an associated input pixel value and an associated input pixel depth. Additional to the input image a hidden image is received, being another 2D representation of the 3D objects and comprising information, which information is occluded from the input viewpoint. The system comprises a video processor being operative to create the output image by transforming each input pixel to a transformed input pixel. The transformation is a function of the input pixel depth. The output image is created, based on the transformed input pixels, using hidden image pixels for filling de-occluded areas and for at least one pixel position adjacent to the de-occluded areas.

Abstract: This invention discloses a method for executing vertex shader in a computer system, the method comprising running software vertex shader for a predetermined vertex shader command in a CPU thread when a GPU is overloaded by vertex shader execution, buffering the output of the software vertex shader, running hardware vertex shader for z-values of the vertex shader command, and replacing z-values from the software vertex shader with the z-values from the hardware vertex shader, wherein the vertex shader overloading can be lessoned yet the vertex shader z-values are consistently transformed by the hardware vertex shader.

Abstract: 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.

Abstract: The present invention relates to an image generating apparatus for generating an image from a viewpoint specified by a user. According to the invention, the apparatus has a storage unit that stores a plurality of pre-images from viewpoints on predetermined lines and depth maps indicating a depth value of each pixel of a corresponding pre-image, and an image generating unit that generates a first image from a first viewpoint based on the pre-images and depth maps.

Abstract: The current invention involves new systems and methods for providing variable rasterization performance suited to the size and shape of the primitives being rendered. Portions of pixel tiles that are fully covered by a graphics primitive are encoded and processed by the system as rectangles, rather than expanding to explicit samples. This accelerates the rendering of large primitives without increasing the computation resources used for rasterization. In some embodiments, these fully-covered regions can be rendered compressed without ever expanding into samples.

Abstract: A method and apparatus for rendering instance geometry whereby all culling, level of detail (LOD) and scene management is performed directly on a GPU.

Abstract: A real-time, group interactive, augmented-reality system for monitoring an area, suitable for enhancing the enjoyment of entertainment events, is presented. The system comprises a sensor data acquisition system for receiving sensor data, in real-time, from a plurality of data acquisition sensors disposed about an area to be monitored, and a plurality of display centers communicatively coupled with the data acquisition system for receiving sensor data therefrom. A display center includes an user input, a data acquisition sensor selector, an interaction interface for communicating in real-time with users of other display centers, an interface for connecting a display device, and a local display device augmenting system, which are configured to allow a user to interactively augment in real-time his/her local display of events with user-inputted doodles, user requested information and statistics, and user selected viewing angles.

Abstract: A method for rendering multi-dimensional image data having a plurality of objects is disclosed. The method includes the following steps: providing an object database for storing the objects, providing a first pointer storage block, obtaining a depth value of the objects as a pointer which points to an address of the first pointer storage block, storing the pointers of the objects in the object database into the first pointer storage block and according to the depth value, sequentially searching the first pointer storage block to take out the objects from the object database for displaying the image data. The method is able to skip the comparison operations for every object with different depth values as found in the prior art. Therefore, the method can reduce the amount of computation and the occupied memory bandwidth.

Abstract: In an image processing for rendering a three-dimensional virtual space by using a perspective projection transformation and a depth comparison that uses a Z buffer, firstly, polygons to be rendered in a rendering process of one frame are classified into a first-type polygon and a second-type polygon. Next, the rendering process is performed for the first-type polygon. Subsequently, at least one of a near value and a far value of a clip space is set to a value different from a value used in the rendering process for the first-type polygon. The rendering process for the second-type polygon is performed by using the clip space having at least one of the far value and the near value having been set to the value different from the value used in the rendering process for the first-type polygon.

Abstract: A method for determining a depth ordering between two planes in a 3D workspace of an application is provided. The method includes projecting vectors from a reference position through points of interest on the planes, determining corresponding points on the other plane, determining a number of points of interest on a first plane having a depth lower than its corresponding point and a number of points of interest on a second plane having a depth lower than its corresponding point, and setting the depth ordering based on these numbers. A method for displaying interconnects between nodes of a tree displayed in an application is provided. A node represents a multimedia item or a function and an interconnect represents data passed between two nodes. The method includes displaying an interconnect in the tree having an appearance indicating at least one characteristic of the data being passed between two nodes.

Abstract: An apparatus for determining visibility of agents in a scene from multiple viewpoints in a there-dimensional environment. The apparatus comprises a programmable vertex processor operable to execute a plurality of vertex programs. A programmable fragment processor is provided that is operable to execute a plurality of pixel shaders programs, said vertex programs and said pixel shaders programs operable to render each object in the scene multiple times from multiple viewpoints. A processing unit is provided that is operable to analyze the rendered viewpoints to determine visibility area of the agents.

Abstract: The following discloses antialiasing systems and methods. Information about one or more fragments or primitives in a pixel area may be dynamically stored. The stored information may include, for example, depth, color, location and coverage. The coverage and depth information may be tracked at a higher frequency across the pixel than the number of fragments or primitives. Fragments or primitives that enter into a pixel area may be compared with fragments or primitives that have been stored. The comparisons may be based on depth and coverage. Either the incoming fragment or the stored fragment may be deleted based on the comparisons. Information associated with fragments that are preserved may be sampled at any location associated with their coverage area of a pixel. Fragments or primitives that are not discarded may be preserved for a final resolve process, which may incorporate information available from neighboring pixel areas.

Abstract: A processor generates Z-cull information for tiles and groups of tiles. In one embodiment the processor includes an on-chip cache to coalesce Z information for tiles to identify occluded tiles. In a coprocessor embodiment, the processor provides Z-culling information to a graphics processor.

Abstract: Disclosed is a method and apparatus for generating a two dimensional (2D) image of a structure (e.g., an organ) that has at least one pixel corresponding to at least one voxel of a three dimensional (3D) image of the structure. First, the surface of the structure in the 3D image is modeled by a geometrical volume such as an ellipsoid. Next, normal maximum intensity projection (MIP) rays are cast (i.e., projected) for voxels of the geometrical volume. The 2D image is then generated using the rays. The 2D image has at least one pixel that corresponds to at least one voxel of the 3D image.

Abstract: An image is generated that includes ray traced pixel data and rasterized pixel data. A synergistic processing unit (SPU) uses a rendering algorithm to generate ray traced data for objects that require high-quality image rendering. The ray traced data is fragmented, whereby each fragment includes a ray traced pixel depth value and a ray traced pixel color value. A rasterizer compares ray traced pixel depth values to corresponding rasterized pixel depth values, and overwrites ray traced pixel data with rasterized pixel data when the corresponding rasterized fragment is “closer” to a viewing point, which results in composite data. A display subsystem uses the resultant composite data to generate an image on a user's display.

Abstract: A geometric data processing apparatus which can determine whether a specific component of a three-dimensional model has changed, display two-dimensional images of the specific component and neighboring components thereof, and indicate whether the change in the specific component influences the images of the neighboring components.