Abstract: A surface definition module of a hair/fur pipeline may be used to define a surface. An interpolation module may be used to interpolate at least one final hair on the surface based upon at least one control hair. An effects module including an effects pipeline may be utilized to apply a plurality of effects to the final hair in a user-defined order to generate a modified final hair that may be ultimately rendered.

Abstract: A surface definition module of a hair/fur pipeline may be used to define a surface and an optimization module may be used to determine whether a hair is to be rendered upon the surface. In particular, the optimization module may be used to: determine a size metric for the hair; apply a first density curve to the size metric determined for the hair to generate a density multiplier value; and based upon the density multiplier value, determine whether the hair should be rendered.

Abstract: Aspects comprise systems implementing 3-D graphics processing functionality in a multiprocessing system. Control flow structures are used in scheduling instances of computation in the multiprocessing system, where different points in the control flow structure serve as points where deferral of some instances of computation can be performed in favor of scheduling other instances of computation. In some examples, the control flow structure identifies particular tasks, such as intersection testing of a particular portion of an acceleration structure, and a particular element of shading code. In some examples, the aspects are used in 3-D graphics processing systems that can perform ray tracing based rendering.

Abstract: A floating point rasterization and frame buffer in a computer system graphics program. The rasterization, fog, lighting, texturing, blending, and antialiasing processes operate on floating point values. In one embodiment, a 16-bit floating point format consisting of one sign bit, ten mantissa bits, and five exponent bits (s10e5), is used to optimize the range and precision afforded by the 16 available bits of information. In other embodiments, the floating point format can be defined in the manner preferred in order to achieve a desired range and precision of the data stored in the frame buffer. The final floating point values corresponding to pixel attributes are stored in a frame buffer and eventually read and drawn for display. The graphics program can operate directly on the data in the frame buffer without losing any of the desired range and precision of the data.

Abstract: A method for enhanced forward rendering is disclosed which includes a depth pre-pass, light culling and a final shading. The depth pre-pass minimizes the cost of final shading by avoiding high pixel overdraw. The light culling stage calculates a list of light indices overlapping a pixel. The light indices are calculated on a per-tile basis, where the screen has been split into units of tiles. The final shading evaluates materials using information stored for each light. The forward rendering method may be executed on a processor, such as a single graphics processing unit (GPU) for example.

Abstract: A method for reconstructing geometry mapping of a rasterized area is provided. The method includes: finding a testing pixel within the rasterized area; finding an occluding point corresponding to the testing pixel in a geometry shadow map of the rasterized area; determining weight values of the occluding point according to the (x, y) coordinate values of the testing pixel and vertices of a triangle occluding the testing pixel in the rasterized area; determining depth value of the occluding point according to the weight value and z coordinate of the vertices of the occluding triangle; and comparing the depth value of the occluding point with the depth value of the testing pixel so as to determine whether the testing pixel is drawn in light or in shadow.

Abstract: The invention relates to a method for acquiring a substantially complete depth map from a 3-D scene. Both depth values and derivates of depth values may be used to calculate a pixel dense depth map with the steps of acquiring partial depth map from said 3-D scene, acquiring derivates of depth information from said scene, and extending said partial depth map by adding non-relevant information to said partial depth map, creating a pixel dense full depth map being spatially consistent with both said partial depth map and said derivates of depth information.

Abstract: An apparatus and method for joining two MRI image data sets to form a composite image. The images are joined together at one or more places along the common area by processing the first and second image data using the square of the normalized intensity difference between at least one group of pixels in the first image data and another group of pixels in the second image data.

Abstract: Systems and methods for a stencil-based overdraw visualizer are described. Mobile device that includes, for example, one or more memories and one or more processors operatively coupled to the one or more memories. The one or more memories include a stencil buffer. The one or more processors are configured to render graphics on a display based on an application that is running on the one or more processors; count overdraws in the stencil buffer on a pixel-by-pixel basis; associate respective colors with corresponding overdraw values stored in the stencil buffer; and combine rendered graphics on the display based on the application with the colors indicated in the stencil buffer on a pixel-by-pixel basis.

Abstract: The object is to generate an image in which an overlapped part of a tuned object and a non-tuned object having a contour line drawn therein is naturally represented. Only tuned objects among objects existing in a virtual three-dimensional space are perspective transformed, and image data and depth data of each tuned object is written into a process buffer 163a for each pixel. The contour of each tuned object is detected based on the depth data and normal line data acquired from the perspective transformation process, and contour line data is written into a process buffer 163c together with the depth data. When a non-tuned objects is perspective transformed, in a pixel in which a non-tuned objected is located on the front side of a tuned object, image data and depth data of the process buffer 163a are updated. The contour line data of the process buffer 163c is combined with the image data of the process buffer 163a, and the composed data is written into a frame buffer 112.

Abstract: Three-dimensional environment reconstruction is described. In an example, a 3D model of a real-world environment is generated in a 3D volume made up of voxels stored on a memory device. The model is built from data describing a camera location and orientation, and a depth image with pixels indicating a distance from the camera to a point in the environment. A separate execution thread is assigned to each voxel in a plane of the volume. Each thread uses the camera location and orientation to determine a corresponding depth image location for its associated voxel, determines a factor relating to the distance between the associated voxel and the point in the environment at the corresponding location, and updates a stored value at the associated voxel using the factor. Each thread iterates through an equivalent voxel in the remaining planes of the volume, repeating the process to update the stored value.

Abstract: A computer-implemented method and system reduces size of a data structure of a computer-aided design (CAD) model. Given a CAD model formed of a plurality of modeling elements, the method and system provide one or more geometric entities defining modeling elements of the CAD model. The geometric entities have corresponding graphical entities configured to display the CAD model. For each modeling element, the method and system determine visibility of the modeling element and produce a reduced data structure by storing in the structure graphic data representing the graphical entities and geometric data of only certain ones of the geometric entities determined as a function of visibility of the corresponding modeling elements.

Abstract: An image processing apparatus able to continuously generate region data, able to eliminate wasteful processing due to invalid regions, and able to efficiently draw an image, is provided with a triangle digital differential analyzer (DDA) circuit for generating region data increased by at least one unit square region worth of data based on set-up data including a change data input from a DDA set-up circuit in a case where at least one pixel is located inside a triangle in a unit square region including a plurality of pixels, storing the region data, further dividing the stored region data into usual region data equivalent to the unit square regions, and outputting the same as DDA data to a texture engine circuit, and a method of the same.

Abstract: A method for providing optimal correction to depth mapping between captured and displayed stereoscopic content. The solution is derived in a continuous form that can be implemented through CGI scaling techniques compatible with image rendering techniques. Similar correction can be implemented with variable depth-dependent camera separation and disparity re-mapping. The latter is applicable to correcting existing stereoscopic content.

Abstract: A method for performing a ray-box intersection test includes forming a span extending between a first plane-ray intersection point and a second plane-ray intersection point, and increasing the span by relocating to a new position at least one of the first and second plane-ray intersection points. A box intersection span is constructed using the increased span, and the box intersection span, which corresponds to a node in a hierarchical acceleration structure, is tested for intersection with the ray.

Abstract: A system, method, and computer program product are provided for generating a plurality of two-dimensional images and a plurality of depth maps for a scene at a point in time. In various embodiments, such two-dimensional images and depth maps may be utilized to generate a plurality of images.

Abstract: A depth cache keeps the depth data in compressed format when possible. This involves a more flexible cache implementation, where a tile may occupy a variable amount of cache lines depending on whether it can be compressed or not. One advantage of some embodiments this depth cache is that the effective cache size increases proportionally to the compression ratio. The memory bandwidth can be reduced, compared to a system compressing the data after the cache in some embodiments. Alternatively, pre-cache compression may increase the effective cache size by a factor of two or more, compared to a post-cache compressor, at equal or higher performance.

Abstract: A graphic system having a central processing unit; a system memory coupled to the central processing unit; a display unit provided with a corresponding screen; a graphic module coupled to and controlled by the central processing unit to render an image on the screen of the display unit, the graphic module including a fragment graphic module having a depth test buffer for storing a current depth value; a depth test stage coupled to the depth test buffer for comparing the current depth value with a depth coordinate associated with an incoming fragment and defining a resulting fragment; a test stage for testing the resulting fragment and defining a retained fragment; a buffer writing stage operatively associated with the test stage for receiving the retained fragment, the buffer writing stage coupled to the depth test buffer for updating the current depth value with a depth value of the retained fragment.

Abstract: A method for automatic virtual endoscopy navigation, including: (a) using a fisheye camera to generate an endoscopic image and a depth image from a current position of the camera in lumen computed tomographic (CT) data; (b) segmenting a first region and a second region from the depth image, wherein the first region identifies a view direction of the camera and the second region is an area through which the camera can be moved without touching an inner surface of the lumen; (c) moving the camera from the current position, while pointing the camera in the view direction, to a next position in the second region; and (d) repeating steps (a-c) in sequence using the next position in step (c) as the current position in step (a).

Abstract: Pixel depth values of a user-controlled virtual object in a three-dimensional scene may be re-scaled to avoid artifacts when the scene is displayed. Minimum and maximum threshold values can be determined for the three-dimensional scene. Each pixel depth value of the user-controlled virtual object can be compared to the minimum threshold value and the maximum threshold value. A depth value of each pixel of the user-controlled virtual object that falls below the minimum threshold value can be set to a corresponding low value. Each pixel depth value of the user-controlled virtual object that exceeds the maximum threshold value can be set to a corresponding high value.

Abstract: A method and an apparatus provided for rendering three-dimensional computer graphic images which include both translucent and opaque objects. A list of objects which may be visible in the images is determined and for each pixel in the list a determination is made as to whether or not the object in the list may be visible at that pixel. A data tag is stored for a transparent object determined to be visible at the pixel, and the data tag and object data are passed to a texturing and shading unit when the translucent object is determined to be overwriting the location in the tag buffer already occupied by another data tag.

Abstract: A method and system for selective enablement of tile compression. The method includes receiving a graphics primitive for processing in a set-up unit of a graphics processor and determining a primitive characteristic that indicates a probability of whether a final compression of a tile related to the primitive will be retained. Compression for the tile related to the primitive is allowed when the characteristic indicates the final compression will be retained. Compression for the tile related to the primitive is disallowed in the characteristic indicates the final compression will not be retained.

Abstract: A method of associating a computer generated camera with an object in a three-dimensional computer generated space. The method receives a command to associate the camera with an object in the simulated space. Based on the command the method determines a path for moving the camera to a position near the object and aiming the camera at the object. The method creates a video from the simulated camera's perspective of the three-dimensional simulated space.

Abstract: Ray tracing, and more generally, graphics operations taking place in a 3-D scene, involve a plurality of constituent graphics operations. Scheduling of graphics operations for concurrent execution on a computer may increase throughput. In aspects herein, constituent graphics operations are scheduled in groups, having members selected according to disclosed aspects. Processing for specific graphics operations in a group can be deferred if all the operations in the group cannot be further tested concurrently. Graphics operations that have been deferred are recombined into two or more different groups and ultimately complete processing, through a required number of iterations of such process. In one application, the performance of the graphics operations perform a search in which respective 1:1 matches between different types of geometric shapes involved in the 3-D scene are identified.

Abstract: The system for three-dimensional rendering of signals has a computer system having acquired, streaming, or previously stored data in its memory representing multiple channels of signals in which each channel has a value which varies over a domain, e.g., time or frequency, and a display coupled to the computer. For each channel, the computer system segments the data of the channel into segments, orders the segments, renders on the display each of the segments, in which each of the rendered segments are aligned in such order along a three-dimensional perspective with gaps between adjacently rendered segments, and lines are rendered extending from each line of each one of the rendered segments to form a three-dimensional plane in the gap to the next successive one of the rendered ordered segments to form a three-dimensional continuous or discontinuous surface characterizing the channel.

Abstract: A three-dimensional computer graphics rendering system allows a tile-based rendering system to operate with a reduced amount of storage required for tiled screen space geometry by using an untransformed display list to represent the screen's geometry.

Abstract: A method for rendering a deformable object. The method includes: obtaining a 3D volumetric voxel dataset of a region, such region having therein an object to be rendered; building a tree hierarchical structure for the obtained volumetric dataset, such tree structure blocks as the nodes of a primary tree hierarchy and bricks being those blocks stored as textures in a video memory; augmenting the primary tree hierarchical structure with maximum and minimum values of the data contained within a block; creating a neighborhood tree hierarchy having for each leaf block of the neighborhood tree hierarchy a reference to the neighboring leaf blocks in the neighborhood tree hierarchy as well as references to neighboring bricks in the neighborhood tree hierarchy; updating the information about minimum and maximum in the primary tree hierarchy by saving for each block the minimum and maximum of the neighboring blocks; and rendering the leaf blocks in visibility order.

Abstract: In general, the invention relates to a method for performing polygon dissections in a geographic information system. The method includes receiving a notification of a spatial update for a number of polygons, where each of the number of polygons overlaps at least one of a number of previously dissected polygons, determining that a dissection is required based on the spatial update, and obtaining an updated polygon, associated with the spatial update, and related polygons of the number of polygons, where each of the related polygons overlaps the updated polygon. The method further includes dissecting the updated polygon and the related polygons to obtain a number of dissected polygons and replacing at least one of the number of previously dissected polygons with the number of dissected polygons, where the at least one of the number of previously dissected polygons is invalid based on the spatial update.

Abstract: Adaptive sampling alleviates aliasing by partitioning the field of view of an image sample point into depth regions. Portions of the scene are sampled within a depth region using sample rays. If a sample ray is not completely occluded in the depth region, corresponding sample rays are evaluated in adjacent depth regions. Sample rays can be recursively evaluated in further depth regions until all the subsamples intersect opaque objects or a depth limit or transparency threshold is reached. The value of an image sample point is the weighted combination of sample rays. The number of sample rays in each depth region may increase monotonically with distance along a line of sight from an image sample point for effects such as reflection, refraction, and illumination. The number of sample rays in each depth region may increase monotonically with distance from a focal plane for effects such as depth of field.

Abstract: A standard occlusion query (OQ) may be generalized to five dimensions, which can be used for motion blurred, defocused, occlusion culling. As such, the occlusion query concept is generalized so that it can be used within 5D rasterization, which is used for rendering of motion blur and depth of field. For 5D rasterization, occlusion culling may be done with OQs as well, applied to solve other rendering related problems.

Abstract: An imaging device that segments a data set into one or more data sub-sets, each data sub-set comprising a plurality of measurement values of one or more neighboring spots; determines, per pixel, costs for the measurement values acquired at a position corresponding to a position of the pixel determines a pixel value for a pixel by determining a label value from a set of label values; and selects the measurement value at the spot indicated by the determined label as the pixel value.

Abstract: In a raster stage of a graphics processor, a method for using low precision evaluation and high precision evaluation for conservative triage of polygon status. The method includes receiving a graphics primitive for rasterization in a raster stage of a graphics processor and rasterizing the graphics primitive to generate a plurality of tiles of pixels related to the graphics primitive. The tiles are rasterized at a first level precision to generate a plurality of sub-tiles related to the graphics primitive, wherein the sub-tiles are evaluated against the graphics primitive at each of their respective corners. Each of the sub-tiles not related to the graphics primitive are discarded. The sub-tiles related to the graphics primitive are rasterized at a second level precision.

Abstract: A reconstructable geometry mapping method is provided. The reconstructable geometry mapping method includes: extracting geometry information of a plurality of occluding geometry shapes of an object's front-face with respect to a light source's point of view; performing a consistency test on a testing pixel so as to determine an occluding geometry shape corresponding to the testing pixel from the object's front-face among the plurality of occluding geometry shapes, in which the occluding geometry shape includes an occluding point, and the testing pixel overlaps with the occluding point when viewing from the light's point of view; reconstructing a depth value of an occluding point corresponding to the testing pixel; and performing a shadow determination of the testing pixel.

Abstract: A method and a corresponding apparatus for determining a position in an image, in particular a medical image enables a reliable determination of positions of interest in images of a variety of structures by displaying a volume rendering of image data acquired from an object, in particular a patient, pointing at a structure of interest displayed in the volume rendering of the image data, generating a viewing ray profile comprising information characterizing a ray running through said structure of interest, selecting a contextual profile from various contextual profiles, each of said contextual profiles comprising a representative ray profile representing a viewing ray profile of a structure, in particular an anatomical structure, and comprising profile information, and determining a position within said structure of interest based on said profile information of said selected contextual profile in the case that the representative ray profile of said selected contextual profile is matching with at least a part o

Abstract: A method for updating values of a depth buffer comprising values for display blocks of a display, and a device for implementing the method. The display is partitioned into a plurality of display regions, including a plurality of display blocks and having a minimum region depth value and a maximum region depth value. Each display region includes a plurality of display subregions. A minimum subregion depth value and a maximum subregion depth value are determined relative to at least one of the minimum region depth value and the maximum region depth value.

Abstract: An electronic device capable of ejecting a peripheral element is disclosed, including a housing, a first wheel and a driving unit. The housing has a chamber, wherein the peripheral element is stored in the chamber. The first wheel is disposed in the housing, wherein the first wheel contacts the peripheral element. The driving unit is disposed in the housing, the driving unit rotates the first wheel, and the first wheel moves the peripheral element from a first position to a second position.

Abstract: A method for rendering a three dimensional scene on a displaying screen comprises: generating for a tile of a current scene a hierarchical z-buffer which comprises a plurality of levels organized according to depth values; calculating a minimum depth value d of a submitted primitive; calculating an intersection area associated with said primitive with respect to said tile; providing a multiplicity of aligned regions each associated with a level of the hierarchical z-buffer so that the exact area calculated is suitable to be covered, at least entirely, by the union of such aligned regions; comparing the minimum depth value d of the submitted primitive with corresponding maximum depth values v1, v2, . . . , vN each read from the levels of the hierarchical z-buffer; discarding said primitive whether the minimum depth value d is bigger than all maximum depth values v1, v2, . . . , vN.

Abstract: A method, system, and computer-readable storage medium are disclosed for rendering an artwork comprising a plurality of surfaces, wherein the plurality of surfaces comprises a plurality of semi-transparent surfaces unsorted in depth. An identifier of the nearest semi-transparent surface may be determined and stored in a stencil count of a stencil buffer. The depth of the second nearest semi-transparent surface may be determined using a stencil test based on the stencil count to bypass the nearest semi-transparent surface. The second nearest semi-transparent surface may be rendered to an image buffer, and the nearest semi-transparent surface may be rendered to the image buffer.

Abstract: A system and method for generating a multi-dimensional image of an object in a scene is disclosed. One inventive aspect includes a spectral estimation module configured to convert a two-dimensional (2D) high-resolution light intensity image of the scene to a spectral-augmented image of a selected channel. The system further includes a high-resolution depth image generation module configured to generate a high-resolution depth image of the object based on a three-dimensional (3D) low-resolution depth image of the scene and the spectral-augmented image.

Abstract: Aspects include systems, methods, and media for implementing methods relating to detection of invalid intersections during ray tracing. Invalid intersections can arise from imprecision in computer-based number representation, causing ray origins to be located inappropriately. In some aspects, a ray can be associated with information relating to an expected angle between the ray's direction and a normal for a to-be-identified primitive intersected by that ray. If the angle between the ray's direction and the normal of an intersected primitive is within expectations, then that information can be used in predicting whether the intersection is valid. Such expectation information can be presented as a single bit determined by a shader performing a dot product of the ray and a normal of a primitive intersected by a parent ray, or can be obtained as a by-product of ray/primitive intersection testing.

Abstract: A method of computing z parameters for pixels of a geometric primitive. The method includes the step of accessing the geometric primitive comprising a plurality of vertices, wherein each vertex comprises a plurality of associated parameters including a depth parameter, z. During rasterization of the geometric primitive, respective z values are interpolated for each pixel of the geometric primitive. Each z value is represented within a predefined numerical range which substantially corresponds to a depth range between a near plane and a far plane related to pixel rendering. During the interpolating, the z values are allowed to exceed the predefined numerical range and roll over within the predefined numerical range. A multi-bit indicator is used to indicate when a z value for a pixel is outside of the depth range.

Abstract: One embodiment of the present invention sets forth a method for dynamically load balancing rendering operations across an IGPU and a DGPU. For each frame, the graphics driver configures the IGPU to pre-compute Z-values for a portion of the display surface and to write feedback data to the system memory indicating the time that the IGPU used to process the frame. The graphics driver then configures the DGPU to use the pre-computed Z-values while rendering to the complete display surface and to write feedback data to the system memory indicating the time that the DGPU used to process the frame. The graphics driver uses the feedback data from the IGPU and DGPU in conjunction with the percentage of the display surface that the IGPU Z-rendered for the frame to scale the portion of the display surface that the IGPU Z-renders for one or more subsequent frames. In this fashion, overall processing within the graphics pipeline is optimized across the IGPU and DGPU.

Abstract: One embodiment of the present invention sets forth a technique rendering an image pixel within a graphics image with multiple shaders in a single rendering phase using a modular shader architecture. A user specifies how geometric objects, light sources, and various types of rendering operations in a graphics scene are associated. A rendering application provides computational infrastructure for rendering operations that includes finding an intersected object for each pixel of a target graphics image. The modular shader architecture includes a means for efficiently developing and incorporating custom shader modules for use by the rendering application.

Abstract: An apparatus and method for rasterizing a primitive in a graphics system is disclosed in one example of the invention as including scanning a first row of tiles, one tile at a time, starting from a first point and scanning in a first direction. Immediately after scanning the first row of tiles, the method includes moving from the first point to a second point in an orthogonal direction relative to the first row. Immediately after moving from the first point to the second point, the method includes scanning a second row of tiles, one tile at a time, starting from the second point and scanning in the first direction. By scanning rows in the same direction immediately prior to and after moving from one row to another, cache utilization is improved.

Abstract: A method for providing hybrid hidden-line processing for a plurality of polygons representing tessellated image data, wherein each polygon comprises a plurality of edges, is provided. The method includes generating a back-facing plate comprising polygons on a back-facing side of a silhouette of the tessellated image data and a front-facing plate comprising polygons on a front-facing side of the silhouette of the tessellated image data. The method includes tracing the edges and identifying at least one visibility change pixel in each of a subset of the traced edges. The method includes, for each visibility change pixel, determining whether the traced edge is from the same plate as a polygon corresponding to the visibility change pixel. The method includes, for each traced edge that is determined to be from the same plate as the polygon corresponding to the visibility change pixel, displaying the traced edge.

Abstract: A digital image rendering system, such as a geographic map rendering system, receives image data from an image database, such as a map database, in the form of data having image features defined as sets of image objects arranged in a series of layers. The image rendering system processes the received data in a manner that allows for rendering the original layered data without rendering each original layer separately by reordering the original layered digital image data into fewer layers.

Abstract: An example-based 2D to 3D image conversion method, a computer readable medium therefore, and a system are provided. The embodiments are based on an image database with depth information or with which depth information can be generated. With respect to a 2D image to be converted into 3D content, a matched background image is found from the database. In addition, graph-based segmentation and comparison techniques are employed to detect the foreground of the 2D image so that the relative depth map can be generated from the foreground and background information. Therefore, the 3D content can be provided with the 2D image plus the depth information. Thus, users can rapidly obtain the 3D content from the 2D image automatically and the rendering of the 3D content can be achieved.

Abstract: Method, computer program and system for tracking movement of a subject. The method includes receiving data from a distributed network of camera sensors employing one or more emitted light sources associated with one or more of the one or more camera sensors to generate a volumetric three-dimensional representation of the subject, identifying a plurality of clusters within the volumetric three-dimensional representation that correspond to motion features indicative of movement of the motion features of the subject, presenting one or more objects on one or more three dimensional display screens, and using the plurality of fixed position sensors to track motion of the motion features of the subject and track manipulation of the motion features of the volumetric three-dimensional representation to determine interaction of one or more of the motion features of the subject and one or more of the one or more objects on the three dimensional display.

Abstract: A method and apparatus for providing optimal correction to depth mapping between captured and displayed stereoscopic content. The solution is derived in a continuous form that can be implemented through CGI scaling techniques compatible with image rendering techniques. Similar correction can be implemented with variable depth-dependent camera separation and disparity re-mapping. The latter is applicable to correcting existing stereoscopic content.

Abstract: An input processing device comprises a display screen and a pointing device for inputting corresponding 2-dimensional coordinates on the display screen. A 3-dimensional space is displayed on the display screen and the 2-dimensional coordinates inputted from the pointing device are detected. Next, shift amounts, per unit of time, of the detected 2-dimensional coordinates are calculated based on a predetermined calculation start condition. And the calculated shift amounts are converted to 3-dimensional coordinate shift amounts in the 3-dimensional space.