127 results about "Geometry processing" patented technology

A hand-manipulated prop is picked-up via a single video camera, and the camera image is analyzed to isolate the part of the image pertaining to the object for mapping the position and orientation of the object into a three-dimensional space, wherein the three-dimensional description of the object is stored in memory and used for controlling action in a game program, such as rendering of a corresponding virtual object in a scene of a video display. Algorithms for deriving the three-dimensional descriptions for various props employ geometry processing, including area statistics, edge detection and / or color transition localization, to find the position and orientation of the prop from two-dimensional pixel data. Criteria are proposed for the selection of colors of stripes on the props which maximize separation in the two-dimensional chrominance color space, so that instead of detecting absolute colors, significant color transitions are detected. Thus, the need for calibration of the system dependent on lighting conditions which tend to affect apparent colors can be avoided.

Processing of up to a plurality of radiographic images of a subject, includes the capture of at least two visible light images of the subject, two or more of the visible light images in correspondence to at least one radiographic image. The visible light images are captured by one or more visible light cameras, each visible light camera in a known geometric relation to the radiographic source. Radiographic geometry of each radiographic image is calculated relative to the radiographic source and the subject through stereoscopic analysis of the visible light images and through reference to the known geometric relation between the one or more visible light cameras and the radiographic source. Three-dimensional radiographic information on the subject is generated and manipulated by processing the up to a plurality of radiographic images based on the recovered radiographic geometry.

One embodiment of the invention sets forth a technique for efficiently combining two graphics processing units (“GPUs”) to enable an improved price-performance tradeoff and better scalability relative to prior art multi-GPU designs. Each GPU's memory interface is split into a first part coupling the GPU to its respective frame buffer and a second part coupling the GPU directly to the other GPU, creating an inter-GPU private bus. The private bus enables higher bandwidth communications between the GPUs compared to conventional communications through a PCI Express™ bus. Performance and scalability are further improved through render target interleaving; render-to-texture data duplication; data compression; using variable-length packets in GPU-to-GPU transmissions; using the non-data pins of the frame buffer interfaces to transmit data signals; duplicating vertex data, geometry data and push buffer commands across both GPUs; and performing all geometry processing on each GPU.

A system, method and computer program product are provided for accelerating graphics processing utilizing a graphics application program interface. Initially, graphics data is processed in a graphics system with components including a central processing unit, a geometry processing module, and a pixel processing module. In use, the graphics application program interface accepts one or more first occlusion queries followed by a second occlusion query. The second occlusion query is at least partially processed by the graphics system before a final result of any one of the first occlusion queries is computed by the graphics system.

A freeform surface included collimation lens is provided, which is designed through a freeform surface design process to provide an integrally-formed unitary structure. The design method includes a step of identifying an optic field pattern of light source, a step of performing graphic analysis of freeform surface tangential vector formula, a step of acquiring freeform surface control point, a step of constructing a three-dimensional model, and a step of performing geometric processing. Through these steps, tangential vectors of control points of each freeform surface are determined and an approximating process or an exact solution process is adopted to determine the coordinates of the points of the freeform surface. Three-dimensional modeling software is then employing to construct an ellipsoid collimation lens, which realizes an optic collimation performance of at least 88% when tested with a circular disk set at a distance of 200 meters and having a diameter of 35 meters.

A method and an apparatus are provided for combining multiple independent tile based graphic cores. An incoming geometry stream is split into a plurality of streams and sent to respective tile based graphics processing cores. Each one generates a separate tiled geometry lists. These may be combined into a master tiling unit or, alternatively, markers may be inserted into the tiled geometry lists which are used in the rasterization phase to switch between tiling lists from different geometry processing cores.

One embodiment of the present invention sets forth a technique for parallel distribution of primitives to multiple rasterizers. Multiple, independent geometry units perform geometry processing concurrently on different graphics primitives. A primitive distribution scheme delivers primitives from the multiple geometry units concurrently to multiple rasterizers at rates of multiple primitives per clock. The multiple, independent rasterizer units perform rasterization concurrently on one or more graphics primitives, enabling the rendering of multiple primitives per system clock.

One embodiment of the present invention sets forth a technique for rendering graphics primitives in parallel while maintaining the API primitive ordering. Multiple, independent geometry units perform geometry processing concurrently on different graphics primitives. A primitive distribution scheme delivers primitives concurrently to multiple rasterizers at rates of multiple primitives per clock while maintaining the primitive ordering for each pixel. The multiple, independent rasterizer units perform rasterization concurrently on one or more graphics primitives, enabling the rendering of multiple primitives per system clock.

A sort middle graphics architecture comprising a host interface for receiving raw primitive data from a graphics application; a geometry processing module coupled to the host interface for receiving the raw primitive data from the host interface and generating sort middle traffic data, said geometry processing module a having a built-in compression module for compressing the sort middle traffic data; and a rasterization module coupled to the host interface for receiving the compressed sort middle traffic data and rasterizing the data, said rasterization module having a built-in decompression module for decompressing the sort middle traffic data before it is rasterized.

Described is a tile binning apparatus and method which consumes a low amount of power. The tile binning apparatus may determine whether to perform an overlap test that reduces an overlap factor, based on whether one or more tiles overlapping a bounding box of a triangle obtained as a result of geometry processing is one-dimensional. As a result, an unnecessary operation may be avoided which may reduce an amount of consumed power.

A hand-manipulated prop is picked-up via a single video camera, and the camera image is analyzed to isolate the part of the image pertaining to the object for mapping the position and orientation of the object into a three-dimensional space, wherein the three-dimensional description of the object is stored in memory and used for controlling action in a game program, such as rendering of a corresponding virtual object in a scene of a video display. Algorithms for deriving the three-dimensional descriptions for various props employ geometry processing, including area statistics, edge detection and / or color transition localization, to find the position and orientation of the prop from two-dimensional pixel data. Criteria are proposed for the selection of colors of stripes on the props which maximize separation in the two-dimensional chrominance color space, so that instead of detecting absolute colors, significant color transitions are detected. Thus, the need for calibration of the system dependent on lighting conditions which tend to affect apparent colors can be avoided.

A control system of a numerically controlled machine tool with a software structure, the control system including a program code of a control program specific to a machine tool and a framework that is independent of an application, wherein the framework is implemented in the form of a class library that has a first set of classes that define a functional structure of the control system. A second set of classes derived from the first set of classes of the framework, wherein the second set of classes contain the program code that is specific to the machine tool and that implements application specific functions of at least one of several functional groups associated with a man-machine interface, geometry processing, an interpolator, movement processing and a programmable logic controller.

Graphics rendering on a network on chip (‘NOC’) including receiving, in the geometry processor, a representation of an object to be rendered; converting, by the geometry processor, the representation of the object to two dimensional primitives; sending, by the geometry processor, the primitives to the plurality of scan converters; converting, by the scan converters, the primitives to fragments, each fragment comprising one or more portions of a pixel; for each fragment: selecting, by the scan converter for the fragment in dependence upon sorting rules, a pixel processor to process the fragment; sending, by the scan converter to the pixel processor, the fragment; and processing, by the pixel processor, the fragment to produce pixels for an image.

Systems and methods of geometry processing, for rasterization and ray tracing processes provide for pre-processing of source geometry, such as by tessellating or other procedural modification of source geometry, to produce final geometry on which a rendering will be based. An acceleration structure (or portion thereof) for use during ray tracing is defined based on the final geometry. Only coarse-grained elements of the acceleration structure may be produced or retained, and a fine-grained structure within a particular coarse-grained element may be produced in response to a collection of rays being ready for traversal within the coarse-grained element. Final geometry can be recreated in response to demand from a rasterization engine, and from ray intersection units that require such geometry for intersection testing with primitives. Geometry at different resolutions can be generated to respond to demands from different rendering components.

A geometric processing stage for a pipelined engine for processing video signals and generating processed video signal in space coordinates (S) adapted for display on a screen. The geometric processing stage includes: a model view module for generating projection coordinates of primitives of the video signals in a view space, said primitives including visible and non-visible primitives, a back face culling module arranged downstream of the model view module for at least partially eliminating the non visible primitives, a projection transform module for transforming the coordinates of the video signals from view space coordinates into normalized projection coordinates (P), and a perspective divide module for transforming the coordinates of the video signals from normalized projection (P) coordinates into screen space coordinates (S). The back face culling module is arranged downstream the projection transform module and operates on normalized projection (P) coordinates of said primitives. The perspective divide module is arranged downstream the back face culling module for transforming the coordinates of the video signals from normalized projection (P) coordinates into screen space coordinates (S). A circuit in the back face culling module can be shared with a standard three dimension back face culling operation when necessary. An application is in graphic engines using standard graphics language like OpenGL and NokiaGL.

A method for forming a 3-D facial model obtains a reconstructed radiographic image volume of a patient and extracts a soft tissue surface of the patient's face from the image volume and forms a dense point cloud of the extracted surface. Reflection images of the face are acquired using a camera, wherein each reflection image has a different corresponding camera angle with respect to the patient. Calibration data is calculated for one or more of the reflection images. A sparse point cloud corresponding to the reflection images is formed by processing the reflection images using multi-view geometry. The sparse point cloud is registered to the dense point cloud and a transformation calculated between reflection image texture data and the dense point cloud. The calculated transformation is applied for mapping texture data from the reflection images to the dense point cloud to form a texture-mapped volume image that is displayed.

The invention discloses a method for reconstructing a model after drilling a surface grid model of a rigid object, which aims to simplify a three-dimensional Boolean operation problem into a two-dimensional Boolean operation problem and reduce the computational complexity of an intersecting detection process of in model Boolean operation so as to achieve the real-time performance of model reconstruction. The method comprises the following steps of: firstly detecting triangular surface sheets intersected with cutting curved surfaces, moving grid peaks outside the intersected curved surfaces of the triangular surface sheets onto the cutting curved surfaces, then preprocessing model surface grids to realize the classified division of the triangular surface sheets on the surface of the grid model, and finally dynamically reconstructing the grid model in Boolean operation geometric processing. A two-dimensional Boolean operation processing method can be directly adopted to realize the Boolean operation geometric processing for the grid model in three-dimensional space, thereby saving the process of space division on the surface of the model, simplifying an intersecting detection algorithm, improving the operation efficiency and achieving the effect of real-time processing.

The invention provides an optical remote sensing satellite rigorous imaging geometrical model building method. The optical remote sensing satellite rigorous imaging geometrical model building method comprises the following steps that the geometrical relationship between the image point coordinates of an optical remote sensing satellite and the satellite is determined according to design parameters and on-orbit calibration parameters of an optical remote sensing satellite camera and the installation relation of the camera and the satellite; the shooting position of a satellite image is determined according to the GPS carried by the optical remote sensing satellite, the observation data of a laser corner reflector and the installation relation of the laser corner reflector and the satellite; the shooting angle of the satellite image is determined according to a star sensor carried by the optical remote sensing satellite and the observation data of a gyroscope and the installation relation of the gyroscope and the optical remote sensing satellite, a collinearity equation of all image points of the optical remote sensing satellite is built, and a rigorous imaging geometrical model of optical remote sensing satellite images is formed. The optical remote sensing satellite rigorous imaging geometrical model building method is the basis of optical remote sensing satellite follow-up geometrical imaging processing and application.

A method includes obtaining three-dimensional range data, using a computer graphics rendering pipeline to encode the three-dimensional range data into two-dimensional images, retrieving depth information for each sampled pixel in the two-dimensional images, and encoding the depth information into red, green and blue color channels of the two-dimensional images. The two-dimensional images may be compressed using two-dimensional techniques including dithering. The step of obtaining the three-dimensional range data may be performed using a three-dimensional range scanning device. The method may further include storing the two-dimensional images on a computer readable storage medium. The method may further include setting up the viewing angle for the three-dimensional range data. The viewing angle for the three-dimensional range data is a viewing angle of a camera used in obtaining the three-dimensional range data. The computer graphics rendering pipeline may provide for geometry processing, projection, and rasterization.

The invention provides a star sensor and high-frequency angular displacement sensor integrated attitude determination method and system. The method comprises the steps that an error measurement model is built according to a measurement principle of an angular displacement sensor, and various error sources existing in observed values are fully considered; a system measuring equation is built based on multiple star sensor information fusion results; a system state equation is built according to a satellite attitude kinematic equation and an angular displacement sensor measurement model; finally, high-frequency attitude parameter optimal estimation is achieved by adopting bi-directional Kalman filtering and an overall weighted adjustment model. According to the star sensor and high-frequency angular displacement sensor integrated attitude determination method and system, optimal information fusion of the low-frequency star sensor and the high-frequency angular displacement sensor can be achieved, high-frequency high-precision attitude data is obtained, and therefore a foundation is laid for high-resolution optical image high-precision geometric processing.

A graphics processing unit includes a set of geometry processing units each configured to process graphics primitives in parallel with one another. A given geometry processing unit generates one or more graphics primitives or geometry objects and buffers the associated vertex data locally. The geometry processing unit also buffers different sets of indices to those vertices, where each such set represents a different graphics primitive or geometry object. The geometry processing units may then stream the buffered vertices and indices to global buffers in parallel with one another. A stream output synchronization unit coordinates the parallel streaming of vertices and indices by providing each geometry processing unit with a different base address within a global vertex buffer where vertices may be written. The stream output synchronization unit also provides each geometry processing unit with a different base address within a global index buffer where indices may be written.

Provided is a rendering method and apparatuses for rendering image data. The rendering method includes generating a primitive list by performing geometry processing on a current tile to be rendered; determining whether the current tile is identical to a previous tile from among tiles included in a previously rendered frame; and in response to the previous tile being identical to the current tile, generating an image of the current tile by re-using an image of the previous tile.

A hand-manipulated prop is picked-up via a single video camera, and the camera image is analyzed to isolate the part of the image pertaining to the object for mapping the position and orientation of the object into a three-dimensional space, wherein the three-dimensional description of the object is stored in memory and used for controlling action in a game program, such as rendering of a corresponding virtual object in a scene of a video display. Algorithms for deriving the three-dimensional descriptions for various props employ geometry processing, including area statistics, edge detection and / or color transition localization, to find the position and orientation of the prop from two-dimensional pixel data. Criteria are proposed for the selection of colors of stripes on the props which maximize separation in the two-dimensional chrominance color space, so that instead of detecting absolute colors, significant color transitions are detected. Thus, the need for calibration of the system dependent on lighting conditions which tend to affect apparent colors can be avoided.

The invention belongs to the field of digital and geometric processing in computer graphics, and in particular to a 3D grid model deformation editing method based on the local rigidity principle. The invention aims at providing a deformation editing method having a fine deformation effect and a satisfactory deformation interaction speed, which is used for model reuse. The method uses grid segmentation and manifold Laplace transform to increase the local rigidity-based deformation editing speed and comprises the following steps: segmenting a 3D model into multiple parts by the grid segmentation, deforming parts which need to be deformed, and splicing the multiple parts, thereby greatly increasing the deformation speed and simultaneously avoiding distortion conditions at the joints. Besides, the manifold Laplace transform can greatly reduce the dimension of linear system of equations of corresponding deformation, thereby achieving higher result controllability.

A graphics processing unit includes a set of geometry processing units each configured to process graphics primitives in parallel with one another. A given geometry processing unit generates one or more graphics primitives or geometry objects and buffers the associated vertex data locally. The geometry processing unit also buffers different sets of indices to those vertices, where each such set represents a different graphics primitive or geometry object. The geometry processing units may then stream the buffered vertices and indices to global buffers in parallel with one another. A stream output synchronization unit coordinates the parallel streaming of vertices and indices by providing each geometry processing unit with a different base address within a global vertex buffer where vertices may be written. The stream output synchronization unit also provides each geometry processing unit with a different base address within a global index buffer where indices may be written.

A graphics system has parallel processing units that do not share vertex information. The graphics system constructs independent batches of work for the parallel processing units in which each batch of work has a list of vertices for a set of primitives.

The invention discloses a live-action three-dimensional reconstruction method and system. The method comprises the following steps: acquiring an inclined image, performing quality inspection, light and color uniformizing processing, geometric correction, homonymous point matching, block joint adjustment, multi-view image dense matching, DSM generation, true ray correction, tilt model production and image processing on the inclined image to obtain a 3D database, generating ultrahigh-density point cloud based on the inclined image, compressing and simplifying the ultrahigh-density point cloud, performing geometric processing, multi-view matching and triangulation network construction on the compressed and simplified point cloud data, extracting texture features of typical ground features, and performing visualization processing on textures to finally obtain a three-dimensional model. The problem that a large amount of time and computer resources are consumed for subsequent storage, transmission, display and reconstruction due to the fact that the density of point clouds obtained after scanning is large is solved.

The invention discloses a method for modeling and simulating a door lock system based on vehicle crash safety. The method comprises the following steps of: A, preliminarily modeling the door lock system: performing geometry processing modeling and meshing on the door lock system, and exerting a motion relation restraint on components of the door lock system; B, simulating a pull rope mechanism: simulating the pull rope mechanism by using a mechanism with an equivalent synthesized spring and deducing expressions of an initial torque and an elasticity coefficient of the equivalent synthesized spring; C, inputting parameter information into the door lock system, wherein the parameter information comprises spring information, material information of the system components and quality information of the system components; and D, transferring the current door lock system model into a whole vehicle crash finite element calculation model and performing crash simulation calculation, and determining the crash safety performance of the door lock system by analyzing a simulation result. By the method, mechanism motion and component deformation of the door lock system at the moment of vehicle crash can be simulated precisely, so that the crash safety performance can be evaluated and analyzed accurately, the product design period can be shortened and the experimental cost is saved; therefore, the practicability is high.

A method of rendering pixel-composited images for a graphics-based application running on a computing system embodying a multi-mode parallel graphics rendering system (MMPGRS). The MMPGRS includes a plurality of graphic processing pipelines (GPPLs) supporting a parallel graphics rendering process employing one or more modes of parallel operation selected from the group consisting of object division, image division, and time division. Each mode of parallel operation has decomposition, distribution and recomposition stages. The MMPGRS employs one or more modes of said parallel operation in order to execute graphic commands, and process graphics data, and render pixel-composited images containing graphics for display on a display device during the run-time of said graphics-based application. The MMPGRS further includes a primary GPPL and at least one secondary GPPL, and wherein each GPPL includes (i) a GPU having a geometry processing subsystem provided with a programmable vertex shader, and a pixel processing subsystem provided with a programmable fragment shader, and (ii) video memory including a frame buffer (FB) having depth and color frame buffers for buffering pixel depth and color value, respectively. During the recomposition stage of the object division mode, the pixel depth and color values are moved from the frame buffers in the secondary GPPL, to the frame buffers in the primary GPPL, by way of inter-GPPL communication, and thereafter, the pixel depth and color values are merged with their counterparts, within the frame buffer of the primary GPPL, using the programmable vertex shader provided in the geometry processing subsystem and / or the programmable fragment shader provided in the pixel processing subsystem.

A processing device for performing a geometry process performed as preprocessing for rendering a three-dimensional object on a display by modeling the three-dimensional object using a polygon mesh. The geometry process includes a vertex process that is performed for each of the vertices of the polygon mesh by a different one of a plurality of processors, and processed vertex data obtained by the vertex process is notified among the processors so that a polygon process can be performed in each of the processors. Since each process or can continuously perform the polygon process immediately after the vertex process, it is possible to suppress the occurrence of the unbalance of timing in performing the vertex process and the polygon process, thereby efficiently performing computation while minimizing the wasteful idle time of the processors.