| Patent application number | Description | Published |
|---|
| 20080307109 | FILE PROTOCOL FOR TRANSACTION BASED COMMUNICATION - File protocols for transaction based communication are described. In one embodiment, a method to provide a file transfer protocol includes receiving packets containing headers, the packets being received at a first network stack software through an interface, and extracting data from he packets and reconstructing a file from data in the packets. The extracting may be performed by a first network stack software, and the interface is not designed to use Internet Protocol (IP) addresses, and the headers contain data for flow control and sequencing and are associated with a port for a file transfer application, and the headers allow multiple applications to maintain multiple concurrent sessions through the interface, which may be a USB compliant or BLUETOOTH compliant interface. Systems, computer readable media, software architectures and other methods are also described. | 12-11-2008 |
| 20080320414 | EDGE ANTI-ALIASING - Methods and apparatuses for efficient edge anti-aliasing. | 12-25-2008 |
| 20090006978 | ADAPTIVE ARTWORK FOR BANDWIDTH- AND/OR MEMORY- LIMITED DEVICES - Methods and apparatuses for adaptive presentation of graphical representations. | 01-01-2009 |
| 20100211553 | METHOD AND APPARATUS FOR SIMPLIFYING THE DECODING OF DATA - The various methods and devices described herein relate to devices which, in at least certain embodiments, may include a method of decoding data or a data stream in a file, which may include checking for a first data portion of a plurality of data portions in the file, the first data portion having a first data value, reading in data from another data portion of the plurality of data portions, decoding or decompressing the data, performing a checksum operation on the decoded data if the first data portion having the first data value is not detected, and skipping a checksum operation on the decoded data if the first data portion having the first data value is detected. In the embodiment, a checksum operation on encoded data may also be skipped. In an embodiment, the first data value may include information or instructions about how a decoder may decode the data and may also include a tag or identifier. | 08-19-2010 |
| Patent application number | Description | Published |
|---|
| 20090244058 | APPARATUS AND METHOD FOR RAY TRACING WITH BLOCK FLOATING POINT DATA - Systems and methods include high throughput and/or parallelized ray/geometric shape intersection testing using intersection testing resources accepting and operating with block floating point data. Block floating point data sacrifices precision of scene location in ways that maintain precision where more beneficial, and allow reduced precision where beneficial. In particular, rays, acceleration structures, and primitives can be represented in a variety of block floating point formats, such that storage requirements for storing such data can be reduced. Hardware accelerated intersection testing can be provided with reduced sized math units, with reduced routing requirements. A driver for hardware accelerators can maintain full-precision versions of rays and primitives to allow reduced communication requirements for high throughput intersection testing in loosely coupled systems. Embodiments also can include using BFP formatted data in programmable test cells or more general purpose processing elements. | 10-01-2009 |
| 20100073369 | SYSTEMS AND METHODS FOR A RAY TRACING SHADER API - Aspects include API interfaces for interfacing shaders with other components and/or code modules that provide ray tracing functionality. For example, API calls may allow direct contribution of light energy to a buffer for an identified pixel, and allow emission of new rays for intersection testing alone or in bundles. The API also can provide a mechanism for associating arbitrary data with ray definition data defining a ray to be tested through a shader using the emit ray call. The arbitrary data is provided to a shader associated with an object that is identified subsequently as having been intersected by the ray. The data can include code, or a pointer to code, that can be used by or run after the shader. The data also can be propagated through a series of shaders, and associated with rays instantiated in each shader. | 03-25-2010 |
| 20100073370 | SYSTEMS AND METHODS FOR A RAY TRACING SHADER API - Aspects include API interfaces for interfacing shaders with other components and/or code modules that provide ray tracing functionality. For example, API calls may allow direct contribution of light energy to a buffer for an identified pixel, and allow emission of new rays for intersection testing alone or in bundles. The API also can provide a mechanism for associating arbitrary data with ray definition data defining a ray to be tested through a shader using the emit ray call. The arbitrary data is provided to a shader associated with an object that is identified subsequently as having been intersected by the ray. The data can include code, or a pointer to code, that can be used by or run after the shader. The data also can be propagated through a series of shaders, and associated with rays instantiated in each shader. Recursive shaders can be recompiled as non-recursive shaders interfacing with API semantics according to the description. | 03-25-2010 |
| 20100097372 | SYNTHETIC ACCELERATION SHAPES FOR USE IN RAY TRACING - A synthetic acceleration shape bound primitives composing a 3-D scene, and is defined using a group of fundamental shapes arranged to bound the primitives, and for which intersection results for group members yield an ultimate intersection testing result for the synthetic shape, using a logical operator. For example, two or more spheres are used to bound an object so that each of the spheres is larger than a minimum necessary to bound the object, and a volume defined by an intersection between the shapes defines a smaller volume in which the object is bounded. A ray is found to potentially intersect the object only if it intersects both spheres. In another example, an element may be defined by a volumetric union of component elements. Indicators can determine how groups of shapes should be interpreted. Synthetic shapes can be treated as a single element in a graph or hierarchical arrangement of acceleration elements. | 04-22-2010 |
| 20110032257 | DYNAMIC RAY POPULATION CONTROL - Aspects can be for ray tracing of 3-D scenes, and include dynamically controlling a population of rays being stored in a memory, to keep the population within a target, a memory footprint or other resource usage specification. An example includes controlling the population by examining indicia associated with rays returning from intersection testing, to be shaded, the indicia correlated with behavior of shaders to be run for those rays, such that population control selects, or reorders rays for shading, to prioritize shading of rays whose shaders are expected to produce fewer rays. The indicia can include a respective weight for each ray. In an example, analyzer modules examine hints associated with shaders bound to intersected primitives. Population control aspects can influence ray diversity in memory, including encouraging a varying diversity pattern as rendering of a given scene or frame progresses, based on system resource indicia, rendering metrics and so on. | 02-10-2011 |
