440 results about "Rasterisation" patented technology

The present invention relates to display of visual content on a client device using server-side rasterization of visual content. Visual content is rendered on a server system, transformed into bitmaps compatible with the display attributes of a client device, and transmitted for display on the client device. The invention allows the server to perform, in effect, as a remote browser for displaying Web pages, e-mail, e-mail attachments, electronic document and forms, database queries and results, drawings, presentations, and images at the client device. The approach is “remote” because the server does the rendering and the client provides the interface; “multi-level” because rendered visual content is represented as a multi-level set of raster representations; and constitutes a “browsing system” because the client and server share data about the source visual content element being browsed, and the client performs a specific browsing function assisted by the server.

The invention relates to a map linear symbol drawing method and a map linear symbol drawing system based on a graphics processing unit (GPU). According to the method, under a three-dimensional rendering programmable assembly line system, a shader language is used for sending a function relation between map linear symbol coloring and linear parameters to the GPU for calculation, so that map linear symbols can be drawn with high efficiency. The method comprises the following steps of establishing a vortex array caching object by taking half-linear width as a buffering region according to a linear center line, recording xyz of the position of a vortex and transverse and longitudinal coordinate relation parameters uv of the vortex on the whole buffering zone; writing a vortex shader, sending the uv parameters into a fragment shader, and performing rasterization interpolation by using the GPU; and building a function of a fragment color and the uv in the fragment shader, and calculating pixel coloring. In an actual drawing process, the vortex caching objects are bound to be property parameters for sending; global parameters required in a shader file are set; and therefore, the linear symbols can be drawn.

The processor enhanced memory module PEMM can be incorporated into the hardcopy image processing pipeline of existing printer controllers by using the smart memory model. Here the data generated from RISC based PDL interpretation or pre-rasterized data can be processed in an accelerated fashion into page bit maps, color space converted, and compressed by the PEMM. Since the DSP on the PEMM is programmable, the resolution, color space, and type of compression along with other printer specific processing can have formats other than those determined by the fixed functionality of the ASIC devices present in the pipeline.

The invention relates to a mobile-robot route planning method based on an improved genetic algorithm. A raster model is adopted to preprocess a working space of a mobile robot, in a rasterized map, an improved rapid traversing random tree is adopted to generate connections of several clusters between a start point and a target point, portions for the mobile robot to freely walk on in the working space are converted into directed acyclic graphs, and a backtracking method is adopted to generate an initial population which is abundant in diversity and has no infeasible path on the basis of the directed acyclic graphs. Three genetic operators, namely a selection operator, a crossover operator and a mutation operator, are adopted to evolve the population, wherein the selection operator uses a tournament selection strategy, the crossover operator adopts a single-point crossover strategy, and the mutation operator adopts a mutation strategy which displaces an aberrance point with an optimal point in eight-neighbor points of the aberrance point. A quadratic b-spline curve is adopted to smooth an optimal route, and finally, a smooth optimal route is generated. According to the method, the route planning capability of the mobile robot under a complex dynamic environment is effectively improved.

The invention relates to a multiple-laser radar raster map merging system based on a pilotless automobile. The multiple-laser radar raster map merging system based on the pilotless automobile comprises a one-line laser radar and a four-line laser radar, the two of which are mounted in front of the pilotless automobile, an eight-line laser radar mounted at the roof of the automobile, and a one-line laser radar mounted at the tail of the automobile; the laser radars are connected with a first industrial personal computer by use of a switch and by virtue of Ethernet; the data of the laser radar are transmitted to the first industrial personal computer by use of the switch and by virtue of the Ethernet, and the first industrial personal computer is used for analyzing and preprocessing the data; data are processed for different laser radars, respectively, and rasterization coding is performed on valid data and the coded values are transmitted to the first industrial personal computer in charge of data fusion by virtue of the Ethernet; next, data fusion is carried out by use of a raster map merging method and the rasterization coding is performed on the data, and finally, the coded values are transmitted to a second industrial personal computer by virtue of the Ethernet. The multiple-laser radar raster map merging system is used for solving the problem that the pilotless automobile and an assistant-driving automobile collide with a barrier, and therefore, the safety of the automobile in the driving process is improved.

Systems and techniques are described in which rank-1 lattices are used in computerized image processing, in particular in the context of image synthesis. These include systems and techniques for selection of rank-1 lattices, rasterization on rank-1 lattices, anti-aliasing by rank-1 lattices, and adaptive refinement and filtering by rank-1 lattices.

In a raster stage of a graphics pipeline, a method for accelerated start tile rasterization. The method includes defining a window for clipping a generated image and receiving a graphics primitive for rasterization in a raster stage of a graphics processor. A binary search related to the window is performed to determine a start tile having at least a partial coverage of the graphics primitive, wherein the start tile comprises a plurality of pixels. Based upon the start tile, the raster stage rasterizes the graphics primitive by generating a plurality of adjacent tiles having at least a partial coverage of the graphics primitive.

A system and method for accurately rendering an interactive TV application is accomplished by adjusting the contents of an on-screen buffer (OSD) to match the native physical characteristics of a target display device, preferably using fonts specific to the display device. Typically the character data is merged with graphics data and still or moving video background information and passed to the display using an analog or digital interface. Since the native resolution of the display is ideally identical to the resolution of the OSD buffer, the display device will not need to enlarge or reduce the rendering of the application. As a result, the character and graphics data will not be distorted by the display rasterizing process.

The invention provides a provision method of geographic information tile services. The method includes the steps of receiving a geographic information tile service request of a client, and analyzing the request to obtain geographic information tile related information within the request range; searching a tile meta-database according to parameters and the related information; if the tile metadata corresponding to the related information is searched, determining whether a tile is updated lately or not; if yes, packaging and returning the tile to the client; if not, performing a processing step the same as a processing step of the tile metadata not searched; specifically, searching for geographic information data corresponding to the tile according to the related information, rasterizing and cutting the geographic information data to obtain new tiles, updating the tile meta-database and an otology database according to the new tiles, packaging and returning the new tiles to the client, thus dynamically updating and timely cutting the geographic information tiles on the premise of increasing service response speed. The invention further provides a device for implementing the provision method.

Techniques are described that can delay or even prevent use of memory to store triangles associated with tiles as well as processing resources associated with vertex shading and binning triangles. The techniques can also provide better load balancing among a set of cores, and hence provide better performance. A bounding volume is generated to represent a geometry group. Culling takes place to determine whether a geometry group is to have triangles rendered. Vertex shading and association of triangles with tiles can be performed across multiple cores in parallel. Processing resources are allocated for rasterizing tiles that have been vertex shaded and binned triangles over tiles that have yet to be vertex shaded and binned triangles. Rasterization of triangles of different tiles can be performed by multiple cores in parallel.

The invention relates to a vector polygon rasterization algorithm which comprises the following steps: S1) carrying out mesh segmentation on an area to be processed, and arranging a polygon in the mesh region to generate a polygonal rasterized region and generate a line segment object array formed by edges of the polygon; S2) traversing each line segment forming the polygon, and generating edge information by utilizing the line segment object array; S3) calculating an index set of the line segments of each line of a mesh intersecting with the polygon according to the generated edge information; and S4) according to the index set of the line segments, judging internal and external properties of mesh points not on the polygon and generating a rasterization result. The highly-efficient and high-precision vector polygon rasterization algorithm supports large data volume and high-precision polygon rasterization picture application scene, and has good expansibility. Besides, the mesh range of the algorithm can also be any area range.

Methods for caching rasterized image data are provided. A representative method includes: receiving image data; searching for rasterized image data that corresponds to the image data; if the rasterized image data corresponding to the image data is not found during searching; rasterizing the image data to form rasterized information; and storing the rasterized information. Systems, devices, computer readable media and other methods are also provided.

A method and system render rasterized data by receiving non-rasterized page description language data and a corresponding transformation matrix representing transformation operations to be performed. The non-rasterized page description language data is rasterizing to create rasterized data. The corresponding transformation matrix is decomposed into a plurality of individual transformation operation matrices and a discrete transformation operation value, from a corresponding individual transformation operation matrix, is generated for each transformation operation to be performed upon the rasterized data. The transformation operations are performed upon the rasterized data based upon the generated discrete transformation operation values.

The embodiment of the invention provides a partition traversing method, a sweeping method and a floor sweeping robot. The method comprises the steps that position information in a partitioned area israsterized to form a corresponding partitioned area rasterized map; edge rasters in the rasterized map are searched; the edge rasters are the rasters which are tightly close to the edge of the partitioned area; all consecutive light segments in the partitioned area are searched in a preset searching direction; the consecutive line segments are the light segments which extend to another edge rasterin the searching direction from edge raster; the adjacent consecutive line segments are sequentially matched to form at least one communication region. The method has the advantages that a rasterizing manner is adopted and positioning information provided by an SLAM module is taken as the basis so that equipment of the floor sweeping robot and the like can well complete the task of traversing each partitioned area, and the method has a better application prospect.

The invention provides a laser point cloud-based lane line identification method and system. The method comprises the steps of generating a point cloud timestamp capable of uniquely identifying each laser point cloud point according to an azimuth angle; converting to a world coordinate system according to the pose timestamp and the relative position relationship between the laser and the world coordinate system; traversing the laser point clouds under the world coordinate system, and screening the laser point clouds according to the driving track and the heading to obtain region-of-interest point clouds; and generating a grid map according to the point coordinates of the point cloud of the region of interest and the reflection intensity of the laser point cloud. According to the method andsystem, the point clouds are grouped, each group of point clouds has a corresponding pose instead of giving a pose to each general frame of point clouds, and the precision during high-speed driving is improved. A large part of point cloud data is filtered and screened out according to actual requirements, and the lane line information is obvious through rasterization, so that the storage space and cost are reduced, and meanwhile, the probability of lane error identification in a non-interested area is greatly reduced.

The invention relates to a method for collision and occlusion detection between virtual and real objects. The method comprises: firstly, establishing a world coordinate system, and positioning a virtual three-dimensional model in a virtual model scene; secondly, using a physical depth camera to capture real environment depth images, and obtaining the position and azimuth of the physical depth camera by using an azimuth tracking system; thirdly, a computer obtaining three-dimensional orientation of the physical depth camera, defining the three-dimensional orientation as a first orientation; placing the virtual depth camera on a second orientation, and synthesizing a first synthetic depth image formed on the virtual depth camera by the virtual three-dimensional model according to the imagingmodel of the depth camera; calculating a depth value of each pixel point on the first synthetic depth image in the first orientation, to obtain a second synthetic depth image; finally, performing collision and occlusion detection and distance calculation of virtual and real objects by using the second synthetic depth image and the real environment depth image. The method is based on the depth image and rasterizes the depth image, and carries out collision and occlusion detection. The processing speed is fast and detection is accurate.

The invention discloses a Voronoi (V) and inverse distance weighting combined density map drawing method which comprises the steps that discrete point data is read; a V map is constructed by discrete points; a whole V map area is rasterized; a density value of pixels is computed according to a subordination relationship between the pixels and a V polygon and distances between a pixel center point in the V polygon and the discrete points; and all generated grids are rendered finally after subjected to neighborhood mean value smoothing processing, re-classified, and endowed with different gray-scale values in order to make results more reasonable. The V map constructed based on the discrete points is divided into generation influence ranges of the discrete points by a space constrained based on the shortest distance, and local density computation is performed within the ranges, so that the comparability and the reliability of computation results among the various influence ranges are guaranteed; and the method takes account of differences of the point density of the different pixels within the influence ranges, and a density value distribution method based on the distances is adopted in the V polygon where each point is located, so that the results are more reasonable and accurate.

The invention provides a method and a system for performing wireless signal coverage analysis. An acquisition server downloads a CHR file and analyzes the CHR file into a CHR plaintext file, extracts data field information, required for weak coverage and pilot pollution analysis by an analysis server, from the CHR plaintext file, and converts the data field information into a format which can be identified by the analysis server; the analysis server calculates the longitude and latitude of a terminal corresponding to each call record according to the CHR plaintext file and base station information; and the analysis server rasterizes a vector map, determines the position of each call terminal according to the longitude and latitude of the terminal, groups the terminals into grids, and analyzes the pilot strength, the Ec/Io and the pilot number when the call of a terminal in each grid is accessed so as to determine whether a corresponding area in the grid is a weak coverage and/or pilot pollution area or not. By adopting the method and the system of the invention, the problems of complicated artificial analysis steps, heavy workload, low efficiency, incapability of geographic display, and the like in CDR analysis work are solved.

In order to render a primitive, the primitive is subdivided into trapezoids and triangles. The subdivision occurs using scanline-aligned lines. These simple scanline-aligned regions are further subdivided so that the primitive is divided into simple scanline-boundaried trapezoids and other complex scan shapes. The simple scanline-boundaried trapezoids are rasterized. One rasterization method uses a texture map containing slope-based coverage information to edge areas. Gouraud shading may be used to provide the anti-aliasing effects on the scanline-boundaried trapezoids. The simple scanline-boundaried trapezoids may also be rasterized using a software rasterizer. Complex scans are rasterized using a software rasterizer. As data is already rasterized, it is thereby efficiently transferred to the GPU.

The invention discloses a vectorgraph rasterizing method for a digital micromirror display. A general parallel computing technique of a GPU (Graphics Processing Unit) is utilized in the process of rastering the vectorgraph. The method comprises the following specific calculation steps: 1) zooming a coordinate unit of a vectorgraph point, and dynamically adjusting a vector point coordinate unit according to the differences of different LDI (Laser Direct Imaging) model grid precisions and the actual grid precisions; 2) rasterizing the edges of the vectorgraph; extracting pixel coordinates after each edge of the vectorgraph is rasterized, and filling all pixel points, and collecting all point pixel coordinates beyond an upper top point; and 3) carrying out resorting and pair filling on the pixel points obtained in step 2). According to the vectorgraph rasterizing method provided by the invention, the vectorgraph rasterizing process can be accelerated to realize rasterizing; furthermore, the vectorgraph data can be allowed to change temporarily when the capacity is guaranteed, therefore the method has an extensive practical value and a marketing situation, and the efficiency of the overall industry can be beneficially improved.

The embodiment of the invention provides a method and device for planning a full-coverage path of a cleaning robot, and the method comprises the following steps: obtaining a map of a to-be-cleaned region, rasterizing the map, and presetting a starting point and an ending point of a path for the rasterized map; endowing each grid in the map with a preset weight according to a preset weight endowingstrategy; taking a starting point of a path in the rasterized map as a current point, taking the current point as a central point, obtaining a next point by utilizing an eight-neighborhood traversalalgorithm, taking the next point as the current point, and returning to execute the step of obtaining the next point by taking the current point as the central point and utilizing the eight-neighborhood traversal algorithm until the current point reaches the ending point; and taking a path formed by all the current points from the starting point to the ending point as a full-coverage path. By applying the embodiment of the invention, the path planning process can be simplified, and the path planning efficiency is improved.

The invention relates to a true 3D display method oriented to Google Earth and Sketch Up. The method comprises the following steps: an implanted rendering data interception technology is adopted between invoking of a 3D API of software and display by a display card to capture an original single channel color signal, a depth signal, a 3D scene transformation matrix and a projection transformation matrix; rasterized 3D data is reconstructed by parsing the information; on the basis of the stereo vision principle, the scene is re-transformed to two different viewpoint positions in a self-adapting manner, so that a binocular vision stereopair to be displayed in a 3D form is formed, and the display card is driven to output the binocular vision stereopair in a 3D form; and polarization, a pair of red and green or blinking glasses, and the like are adopted for true 3D display and observation. The invention can realize true 3D scene display of the prior software such as Google Earth and SketchUp without changing programs and operation modes.