Abstract: Provided is a method for generating a three-dimensional (3D) mesh based on unorganized sparse 3D points to generate a mesh model that displays a 3D surface by using unorganized sparse 3D points extracted from a plurality of two-dimensional image. The 3D mesh generating method based on unorganized sparse 3D points includes the steps of: receiving a plurality of unorganized sparse 3D points, a plurality of two-dimensional (2D) corresponding point information, and images; generating an initial mesh by using the received 2D corresponding information; removing an abnormal face from the initial mesh; checking if unused 2D corresponding point information exists among the received 2D corresponding point information; if unused 2D corresponding point information exists, reorganizing the initial mesh by performing a constrained Delaunay triangulation; and if unused 2D corresponding point information does not exist in the result of the confirmation, generating a final mesh.

Abstract: Methods and apparatus for 3-D image compositing. The compositing system can be used to render 3-D objects together to a scene, to combine together separately rendered 3-D objects in a scene including previously rendered objects, or to render some objects together while separately rendering and combining together other objects in a scene. The system correctly handles image processing effects including anti-alias, motion-blur and depth-of-field effects in all regions of the scene, including regions where the objects within the scene intersect. The resulting scenes have the same high image quality regardless of which image objects are rendered together and which are later combined or composited to the final image.

Abstract: A method and apparatus for high-performance rendering and hit-testing of a window tree is provided. A window tree may be rendered using an application programming interface provided by the present invention. The application programming interface provides support for world-transforms, enabling entire sub-trees of the window tree to be rotated and scaled during rendering. In order to quickly render and hit-test the transformed nodes of the window tree, a stack-based implementation of the “painter's algorithm” is utilized to achieve fast rendering. By storing all state information on a stack regarding each node in the window tree and building new data structures containing rendering information for each node and its children, any portion of the sub tree may be rendered on demand.

Abstract: A system and method for generating a 2D transition between a first media object and a second media object. A 3D model is defined corresponding to a desired 2D transition pattern. A graphics processing unit (GPU) or a set of instructions generates a transition between the first media object and the second media object as a function of the defined 3D model. A transition generator maps a plurality of vertices of the first media object to a first mesh creating a first mapped media object where the first mesh relates to the 3D model. The transition generator maps a plurality of vertices of the second media object to a transition pattern mesh creating a second mapped media object where the transition pattern mesh relates to the 3D model. The GPU or the set of instructions renders the transition from the first mapped media object and the second mapped media object.

Abstract: A method for computing surface descriptors for a closed surface, which are each encoded with a property of the closed surface. A triangulated model of the closed surface is provided that includes a number of triangles. A number of random points within the closed surface are selected. A set of surface descriptors originated from each of the plurality of random points are generated, in parallel, using a ray bouncing algorithm. Each surface descriptor is determined using: a ray length of a ray traced by the ray bouncing algorithm; and an estimated property value at the point of intersection. The estimated property value is calculated using property values corresponding to the vertices of the intersected triangle. It is determined whether a distribution of the sets of surface descriptors converge using a convergence algorithm. The ray bouncing and convergence algorithms are repeated until this distribution is determined to converge.

Abstract: Methods and systems are provided for displaying 3D images using a display system having multiple physical layers. The physical layers of the display system are controlled (or manufactured) such that the display system produces a desired 4D light field corresponding to a real or synthetic 3D object or scene to be viewed by an observer. This may be accomplished, for example, by determining the transmittance values of one or more points in each physical layer that are required such that the desired 4D light field is produced by the display system. Various alternative embodiments are also disclosed.

Abstract: A method and apparatus are provided for transforming an irregular, unorganized cloud of data points (100) into a volumetric data or “voxel” set (120). Point cloud (100) is represented in a 3D Cartesian coordinate system having an x-axis, a y-axis and a z-axis. Voxel set (120) is represented in an alternate 3D Cartesian coordinate system having an x?-axis, a y?-axis, and a z?-axis. Each point P(x, y, z) in the point cloud (100) and its associated set of attributes, such as intensity or color, normals, density and/or layer data, are mapped to a voxel V(x?, y?, z?) in the voxel set (120). Given that the point cloud has a high magnitude of points, multiple points from the point cloud may be mapped to a single voxel. When two or more points are mapped to the same voxel, the disparate attribute sets of the mapped points are combined so that each voxel in the voxel set is associated with only one set of attributes.

Abstract: Data defining one or more graphic objects, such as buildings and vegetation, are automatically generated in a repeatable manner within each of a plurality of visual tiles of a simulated space. A seed is determined for a tile as a function of a location of the tile in the space. The seed is used to pseudo-randomly determine visually apparent characteristics of the graphic objects, such as position, height, and texture. A tile is preferably characterized by one or a combination of texture classes, such as vegetated and urban. Any tile can be associated with an annotation that specifies other characteristics of an object, such as its footprint, or of a sub-area within which objects will be depicted in the tile and rendered with the randomly determined characteristics. For multi-class tiles, the annotations are used to mask automatically generated graphic objects from undesired portions of the tile.

Abstract: Frames of image data representative of a scene containing deformable geometry subject to global illumination are computed in real-time. Frame animation data is computed for a series of frames representative, in animated sequence, of a scene containing deformable geometry. The frame animation data includes vertex attributes of a control mesh descriptive of the three dimensional surface of graphical elements occurring within the scene. Based on the frame animation data, respective illumination values are computed for the individual polygons of the control mesh to determine the global illumination of the scene. The computation is performed iteratively with respect to each frame set of frame animation data until a qualified convergence of global illumination is achieved. Within each iteration, the respective illumination values are determined based on the frame-to-frame coherent polygon illumination values determined in a prior iteration.

Abstract: A reflection image and an environment map are loaded into memory. During rendering of an object, an environment texture sample is retrieved from the environment map based on a reflection vector stored in a pixel of the reflection image. The retrieved environment texture sample is then applied to the object. The object thus rendered is stored in a frame buffer.

Abstract: Based on rectangular element data constituting a boundary surface that separates a rotating machine into a stator-side portion and a rotor-side portion, and polygonal or polyhedral element data constituting the stator-side portion and the rotor-side portion excluding the boundary surface, tetrahedral elements including nodes of each of the stator-side portion and the rotor-side portion are created, a node is created at an arbitrary distance from the gravity of the rectangular element in a normal direction for each of the rectangular elements on the boundary surface, mesh division is performed for the tetrahedral elements based on the node at the arbitrary distance and nodes on the boundary surface, and mesh division is further performed based on nodes of the stator and the rotor.

Abstract: Provided is a method for providing animation in electronic communications. An image is generated by capturing multiple photographs from a camera or video camera typically fixed in one position. The first photograph is called the “naked photo.” Using a graphics program, photos subsequent to the naked photo are edited to cut an element common to the subsequent photos. The cut images are pasted into the naked photo as layers. The modified naked photo, including the layers, is stored as a web-enabled graphics file, which is then transmitted in conjunction with electronic communication. When the electronic communication is received, the naked photo is displayed and each of the layers is displayed and removed in the order that each was taken with a short delay between photos. In this manner, a movie is generated with much smaller files than is currently possible.

Abstract: An image processing apparatus able to decrease the number of minute unit graphics, able to achieve an improvement of performance of graphics drawing processing, and able to efficiently generate images, provided with a triangle generator for receiving vertex data from a geometry processor, selecting a plurality of vertexes other than predetermined end points from among 3×3 vertexes forming a mesh, judging whether each selected vertex is valid or invalid based on a distance between the selected vertex and an adjacent vertex, generating triangle data based on validity/invalidity information of each vertex, and outputting the same via a triangle buffer to a triangle drawing device.

Abstract: The present invention is related to rendering computer animated video and/or images generally, and to simulating motion blur efficiently in computer graphics. The present invention includes selecting a plurality of sample locations from which to sample an object scene. If a given sample location overlaps a moving object, existing sample data computed or initialized for the sample location is replicated. This data is then separately updated by sampling the moving object at a plurality of times during the object scene. The replicated data is updated further by subsequently sampling moving and non-moving objects at some or all of the plurality of times. After all of the objects that overlap the sample location have been processed, the replicated data, which may be updated, is combined.

Abstract: Computer graphics apparatus, methods and systems and program products operable to generate and display human-perceptible images, comprise a ray tracer operable to generate a ray tree, the ray tree comprising a primary ray shot along a selected direction and a plurality of other rays, the other rays being generated by recursive splitting. A ray is split when it encounters a predetermined condition, and each of the rays into which it is split is directed along a selected direction. The ray tracer comprises a low-discrepancy sequence generator an condition detector and a ray generator. The low-discrepancy sequence generator is configured to generate elements of at least one low-discrepancy sequence. The condition detector is configured to determine, for one of the rays in the ray tree, whether the one of the rays encounters the predetermined condition.

Abstract: A system and method for providing a perspective-corrected representation of a multi-dimensional cluster is presented. Clusters are displayed based on independent spatial orientations within multiple dimensions. For each such spatial orientation, the clusters are located at an independent distance from a common origin. A relationship between a pair of the clusters is picked and analyzed. A criteria for perspective correction is sought. The criteria is applied to the pair of clusters to determine whether the clusters need be reoriented. The clusters are reoriented in the display by a perspective-corrected distance based on the relationship between the pair of clusters.

Abstract: A three-dimensional shape is displayed at a high speed on the basis of compressed data. A subdivision pattern for at least one face that forms the three-dimensional shape is determined on the basis of three-dimensional shape data that defines the three-dimensional shape by the face. At the same time a curved face shape of the face is determined on the basis of the position of the vertices of the face and the direction of normals at the vertices defined in advance in the three-dimensional shape data. Then the determined curved face shape is subdivided according to the determined subdivision pattern and a plurality of faces are generated on the curved face shape. A three-dimensional shape formed by the plurality of faces generated is displayed.

Abstract: A face is scanned to obtain a three-dimensional geometry of the face, images are also acquired of the face, and subsurface scattering of the face is measured. A translucency map is determined from the subsurface reflectance. A total surface reflectance and a normal map are estimated from the three-dimensional geometry and the images, and diffuse reflectance is estimated using the total reflectance. An albedo map is determined from the diffuse reflectance. The diffuse reflectance is subtracted from the total reflectance to obtain a surface reflectance. A set of bi-directional reflectance functions is fitted to the surface reflectance. Then, the set of bi-directional reflectance distribution functions, the albedo map, and the translucency map are combined to form a skin reflectance model of the face.

Abstract: A method and apparatus are provided for transforming an irregular, unorganized cloud of data points (100) into a volumetric data or “voxel” set (120). Point cloud (100) is represented in a 3D cartesian coordinate system having an x-axis, a y-axis and a z-axis. Voxel set (120) is represented in an alternate 3D cartesian coordinate system having an x?-axis, a y?-axis, and a z?-axis. Each point P(x, y, z) in the point cloud (100) and its associated set of attributes, such as intensity or color, normals, density and/or layer data, are mapped to a voxel V(x?, y?, z?) in the voxel set (120). Given that the point cloud has a high magnitude of points, multiple points from the point cloud may be mapped to a single voxel. When two or more points are mapped to the same voxel, the disparate attribute sets of the mapped points are combined so that each voxel in the voxel set is associated with only one set of attributes.

Abstract: A computer graphics processing system includes a graphics processor and a computer memory responsive to the graphics processor. The computer memory includes an image depth buffer and a hierarchical image depth buffer. The hierarchical image depth buffer contains data items that identify a nearest depth value and a farthest depth value for a plurality of image depth buffer entries associated with a plurality of corresponding pixels.