125 results about "Geometry processing" patented technology

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.

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.

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.

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.

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

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.

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.