Optimizing texture tag checking for three-dimensional...

Details Optimizing texture tag checking for three-dimensional... Optimizing texture tag checking for three-dimensional...

1999-02-05

2003-11-18

Razavi, Michael (Department: 2672)

Computer graphics processing and selective visual display system

Computer graphics processing

Attributes

C345S552000

Reexamination Certificate

active

06650334

ABSTRACT:

TECHNICAL FIELD OF THE INVENTION
This invention relates generally to the field of computer graphics, and more particularly, to optimizing texture tag checking for three-dimensional computer graphics.
BACKGROUND OF THE INVENTION
Many applications of modern computer graphics strive to create three-dimensional images on a display device (e.g., a computer monitor) in order to provide a realistic virtual environment. In a typical imaging technique, a three-dimensional object is created by connecting a number of two-dimensional polygons, such as, for example, triangles. Each polygon defines a surface which can be assigned or given a texture, such as wood, stone, fur, hair, scales, and the like, to enhance the realism of the generated object. Data or information for each texture can be stored in a cache memory and retrieved as necessary to produce the texture on applicable polygons. Different techniques have been developed for accessing the texture information from cache memory. These previously developed techniques, however, are problematic in that they require a relatively large number of logic operations to be performed. Furthermore, if a three-dimensional graphics system is implemented at least in part as an integrated circuit (IC) device, this requirement for a large number of logic operations necessitates large amounts of surface area and more time for processing of such IC device.
SUMMARY
According to one embodiment of the present invention, a circuit for tag checking includes a first comparison gate which compares a first dimension field of a tag with a first dimension element for a group of texels associated with a sample point. A second comparison gate compares a second dimension field of the tag with a second dimension element for the group of texels. A logic gate, coupled to each of the first and second comparison gates, is associated with one texel of the group of texels. The logic gate outputs a predetermined signal if the first and second dimension fields of the tag are the same as the first and second dimension elements, respectively.
A technical advantage of the present invention includes reducing the number of logic operations (and corresponding logic gates) required in order to perform a tag checking process. This can be accomplished, at least in part, by comparing a first dimension (e.g., u) field of a tag with a first dimension (or u) element for a group of texels associated with a sample point and, in a separate operation, comparing a second dimension (or v) field of the tag with a second dimension (or V) element for the same group of texels. Other important technical advantages are readily apparent to one skilled in the art from the following figures, descriptions, and claims.


REFERENCES:
patent: 5550960 (1996-08-01), Shirman et al.
patent: 5566285 (1996-10-01), Okada
patent: 5987567 (1999-11-01), Rivard et al.
patent: 6002410 (1999-12-01), Battle
patent: 6052127 (2000-04-01), Vaswani et al.
patent: 6104413 (2000-08-01), Cheng et al.
patent: 6118452 (2000-09-01), Gannett
“Microsoft Press Computer Dictionary”, Third Edition, 1997, pp. 214-215 and 289.

Affiliated with

Also associated with

Rating

Optimizing texture tag checking for three-dimensional... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Optimizing texture tag checking for three-dimensional..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimizing texture tag checking for three-dimensional... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3151142