Method and apparatus for environment-mapped bump-mapping in a graphics system

Information

  • Patent Grant
  • 7205999
  • Patent Number
    7,205,999
  • Date Filed
    Thursday, September 30, 2004
    19 years ago
  • Date Issued
    Tuesday, April 17, 2007
    17 years ago
Abstract
Apparatus and example methods for environment-mapped style of bump-mapping (EMBM) are provided that use a pre-computed bump-map texture accessed as an indirect texture along with pre-computed object surface normals (i.e., the Normal, Tangent and Binormal vectors) from each vertex of rendered polygons to effectively generate a new perturbed Normal vector per vertex. The perturbed new Normal vectors are then used to look up texels in an environment map. A specialized bump map texture data/coordinate processing “bump unit” is provided in the graphics pipeline for performing predetermined matrix multiplication operations on retrieved lookup data from the indirect-texture bump map.
Description
RELATED APPLICATIONS

This application claims the benefit of U.S. application Ser. No. 09/722,381, filed Nov. 28, 2000, and U.S. Provisional Application Ser. No. 60/226,893, filed Aug. 23, 2000, the entire contents of which are hereby incorporated by reference.


FIELD OF THE INVENTION

The present invention relates to computer graphics, and more particularly to interactive graphics systems such as home video game platforms. Still more particularly this invention relates to a method and apparatus for performing environment mapped bump-mapping in a graphics system.


BACKGROUND AND SUMMARY OF THE INVENTION

Many of us have seen films containing remarkably realistic dinosaurs, aliens, animated toys and other fanciful creatures. Such animations are made possible by computer graphics. Using such techniques, a computer graphics artist can specify how each object should look and how it should change in appearance over time, and a computer then models the objects and displays them on a display such as your television or a computer screen. The computer takes care of performing the many tasks required to make sure that each part of the displayed image is colored and shaped just right based on the position and orientation of each object in a scene, the direction in which light seems to strike each object, the surface texture of each object, and other factors.


Because computer graphics generation is complex, computer-generated three-dimensional graphics just a few years ago were mostly limited to expensive specialized flight simulators, high-end graphics workstations and supercomputers. The public saw some of the images generated by these computer systems in movies and expensive television advertisements, but most of us couldn't actually interact with the computers doing the graphics generation. All this has changed with the availability of relatively inexpensive 3D graphics platforms such as, for example, the Nintendo 64® and various 3D graphics cards now available for personal computers. It is now possible to interact with exciting 3D animations and simulations on relatively inexpensive computer graphics systems in your home or office.


One problem graphics system designers confronted in the past was how to create realistic looking surface detail on a rendered object without resorting to explicit modeling of the desired details with polygons or other geometric primitives. Although surface details can be simulated, for example, using myriad small triangles with interpolated shading between vertices, as the desired detail becomes finer and more intricate, explicit modeling with triangles or other primitives places high demands on the graphics system and becomes less practical. An alternative technique pioneered by E. Catmull and refined by J. F. Blinn and M. E. Newell is to “map” an image, either digitized or synthesized, onto a surface. (See “A Subdivision Algorithm for Computer Display of Curved Surfaces” by E. Catmull, Ph.D. Thesis, Report UTEC-CSc-74-133, Computer Science Department, University of Utah, Salt Lake City, Utah, December 1994 and “Texture and Reflection in Computer Generated Images” by J. F. Blinn and M. E. Newell, CACM, 19(10), October 1976, 452–457). This approach is known as texture mapping (or pattern mapping) and the image is called a texture map (or simply referred to as a texture). Alternatively, the texture map may be defined by a procedure rather than an image.


Typically, the texture map is defined within a 2D rectangular coordinate space and parameterized using a pair of orthogonal texture coordinates such, as for example, (u, v) or (s, t). Individual elements within the texture map are often called texels. At each rendered pixel, selected texels are used either to substitute for or to scale one or more material properties of the rendered object surface. This process is often referred to as texture mapping or “texturing.”


Although most 3-D graphics rendering systems now include a texturing subsystem for retrieving textures from memory and mapping the textures onto a rendered object surface, another problem confronting graphics system designers is how to texture a 3D object with realistic-looking surface characteristics that react to various lighting conditions in a manner similar to the surface of an actual object having, for example, random surface flaws, irregularities, roughness, bumps or other slight non-planar surface variations. Regular texture mapping does not provide such realism because texture images are generally two-dimensional and can not react or change in appearance in response to changes in position or direction of the lighting within a rendered scene. While in some instances such minute surface characteristics might be actually modeled, the time required for translating and rendering a 3D object with such a complex surface would be prohibitive for most real-time or interactive gaming applications. Consequently, various solutions to this problem were offered. For example, a technique generally known as “bump-mapping” was developed which allowed one to approximate the effect that non-planar surface variations would produce on lighted object. See, for example, J. F. Blinn “Simulation of Wrinkled Surfaces” Computer Graphics, (SIGRAPH '78 Proceedings), vol. 12, No. 3, pp. 286–292 (August 1978) and “Models of Light Reflection for Computer Synthesized Pictures”, Proc. 4th Conference on Computer Graphics and Instructive Techniques, 1977.


Basically, bump-mapping allows a graphics application programmer to add realism to the surface of an object without using a lot of geometry by modeling small surface variations as height differences and then applying those difference values over a surface as perturbations to a surface Normal vector used in computing surface lighting effects. Effectively, a bump-map modifies the shading of a polygon (or primitive) by perturbing the surface Normal on a per-pixel basis. The shading makes the surface appear bumpy, even though the underlying geometry is relatively flat.


Although conventional bump-mapping techniques offer some improvement, a further problem confronting graphics system designers is that conventional approaches to simple forms of bump-mapping, such as the “emboss”-style of bump mapping, typically only consider the interaction between a bump map and a single diffuse light source. Moreover, in many cases, the bump map is inconveniently “tied” to a specific geometric shape in the sense that it should be constructed (i.e., parameterized) for an object having a particular surface geometry and only works well for geometrically similar surfaces. In addition, if the object is rotated, the bump map will not apply to the entire surface (e.g., newly visible surface regions after rotation).


Another known technique for providing realistic looking surface on a rendered object uses a method called “environment mapping”. Environment mapping (EM), also called “reflection mapping”, is a simple yet powerful method of generating approximations of reflections in curved surfaces. This technique was introduced by Blinn and Newell, “Texture and Reflection In Computer Generated Images,” Communications of the ACM, Vol. 19, no. 10, pp. 542–547 (October 1976). Conventionally, methods start with a ray from the viewer to a point on the reflector. This ray is then reflected with respect to the normal at that point. Instead of finding the intersection with the closest surface, as is done in ray tracing processes, EM uses the direction of the reflection vector as an index to an image containing the environment. The environment mapping approximation assumes that the objects and lights being reflected with EM are far away, and that the reflector will not reflect itself. If these assumptions hold, then the environment around the reflector can be treated as a two-dimensional projection surrounding it.


The basic steps for environment mapping are as follows:

    • Generate a two-dimensional image of the environment (this is the environmental map).
    • For each pixel that contains a reflective object, compute the normal at the location on the surface of the object (if per-pixel EM is not available, then the normal is computed at polygon vertices).
    • Compute the reflection vector from the view vector and the normal.
    • Use the reflection vector to compute an index into the environment map that represents the objects in the reflection direction.
    • Use the data from the environment map to color the current pixel.


In addition, there are a variety of known “projector” functions that may be used to map the reflection vector into one or more textures. Blinn and Newell's algorithm and Grene's cubic environment mapping technique are classic mapping methods, although a sphere map is also commonly used.


While much work has been done in the past, further improvements are possible and desirable.


The present invention improves on prior techniques by providing an apparatus and example procedures for performing an environment-mapped bump-mapping (EMBM). In accordance with one aspect provided by this invention, environment mapped bump mapping in a graphics system is performed by generating texture coordinates from parameters of a surface; bump mapping to perturb the texture coordinates; environment mapping based on the perturbed texture coordinates; and displaying an image obtained from the environment mapping. The bump mapping may model surface perturbations using a three-dimensional model in modeling space, or it may model the surface perturbations in two dimensions in eye-space. These different modeling techniques provide different advantages and features.


In more detail, one environment mapped bump mapping technique uses a bump map to model surface perturbations in three dimensions. The output of the bump mapping operation is provided to a matrix multiplication operation that allows rotation in any direction. The resulting rotated values are combined with Normal vector values for environment mapping.


In another embodiment, the bump map models surface perturbations in two dimensions using partial derivatives. The bump map output is combined with Normal vector partial derivatives using a sum-of-product calculation to provide texture coordinates for environment mapping. The inverse of the transformation matrix is used for geometric transformations to transform the Normal vector partial derivatives.


In more detail, a first example EMBM procedure is provided that permits very fast processing of object surface Normal perturbations modeled in 3D (dXdYdZ) for specific object surface geometries using a pre-computed bump map stored in memory as a texture. A second example EMBM procedure is provided for Normal perturbations modeled with respect to a flat surface (dSdT) which frees the bump map from use with a particular surface geometry and allows it to be applied with environment mapping/lighting to a variety of different rendered object shapes.


The EMBM method provided by an aspect of the present invention uses a pre-constructed bump-map texture accessed as an indirect texture along with pre-computed object surface normals (i.e., the Normal, Tangent and Binormal vectors) from each vertex of rendered polygons to effectively generate a new perturbed Normal vector per vertex. The new perturbed Normal vectors are then used to look up an environment texture map. For example, the environment texture map may be a spherical reflection map of an environment surrounding a rendered object or a texture map containing lighting or other data for creating more complex surface lighting effects.


The example embodiment provides a specialized texture data/coordinate processing “bump unit” in the graphics pipeline for performing predetermined matrix multiplication operations (e.g., modeling-space to eye-space conversions) on retrieved lookup data from the indirect-texture bump map. The bump unit (e.g., see FIG. 15) uses a programmable 3×2 element multiplication matrix (M) and scaling circuits that also permits rotation of bump-mapped objects about multiple orthogonal axes. The bump unit is also provided with an output storage buffer (530) for reusing computed coordinate data output values in subsequent processing cycles.


In accordance with a further aspect provided by the invention, object surface Normal perturbations for one or more specific surface geometries are modeled in 3D using a pre-computed dXdYdZ bump map stored in memory as a texture prior to running a particular graphics application (i.e., texel values within an individual bump-map specify surface Normal vector offsets per vertex in 3D model space). A texturing pipeline implemented in hardware then performs an environment-mapped bump-mapped dXdYdZ texture lookup. In the disclosed example embodiment, this is implemented using an indirect texture look-up to obtain the dXdYdZ bump map data to compute a perturbed texture coordinate for lookup into, for example, a spherical reflection environment map. At runtime, the graphics application matches an object having a particular surface geometry with the pre-computed dXdYdZ bump-map texture for that geometry and accesses the bump-map as an “indirect” texture.


A programmable 3×2 multiplication matrix can be implemented by bump unit hardware to provide improved versatility when rendering and displaying such dXdYdZ bump-mapped objects. For example, the matrix may be programmably loaded with appropriate transform constants for allowing conversion of texture coordinate components to eye-space or dynamically loaded with texture coordinates for implementing dXdYdZ bump-mapped texturing while rotating an object about two or more orthogonal axes. The dXdYdZ bump-map indirect look-up data is then used along with per vertex Normal-generated texture coordinate components to compute the perturbed texture coordinates for the look-up into an environment map.


Although the dXdYdZ bump-map textures are custom parameterized for individual surface geometries and, consequently, are effectively “tied” to the particular object for which they were designed, this approach to EMBM is advantageous in that processing is very fast, requiring only a single texture coordinate processing stage corresponding to a single shading/color-blending stage. Moreover, in a preferred implementation of the present invention, the bump-mapped objects may be dynamically rotated about at least two orthogonal axes without disruption to the bump-mapped effect on the object surface.


In accordance with another aspect provided by the invention, object surface Normal perturbations are initially modeled with respect to a flat surface, then during application runtime, the Normal perturbations may be mapped to a rendered object surface having a different or arbitrary geometric configuration. A pre-computed bump dSdT map containing partial derivative data is stored in memory as a 2D texture and subsequently accessed as an “indirect” texture. The pre-computed dSdT bump map data may be derived, for example, by forward differencing the data from a conventional paint program 2D or other image. Basically, Normal, Tangent and Binormal vectors, which are specified per vertex as polygon vertex attributes of a modeled 3D object surface, are first rotated (transformed) into view-space (eye-space/camera-space) and then used along with the precomputed bump map data to compute a perturbed Normal for each vertex. The perturbed Normal is then used to look up a light or environment map. In other words, Binormal- and Tangent-generated texture coordinate components are scaled (multiplied) by the pre-computed partial derivative dSdT bump map data (stored as an indirect texture) and then are combined with Normal vector generated texture coordinate components over several cycles/stages. The resulting computed texture coordinates correspond to an appropriately perturbed Normal vector, which is then used to look-up a light or environment map.





BRIEF DESCRIPTION OF THE DRAWINGS

These and other features and advantages provided by the invention will be better and more completely understood by referring to the following detailed description of presently preferred embodiments in conjunction with the drawings, of which:



FIG. 1 is an overall view of an example interactive computer graphics system;



FIG. 2 is a block diagram of the FIG. 1 example computer graphics system;



FIG. 3 is a block diagram of the example graphics and audio processor shown in FIG. 2;



FIG. 4 is a block diagram of the example 3D graphics processor shown in FIG. 3;



FIG. 5 is an example logical flow diagram of the FIG. 4 graphics processor;



FIG. 6 is block diagram illustrating a logical overview of indirect texture processing in accordance with the present invention;



FIG. 7A is a functional block diagram illustrating a simple basic example of a regular (non-indirect) texture lookup;



FIG. 7B is a functional block diagram illustrating a simple basic example of an indirect texture lookup in accordance with the present invention;



FIG. 8 is a block diagram illustrating an overview of an example physical configuration for indirect texture processing in accordance with the present invention;



FIG. 9 is a block diagram illustrating a logical overview of the texture address (coordinate/data) processor operation;



FIGS. 10A–10K are a series of block diagrams illustrating the relative progression of pixel direct coordinate data and pixel indirect texture data in the example texturing pipeline implementation as a result of interleaved direct and indirect texture processing;



FIG. 11 is a flow chart illustrating example steps for implementing indirect texture processing in accordance with the present invention;



FIG. 12 is a functional operations diagram illustrating an example of regular (non-indirect) texture processing in accordance with the present invention;



FIG. 13 is a functional operations diagram illustrating an example of both regular (non-indirect) and indirect texture processing in accordance with the present invention;



FIG. 14 is a block diagram showing a detailed example of the texture coordinate/bump processing unit shown in FIG. 5;



FIG. 15 is a block diagram showing a detailed example of the indirect texture lookup data/coordinate processing logic (proc) shown in FIG. 14;



FIGS. 16A and 16B show example texture offset matrices used by processing logic circuit (proc) of FIG. 15;



FIG. 17 is a block diagram illustrating example data field formats of control logic registers for controlling the operations within the processing circuitry of FIG. 15;



FIG. 18 shows an example environment mapped bump mapping process;



FIG. 19 is a logical block diagram illustrating an example process of environment-mapped bump mapping using Normal vector perturbations modeled in 3D (dXdYdZ);



FIG. 20 is a simplified flat surface environment mapped bump mapping;



FIG. 21 shows an example flat surface bump map texture;



FIG. 22 shows an example flat surface bump map;



FIG. 23 a logical block diagram illustrating a simplified example of bump mapping for the flat surface (dSdT) embodiment;



FIG. 24 is a logical block diagram illustrating an example process of environment-mapped bump mapping using Normal vector perturbations modeled with respect to a flat surface (dSdT);



FIG. 25 shows an example process for environment mapped bump mapping modeled using the flat surface (dSdT) approach;



FIG. 26 is a flowchart of example steps performed for implementing the FIG. 24 embodiment;



FIG. 27 is a more detailed flowchart of example steps for implementing the FIG. 24 embodiment; and



FIGS. 28 and 29 show example alternative compatible implementations.





DETAILED DESCRIPTION OF EXAMPLE EMBODIMENTS OF THE INVENTION


FIG. 1 shows an example interactive 3D computer graphics system 50. System 50 can be used to play interactive 3D video games with interesting stereo sound. It can also be used for a variety of other applications.


In this example, system 50 is capable of processing, interactively in real time, a digital representation or model of a three-dimensional world. System 50 can display some or all of the world from any arbitrary viewpoint. For example, system 50 can interactively change the viewpoint in response to real time inputs from handheld controllers 52a, 52b or other input devices. This allows the game player to see the world through the eyes of someone within or outside of the world. System 50 can be used for applications that do not require real time 3D interactive display (e.g., 2D display generation and/or non-interactive display), but the capability of displaying quality 3D images very quickly can be used to create very realistic and exciting game play or other graphical interactions.


To play a video game or other application using system 50, the user first connects a main unit 54 to his or her color television set 56 or other display device by connecting a cable 58 between the two. Main unit 54 produces both video signals and audio signals for controlling color television set 56. The video signals are what controls the images displayed on the television screen 59, and the audio signals are played back as sound through television stereo loudspeakers 61L, 61R.


The user also needs to connect main unit 54 to a power source. This power source may be a conventional AC adapter (not shown) that plugs into a standard home electrical wall socket and converts the house current into a lower DC voltage signal suitable for powering the main unit 54. Batteries could be used in other implementations.


The user may use hand controllers 52a, 52b to control main unit 54. Controls 60 can be used, for example, to specify the direction (up or down, left or right, closer or further away) that a character displayed on television 56 should move within a 3D world. Controls 60 also provide input for other applications (e.g., menu selection, pointer/cursor control, etc.). Controllers 52 can take a variety of forms. In this example, controllers 52 shown each include controls 60 such as joysticks, push buttons and/or directional switches. Controllers 52 may be connected to main unit 54 by cables or wirelessly via electromagnetic (e.g., radio or infrared) waves.


To play an application such as a game, the user selects an appropriate storage medium 62 storing the video game or other application he or she wants to play, and inserts that storage medium into a slot 64 in main unit 54. Storage medium 62 may, for example, be a specially encoded and/or encrypted optical and/or magnetic disk. The user may operate a power switch 66 to turn on main unit 54 and cause the main unit to begin running the video game or other application based on the software stored in the storage medium 62. The user may operate controllers 52 to provide inputs to main unit 54. For example, operating a control 60 may cause the game or other application to start. Moving other controls 60 can cause animated characters to move in different directions or change the user's point of view in a 3D world. Depending upon the particular software stored within the storage medium 62, the various controls 60 on the controller 52 can perform different functions at different times.


Example Electronics of Overall System



FIG. 2 shows a block diagram of example components of system 50. The primary components include:


a main processor (CPU) 110,


a main memory 112, and


a graphics and audio processor 114.


In this example, main processor 110 (e.g., an enhanced IBM Power PC 750) receives inputs from handheld controllers 108 (and/or other input devices) via graphics and audio processor 114. Main processor 110 interactively responds to user inputs, and executes a video game or other program supplied, for example, by external storage media 62 via a mass storage access device 106 such as an optical disk drive. As one example, in the context of video game play, main processor 110 can perform collision detection and animation processing in addition to a variety of interactive and control functions.


In this example, main processor 110 generates 3D graphics and audio commands and sends them to graphics and audio processor 114. The graphics and audio processor 114 processes these commands to generate interesting visual images on display 59 and interesting stereo sound on stereo loudspeakers 61R, 61L or other suitable sound-generating devices.


Example system 50 includes a video encoder 120 that receives image signals from graphics and audio processor 114 and converts the image signals into analog and/or digital video signals suitable for display on a standard display device such as a computer monitor or home color television set 56. System 50 also includes an audio codec (compressor/decompressor) 122 that compresses and decompresses digitized audio signals and may also convert between digital and analog audio signaling formats as needed. Audio codec 122 can receive audio inputs via a buffer 124 and provide them to graphics and audio processor 114 for processing (e.g., mixing with other audio signals the processor generates and/or receives via a streaming audio output of mass storage access device 106). Graphics and audio processor 114 in this example can store audio related information in an audio memory 126 that is available for audio tasks. Graphics and audio processor 114 provides the resulting audio output signals to audio codec 122 for decompression and conversion to analog signals (e.g., via buffer amplifiers 128L, 128R) so they can be reproduced by loudspeakers 61L, 61R.


Graphics and audio processor 114 has the ability to communicate with various additional devices that may be present within system 50. For example, a parallel digital bus 130 may be used to communicate with mass storage access device 106 and/or other components. A serial peripheral bus 132 may communicate with a variety of peripheral or other devices including, for example:

    • a programmable read-only memory and/or real time clock 134,
    • a modem 136 or other networking interface (which may in turn connect system 50 to a telecommunications network 138 such as the Internet or other digital network from/to which program instructions and/or data can be downloaded or uploaded), and
    • flash memory 140.


      A further external serial bus 142 may be used to communicate with additional expansion memory 144 (e.g., a memory card) or other devices. Connectors may be used to connect various devices to busses 130, 132, 142.


      Example Graphics And Audio Processor



FIG. 3 is a block diagram of an example graphics and audio processor 114. Graphics and audio processor 114 in one example may be a single-chip ASIC (application specific integrated circuit). In this example, graphics and audio processor 114 includes:


a processor interface 150,


a memory interface/controller 152,


a 3D graphics processor 154,


an audio digital signal processor (DSP) 156,


an audio memory interface 158,


an audio interface and mixer 160,


a peripheral controller 162, and


a display controller 164.


3D graphics processor 154 performs graphics processing tasks. Audio digital signal processor 156 performs audio processing tasks. Display controller 164 accesses image information from main memory 112 and provides it to video encoder 120 for display on display device 56. Audio interface and mixer 160 interfaces with audio codec 122, and can also mix audio from different sources (e.g., streaming audio from mass storage access device 106, the output of audio DSP 156, and external audio input received via audio codec 122). Processor interface 150 provides a data and control interface between main processor 110 and graphics and audio processor 114.


Memory interface 152 provides a data and control interface between graphics and audio processor 114 and memory 112. In this example, main processor 110 accesses main memory 112 via processor interface 150 and memory interface 152 that are part of graphics and audio processor 114. Peripheral controller 162 provides a data and control interface between graphics and audio processor 114 and the various peripherals mentioned above. Audio memory interface 158 provides an interface with audio memory 126.


Example Graphics Pipeline



FIG. 4 shows a more detailed view of an example 3D graphics processor 154. 3D graphics processor 154 includes, among other things, a command processor 200 and a 3D graphics pipeline 180. Main processor 110 communicates streams of data (e.g., graphics command streams and display lists) to command processor 200. Main processor 110 has a two-level cache 115 to minimize memory latency, and also has a write-gathering buffer 111 for uncached data streams targeted for the graphics and audio processor 114. The write-gathering buffer 111 collects partial cache lines into full cache lines and sends the data out to the graphics and audio processor 114 one cache line at a time for maximum bus usage.


Command processor 200 receives display commands from main processor 110 and parses them—obtaining any additional data necessary to process them from shared memory 112. The command processor 200 provides a stream of vertex commands to graphics pipeline 180 for 2D and/or 3D processing and rendering. Graphics pipeline 180 generates images based on these commands. The resulting image information may be transferred to main memory 112 for access by display controller/video interface unit 164—which displays the frame buffer output of pipeline 180 on display 56.



FIG. 5 is a logical flow diagram of graphics processor 154. Main processor 110 may store graphics command streams 210, display lists 212 and vertex arrays 214 in main memory 112, and pass pointers to command processor 200 via bus interface 150. The main processor 110 stores graphics commands in one or more graphics first-in-first-out (FIFO) buffers 210 it allocates in main memory 110. The command processor 200 fetches:

    • command streams from main memory 112 via an on-chip FIFO memory buffer 216 that receives and buffers the graphics commands for synchronization/flow control and load balancing,
    • display lists 212 from main memory 112 via an on-chip call FIFO memory buffer 218, and
    • vertex attributes from the command stream and/or from vertex arrays 214 in main memory 112 via a vertex cache 220.


Command processor 200 performs command processing operations 200a that convert attribute types to floating point format, and pass the resulting complete vertex polygon data to graphics pipeline 180 for rendering/rasterization. A programmable memory arbitration circuitry 130 (see FIG. 4) arbitrates access to shared main memory 112 between graphics pipeline 180, command processor 200 and display controller/video interface unit 164.



FIG. 4 shows that graphics pipeline 180 may include:

    • a transform unit 300,
    • a setup/rasterizer 400,
    • a texture unit 500,
    • a texture environment unit 600, and
    • a pixel engine 700.


Transform unit 300 performs a variety of 2D and 3D transform and other operations 300a (see FIG. 5). Transform unit 300 may include one or more matrix memories 300b for storing matrices used in transformation processing 300a. Transform unit 300 transforms incoming geometry per vertex from object space to screen space; and transforms incoming texture coordinates and computes projective texture coordinates (300c). Transform unit 300 may also perform polygon clipping/culling 300d. Lighting processing 300e also performed by transform unit 300b provides per vertex lighting computations for up to eight independent lights in one example embodiment. Transform unit 300 can also perform texture coordinate generation (300c) for embossed type bump mapping effects, as well as polygon clipping/culling operations (300d).


Setup/rasterizer 400 includes a setup unit which receives vertex data from transform unit 300 and sends triangle setup information to one or more rasterizer units (400b) performing edge rasterization, texture coordinate rasterization and color rasterization.


Texture unit 500 (which may include an on-chip texture memory (TMEM) 502) performs various tasks related to texturing including for example:

    • retrieving textures 504 from main memory 112,
    • texture processing (500a) including, for example, multi-texture handling, post-cache texture decompression, texture filtering, embossing, shadows and lighting through the use of projective textures, and BLIT with alpha transparency and depth,
    • bump map processing for computing texture coordinate displacements for bump mapping, pseudo texture and texture tiling effects (500b), and
    • indirect texture processing (500c).



FIGS. 6 through 17 illustrate example texture processing for performing regular (non-indirect) and indirect texture lookup operations. A more detailed description of the example graphics pipeline circuitry and procedures for performing regular and indirect texture look-up operations is disclosed in commonly assigned co-pending patent application Ser. No. 09/722,382, entitled “Method And Apparatus For Direct And Indirect Texture Processing In A Graphics System” and its corresponding provisional application Ser. No. 60/226,891, filed Aug. 23, 2000, both of which are incorporated herein by reference.


Texture unit 500 outputs filtered texture values to the texture environment unit 600 for texture environment processing (600a). Texture environment unit 600 blends polygon and texture color/alpha/depth, and can also perform texture fog processing (600b) to achieve inverse range based fog effects. Texture environment unit 600 can provide multiple stages to perform a variety of other interesting environment-related functions based for example on color/alpha modulation, embossing, detail texturing, texture swapping, clamping, and depth blending. Texture environment unit 600 can also combine (e.g., subtract) textures in hardware in one pass. For more details concerning the texture environment unit 600, see commonly assigned application Ser. No. 09/722,367 entitled “Recirculating Shade Tree Blender for a Graphics System” and its corresponding provisional application Ser. No. 60/226,888, filed Aug. 23, 2000, both of which are incorporated herein by reference.


Pixel engine 700 performs depth (z) compare (700a) and pixel blending (700b). In this example, pixel engine 700 stores data into an embedded (on-chip) frame buffer memory 702. Graphics pipeline 180 may include one or more embedded DRAM memories 702 to store frame buffer and/or texture information locally. Z compares 700a′ can also be performed at an earlier stage in the graphics pipeline 180 depending on the rendering mode currently in effect (e.g., z compares can be performed earlier if alpha blending is not required). The pixel engine 700 includes a copy operation 700c that periodically writes on-chip frame buffer 702 to main memory 112 for access by display/video interface unit 164. This copy operation 700c can also be used to copy embedded frame buffer 702 contents to textures in the main memory 112 for dynamic texture synthesis effects. Anti-aliasing and other filtering can be performed during the copy-out operation. The frame buffer output of graphics pipeline 180 (which is ultimately stored in main memory 112) is read each frame by display/video interface unit 164. Display controller/video interface 164 provides digital RGB pixel values for display on display 102.


Example Environment-Mapped Bump Mapping Procedures



FIG. 18 shows an example general environment mapped bump-mapping procedure. At a high level of abstraction, the preferred implementation of the environment-mapped bump mapping procedure of the present invention generates texture coordinates from surface parameters such as the surface Normal and binormals (e.g., Normal and/or Tangent and Binormal vectors) (Block 1400A). These surface parameters can be provided by transform unit 300 based on lighting calculations or by main processor 110, for example.


Texture coordinates are generated based on the surface parameters, and an indirect bump map texture is used to offset (perturb) the resulting texture coordinates (block 1400B). The perturbed texture coordinates are then used to look up an environment texture map (block 1400C). The environment texture map may contain complicated lighting effects, or it may be, for example, a spherical reflection map of the environment or any other desired environment map or maps. The resulting image may then be further processed and displayed (block 1400D).


Environment-mapped bump mapping (EMBM) in accordance with the present invention is accomplished in a preferred implementation through the use of indirect texture processing as described in the above reference copending patent application. This allows multiple texture lookups in a single rendering pass using low cost hardware.


There are at least two ways to model surface perturbations in a bump map in the example described above. One way is to use a three-dimensional model (e.g., a sphere, toroid, etc.) that matches (or closely approximates) the surface geometry of the 3D object being mapped. In this approach, a bump map of the three-dimensional model of the object describes height differences in three dimensions (x, y, z) relative to the surface being mapped. These differences in three dimensions (which may be represented by partial derivatives in each of the three coordinates corresponding to s, t, u texture coordinates) can be converted into eye space, translated (e.g., in the case of object rotation)—and then used to perturb texture coordinates generated in the conventional fashion from a surface Normal to provide new texture coordinates for Gouraud-shaded bump mapping.


Another way is to model surface perturbations in a bump map is to use a two-dimensional (i.e., flat surface) model. In this approach, the model need not correspond precisely to the surface geometry of the 3D object being mapped. A bump map of the two-dimensional model can describe height differences in two dimensions (x, y) relative to the surface being mapped. These height differences in two dimensions, which can be represented by partial derivatives in x and y, may be stored in a texture memory as partial derivatives (dSdT) and accessed using s and t texture coordinates. These partial derivatives may then be used to scale texture mapping coordinates generated from the surface binormals (i.e., the Tangent and Binormal vectors) and those values and the texture coordinates generated from the surface Normal vector are combined to produce perturbed Normal vector texture coordinates for Gouraud-shaded bump mapping.


In the first example implementation, Normal vector perturbations are modeled in 3D (dXdYdZ) with respect to a particular geometric shape (e.g., sphere, toroid, etc.) and, during application program run-time, are matched to corresponding similar geometric surfaces and transformed into eye-space. This method has the advantage that it renders bump-mapped images very quickly because it requires few coordinate processing stages to compute. In the second example implementation, perturbations of the Normal are modeled with respect to a flat surface (dSdT) and during run time may be mapped onto arbitrary object surfaces. This second method of implementation is more versatile but requires more coordinate processing stages and additional binormal surface vector information to calculate the perturbed Normal texture coordinates (see, for example, the above referenced copending application regarding coordinate processing and TEV stages for performing indirect texture referencing operations).


Environment-Mapped Bump-Mapping Based on Perturbations Modeled in 3D (dXdYdZ):



FIG. 19 shows a logical block diagram illustrating an example process of environment-mapped bump mapping using Normal vector perturbations modeled in 3D (dXdYdZ). In one preferred example embodiment, environment mapping can be performed using a spherical reflection map. The environment-mapped bump-mapped dXdYdZ texture lookup that is performed is analogous to a perturbed Normal lookup into a spherical reflection map. (As an “indirect” operation, this is analogous to a texture warp operation using signed offsets.) Normal vector perturbations for environment mapped bump mapping are computed on a per-vertex basis. In this example, the indirect bump map 1401 contains precomputed Normal vector offsets in 3D model space (i.e., object space). A surface Normal vector at a vertex is initially rotated (i.e., converted) to eye-space. Texture coordinate data generated from the x and y eye-space components of the converted Normal vector are then scaled (multiplied) by offsets (i.e., partial derivative data dF/dx, dF/dy) obtained from the dXdYdZ bump map texture to generate a new set of Normal texture coordinates (i.e., perturbated texture coordinates n′x and n′y) for performing a texture lookup to an environment or light map.


As indicated in the logical diagram of FIG. 19, an indirect texture lookup operation is performed using indirect coordinate s0, to and direct texture look-up is performed using coordinates s1, t1. As a result of the indirect texture look-up, offset data s, t and u (1402) is retrieved from the dXdYdZ bump map 1401 via, for example, the multi-bit R, G and B color channel lines over col bus 519 (FIG. 15). In this example, only the s and t offset data, corresponding to the partial derivatives dF/dx and dF/dy of the bump function F, is used in computing the perturbed normal component texture coordinates. During the next coordinate processing cycle/stage, texture coordinate input values s1, t1 (1403), generated from surface Normal vector components (i.e., nx and ny), are scaled (multiplied) by the retrieved s and t offset data 1402. For this example, the nx and ny (s1 and t1) input data is provided in the same manner as regular (non-indirect coordinates) to the bump processing unit 512 and is loaded into matrix M (1404) for multiplication by partial derivative offset data V (1405) from the indirect texture lookup. The resulting scaled coordinate products, n′x (1406) and n′y (1407), provide the effect of a perturbed normal and are used to perform an environment map lookup 1408. For the above example implementation, the 3×2 matrix M in bump processing unit 512 (FIG. 15) may be loaded with the appropriate matrix elements for effecting a transform from model space to eye-space and, if desired, rotation of the bump-mapped object about any of plural axes. The application program should set up a Normal-based-texture coordinate generation (i.e., an API texgen function) for the regular (non-indirect) coordinates s1 and t1.


Environment-Mapped Bump-Mapping Based on Perturbations Modeled with Respect to a Flat Surface (dSdT):



FIG. 20 shows an example simplified flat surface environment mapped bump mapping operation. In this example, texture coordinates s and t, corresponding to a position on the surface being mapped are used to perform an indirect texture lookup 1410. The indirect texture specifies db/ds, db/dt partial derivatives representing height differences defined by a bump map function. These partial derivatives may be outputted by texture unit 500 via, for example, multibit red (R) and green (G) color channel lines over col bus 514 (FIG. 15). FIG. 21 shows an example bump map texture providing such partial derivatives, and FIG. 22 illustrates a corresponding bump map function.


The partial derivatives provided by the indirect texture lookup are supplied to bump unit 500b. FIG. 23 shows a simplified example of what bump unit 500b effectively accomplishes using these partial derivatives. Effectively, Bump unit 500b multiplies the object surface binormals (actually texture coordinates generated from the binormals) by the partial derivatives and then sums the results, i.e.:


(b0*db/ds)+(b1*db/dt), where b0 and b1 are the object surface binormals (i.e., Tangent and Bionormal vectors). Bump unit 500b then uses this result to effectively perturb the surface Normal (e.g., by summing). The resulting perturbed normal (actually perturbed texture coordinates) is then used for environment mapping 1434.



FIG. 24 is a more detailed logical block diagram illustrating an example method of environment-mapped bump mapping using Normal vector perturbations modeled with respect to a flat surface (dSdT). In one example embodiment, the environment mapping is performed using a spherical reflection map. The environment mapped bump mapping dSdT texture lookup that is performed is analogous to a perturbed Normal lookup into the spherical reflection map. The Normal vector coordinate perturbations are computed on a per-vertex basis. These perturbations are based on the Tangent, Binormal and Normal vector generated texture coordinates (s2, t2), (s3, t3), (s4, t4) and partial derivative information obtained from an indirect texture bump map. For this implementation, the indirect bump map 1410 contains precomputed deltas for S and T (i.e., partial derivative information offsets), modeled with respect to a flat surface (dSdT). The surface Normal, Binormal and Tangent vectors per-vertex are rotated to eye-space and texture coordinates (s2, t2) 1412, (S3, t3) 1414, and (S4, t4) 1416 are generated from the x and y eye-space components of each vector ((Tx, Ty), (Bx, By), (Nx, Ny)). The Tangent and Binormal generated texture coordinates (s2, t2) 1412 and (s2, t3) 1414 are scaled (multiplied) (1413, 1415) by pre-computed partial derivative offsets (Fu, Fv) (1417) retrieved during an indirect texture lookup to indirect texture bump map 1410. Resulting x-component coordinate products Fu Bx (1418) and EvTx) (1420) are combined (added) (1430) with x-component coordinate, Nx (1422), to provide a perturbed Normal x-component texture coordinate n′x. Likewise, the resulting y-component coordinate products FvTy(1424) and FuBy (1426) are combined (1432) with the y-component coordinate, Ny (1428) to provide a perturbed Normal y-component texture coordinate n′y. The two perturbed Normal texture offset coordinates n′x and n′y are then used in performing a regular (non-indirect) texture lookup into one or more texture environment or light maps (1434).



FIG. 25 shows example steps for performing environment mapped bump mapping using a flat surface model. In this example, a first stage looks up the bump map (block 1502). Second and third stages process the binormals (blocks 1504, 1506). A fourth stage processes the Normal and looks up light map 0 (for example, specular lighting) (block 1508). A fifth stage looks up light map 1 (for example, diffuse lighting) (block 1510). It is not necessary to have two light maps—different numbers of light maps could be used if desired.



FIG. 26 is a flowchart showing this overall procedure in one example implementation. Block 1440 creates or provides the bump map and environment light maps, and generates the partial derivatives (which may be dynamically calculated by the application running on main processor 110) for storing into an indirect texture.


Block 1441 supplies the Normal, Binormal and Tangent vectors per vertex (this can be performed by transform unit 300). In one example embodiment, these values can be separately indexed per vertex to compress the amount of data needed for bump mapping. All of the vectors can share one base pointer.


Block 1441 also can rotate the vectors to eye space, and provides x and y coordinates. This can be done by setting up a Normal-based texture generation for the regular (non-indirect) texture coordinates (s2, t2) (s3, t3), (s4, t4) in FIG. 24. The texture coordinates are iterated across the polygon and supplied to the indirect texture mapping hardware for each pixel (block 1441).


Block 1442 uses the texture coordinates s1, t2 to look up the partial derivative (height offset) data from the partial derivative bump map. These retrieved values are multiplied by the Tangent coordinates s2, t2 and the results are retained by the bump unit 500b. Block 1443 multiplies the Binormal coordinates s3, t3 by these same partial derivatives and added to the previous products. Block 1444 then adds the sum-of-products to the Normal coordinates s4, t4 to generated perturbed Normal coordinates for environment mapping. Block 1445 can reuse these values to look up any number of additional light or environment maps. The environment mapping are then blended with the surface illumination in a conventional manner (block 1446) and the results are displayed.



FIG. 27 shows a more detailed flowchart of how the particular hardware implementation is stepped through the FIG. 26 process. The following table illustrates one example of the order of operations performed during successive processing stages for EMBM based on perturbations modeled with respect to a flat surface (dSdT) and performing multiple texture mappings:













bump unit processing:
TEV Stages:







1. Tangent vector (T):
(Disable texture access)


   (binormal 0) AFv


2. Binormal vector (B):
(Disable texture access)


   (binormal 1) AFu + previous result


   (recirculated)


3. Normal + previous result (recirculated):
lookup to lightmap 0


   (N + Fv T + Fu B)
(e.g., specular)


4. Previous result (reuse)
lookup to lightmap 1



(e.g., diffuse)


5. S, T (reuse previous result)
surface texture (lookup to



environment texture)









In the above example, TEV stages 3 through 5 would perform blending as follows:








lightmap0

(
specular
)


+

lightmap1

(
diffuse
)


+

surface





texture











Theory of Operation


As explained above, bump mapping allows one to add realism to an image without using a lot of geometry. Basically, bump mapping modifies the shading of a polygon by effectively perturbing the surface normal on a per-pixel basis. The shading makes the surface appear bumpy, even though the underlying geometry is relatively flat. The following discussion briefly describes the basic mathematics of bump mapping:


Bump Mapping Mathematics:


In general, the “bumpiness” of a surface can be described by a 2D height field, also called a “bump map”. The bump map is generally defined by a scalar difference F(u, v) between a flat surface P(u, v) and a desired bumpy surface P′(u, v) along the normal N at each point (u, v). Thus, the bump surface may be represented as:

P′(u,v)=P(u,v)+F(u,v)N


Normally, P is modeled using polygons, and F is modeled as a 2D image using a paint program or other tool. The normal Vector N′ at (u, v) can be calculated by the cross product of the partial derivatives of P′ in u and v. For this discussion, the partial derivative terms are defined by the following simplified notation:








P
u

=




P


(

u
,
v

)





u



,


P
v

=




P


(

u
,
v

)





v



,


P
u


=





P




(

u
,
v

)





u



,


P
v


=





P




(

u
,
v

)





v



,


F
u

=




F


(

u
,
v

)





u



,


F
v

=




F


(

u
,
v

)





v







Accordingly, the partial derivatives of P′(u, v) can be computed using the chain rule from (P′u×P′v)= N′ and P′(u,v)=P(u,v)+F(u,v) N as follows:












P
u


=


P
u

+


F
u



N
_


+

F





N
_




u











P
v


=


P
v

+


F
v



N
_


+

F





N
_




v












If F is assumed to be sufficiently small, the last term in the above two equations can be approximated by zero and, thus, the partial derivatives may be represented as:

Pu′=Pu+FuN and
Pv′==Pv+FvN

Taking the cross product gives the following expression for N′:

N′=Pu×Pv+Fu(N×Pu)+Fv(N×Pv)+FuFv(N× N)

Since by definition,

N=Pu×Pv and N× N=0

the equation for N′ can be simplified to:

N′= N+Fu(N×Pu)+Fv(N×Pv)

Using the notation of T for the tangent vector and B for the Binormal vector:

B= N×Pu and T= N×Pv,

a perturbed Normal may be computed according to the following equation:

N′=N+FuB+FvT


The values Fu and Fv may be computed offline, for example, through “forward differencing” of the 2D bump map. Pu and Pv may be computed either directly from the surface definition, or from forward differencing applied to the surface parameterization. Forward differencing is a known conventional method which may be used to compute (approximate) the first derivative of a height field (bump map) in a given direction. For example, assuming that a one-dimensional bump map is represented as the height function F(s), the forward difference would be represented by the following:

F1=F(s)−F(s+Δs)


If, for example, the delta is one texel in s, and the width of the bump map is w, then the forward difference is (assuming s is normalized to map coordinates):







F
1

=


F


(
s
)


-

F


(

s
+

1
w


)







If F were continuous, the above equations would approximate the first derivative of F. For a 2D bump map, a forward differencing operation may be performed by the following pseudo-code example:

















For (t = 0; t < h; t++) {



  For (s = 0; s < w; s++) {



    tex00 = bump_imag(s,t);



    tex01 = bump_imag(s+1, t);



    tex10 = bump_imag(s, t+1);



    Fs = tex00 - tex01;



    Ft = tex00 - tex10;



  }



}











Example API Environment-mapped Bump-mapping Function Commands:


As shown in FIGS. 12–13, one or more graphics API functions are used to set up and initiate deviational indirect texture look-up operations. Example API functions for setting up indirect texture operations and parameters for performing environment-mapped bump-mapping may be defined as follows:


GXSetTevIndBumpXYZ


This function sets up an environment-mapped bump-mapped dXdYdZ texture indirect lookup. The indirect map specifies offsets in object (X, Y, Z) space. This kind of lookup requires only one TEV stages to compute. the indirect matrix should be loaded with a transformation for normals from object space to eye space. The surface geometry need only provide regular normals at each vertex.


Example Arguments:















Tev_stage
The TEV stage that is being affected


Ind_stage
The indirect stage results to use with this TEV stage.


Matrix-sel
Indicates which indirect matrix and scale value to use to



multiply the retrieved offsets.









Example Usage:


















void GXSetTevIndBumpXYZ(
GXTevStageID tev_stage,




GXIndTexStageID ind_stage,




GXIndTexMtxId matrix_sel );










GXSetTevIndBumpST


This function sets up an environment-mapped bump-mapped dSdT texture indirect lookup. The indirect map specifies offsets in (S, T) space. This lookup function requires 3 TEV stages to compute the offset texture coordinates. The resulting texture coordinates are available two stages after the one specified in the function call. The first two TEV stages should disable texture lookup. The third stage is where the lookup is actually performed. One may use an API GXSetTevIndRepeat function (described below) in subsequent TEV stages to reuse the computed texture coordinates for additional lookups. The surface geometry should provide Normal/Binormal/Tangent vectors at each vertex. This function makes use of the dynamic form of matrices (FIG. 16B) available in the bump processing unit (FIG. 15) for transforming the S and T offsets to be relative to the incoming regular S and T (which come from the object normals). A scale value provided by the bump unit should contain the size of the reflection map divided by 2 (and thus the reflection map should be a square power of 2). In this operation, the static offset matrix (FIG. 16A) used for the texture coordinate computation. Instead, one of two dynamic matrices (i.e., matrix A and matrix B of FIG. 16B) is used along with a scaling value. The application program should disable the first two TEV blending stages from texture look-ups.


Example Arguments:















Tev_stage
The TEV stage that is being affected.


Ind_stage
The indirect stage results to use with this TEV stage.


Matrix_sel
Indicates which indirect matrix scale value to use to



multiply the retrieved offsets.









Example Usage:


















void GXSetTevIndBumpSt (
GXTevStageID tev_stage,




GXIndTexStageID ind_stage,




GXIndTexMtxId matrix_sel );










Having used 3 TEV stages to compute a texture coordinate for an EMBM dSdT lookup, one can use the result to do more than one lookup to different texture maps in memory. For example, one may perform additional lookups for specular and diffuse lightmaps. In order to perform successive texture map lookups without taking 3 stages to compute each one, one may use the texture coordinate feedback feature of the present invention.


GXSetTevIndRepeat


This function is used when one wishes to use the same texture coordinates for one TEV stage as were computed in the previous stage. This is useful when the texture coordinates require more than one stage to compute, as is the case for GXSetTevIndBumpST operations.


Example Arguments:


tev_stage The TEV stage that is being changed.


Example Usage:


void GXSetTevIndRepeat (GXTevStageID tev_stage);


Other Example Compatible Implementations


Certain of the above-described system components 50 could be implemented as other than the home video game console configuration described above. For example, one could run graphics application or other software written for system 50 on a platform with a different configuration that emulates system 50 or is otherwise compatible with it. If the other platform can successfully emulate, simulate and/or provide some or all of the hardware and software resources of system 50, then the other platform will be able to successfully execute the software.


As one example, an emulator may provide a hardware and/or software configuration (platform) that is different from the hardware and/or software configuration (platform) of system 50. The emulator system might include software and/or hardware components that emulate or simulate some or all of hardware and/or software components of the system for which the application software was written. For example, the emulator system could comprise a general purpose digital computer such as a personal computer, which executes a software emulator program that simulates the hardware and/or firmware of system 50.


Some general purpose digital computers (e.g., IBM or MacIntosh personal computers and compatibles) are now equipped with 3D graphics cards that provide 3D graphics pipelines compliant with DirectX or other standard 3D graphics command APIs. They may also be equipped with stereophonic sound cards that provide high quality stereophonic sound based on a standard set of sound commands. Such multimedia-hardware-equipped personal computers running emulator software may have sufficient performance to approximate the graphics and sound performance of system 50. Emulator software controls the hardware resources on the personal computer platform to simulate the processing, 3D graphics, sound, peripheral and other capabilities of the home video game console platform for which the game programmer wrote the game software.



FIG. 28 illustrates an example overall emulation process using a host platform 1201, an emulator component 1303, and a game software executable binary image provided on a storage medium 62. Host 1201 may be a general or special purpose digital computing device such as, for example, a personal computer, a video game console, or any other platform with sufficient computing power. Emulator 1303 may be software and/or hardware that runs on host platform 1201, and provides a real-time conversion of commands, data and other information from storage medium 62 into a form that can be processed by host 1201. For example, emulator 1303 fetches “source” binary-image program instructions intended for execution by system 50 from storage medium 62 and converts these program instructions to a target format that can be executed or otherwise processed by host 1201.


As one example, in the case where the software is written for execution on a platform using an IBM PowerPC or other specific processor and the host 1201 is a personal computer using a different (e.g., Intel) processor, emulator 1303 fetches one or a sequence of binary-image program instructions from storage medium 62 and converts these program instructions to one or more equivalent Intel binary-image program instructions. The emulator 1303 also fetches and/or generates graphics commands and audio commands intended for processing by the graphics and audio processor 114, and converts these commands into a format or formats that can be processed by hardware and/or software graphics and audio processing resources available on host 1201. As one example, emulator 1303 may convert these commands into commands that can be processed by specific graphics and/or or sound hardware of the host 1201 (e.g., using standard DirectX, OpenGL and/or sound APIs).


An emulator 1303 used to provide some or all of the features of the video game system described above may also be provided with a graphic user interface (GUI) that simplifies or automates the selection of various options and screen modes for games run using the emulator. In one example, such an emulator 1303 may further include enhanced functionality as compared with the host platform for which the software was originally intended.


In the case where particular graphics support hardware within an emulator does not include the example environment-mapped bump-mapping and indirect texture referencing features and functions illustrated by FIGS. 6 through 27, the emulator designer has a choice of either:

    • translating the environment-mapped bump-mapping and indirect-texture referencing commands into other graphics API commands the graphics support hardware understands, or
    • implementing environment-mapped bump-mapping and indirect-texture referencing in software with a potential corresponding decrease in performance depending upon the speed of the processor, or
    • “stubbing” (i.e., ignoring) the environment-mapped bump-mapping and indirect-texture referencing commands to provide a rendered image that does not include effects utilizing environment-mapped bump-mapping and indirect-texture referencing.


While the logical diagrams of FIGS. 6 through 24 can be implemented entirely in software, entirely in hardware or by a combination of hardware and software, the preferred embodiment performs most of these calculations in hardware (e.g., using bump unit 500b) to obtain increased speed performance and other advantages. Nevertheless, in other implementations (e.g., where a very fast processor is available), some or all of the processing described herein may be implemented in software to provide similar or identical imaging results.



FIG. 29 illustrates an emulation host system 1201 suitable for use with emulator 1303. System 1201 includes a processing unit 1203 and a system memory 1205. A system bus 1207 couples various system components including system memory 1205 to processing unit 1203. System bus 1207 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. System memory 1197 includes read only memory (ROM) 1252 and random access memory (RAM) 1254. A basic input/output system (BIOS) 1256, containing the basic routines that help to transfer information between elements within personal computer system 1201, such as during start-up, is stored in the ROM 1252. System 1201 further includes various drives and associated computer-readable media. A hard disk drive 1209 reads from and writes to a (typically fixed) magnetic hard disk 1211. An additional (possible optional) magnetic disk drive 1213 reads from and writes to a removable “floppy” or other magnetic disk 1215. An optical disk drive 1217 reads from and, in some configurations, writes to a removable optical disk 1219 such as a CD ROM or other optical media. Hard disk drive 1209 and optical disk drive 1217 are connected to system bus 1207 by a hard disk drive interface 1221 and an optical drive interface 1225, respectively. The drives and their associated computer-readable media provide nonvolatile storage of computer-readable instructions, data structures, program modules, game programs and other data for personal computer system 1201. In other configurations, other types of computer-readable media that can store data that is accessible by a computer (e.g., magnetic cassettes, flash memory cards, digital video disks, Bernoulli cartridges, random access memories (RAMs), read only memories (ROMs) and the like) may also be used.


A number of program modules including emulator 1303 may be stored on the hard disk 1211, removable magnetic disk 1215, optical disk 1219 and/or the ROM 1252 and/or the RAM 1254 of system memory 1205. Such program modules may include an operating system providing graphics and sound APIs, one or more application programs, other program modules, program data and game data. A user may enter commands and information into personal computer system 1201 through input devices such as a keyboard 1227, pointing device 1229, microphones, joysticks, game controllers, satellite dishes, scanners, or the like. These and other input devices can be connected to processing unit 1203 through a serial port interface 1231 that is coupled to system bus 1207, but may be connected by other interfaces, such as a parallel port, game port Fire wire bus or a universal serial bus (USB). A monitor 1233 or other type of display device is also connected to system bus 1207 via an interface, such as a video adapter 1235.


System 1201 may also include a modem 1154 or other network interface means for establishing communications over a network 1152 such as the Internet. Modem 1154, which may be internal or external, is connected to system bus 123 via serial port interface 1231. A network interface 1156 may also be provided for allowing system 1201 to communicate with a remote computing device 1150 (e.g., another system 1201) via a local area network 1158 (or such communication may be via wide area network 1152 or other communications path such as dial-up or other communications means). System 1201 will typically include other peripheral output devices, such as printers and other standard peripheral devices.


In one example, video adapter 1235 may include a 3D graphics pipeline chip set providing fast 3D graphics rendering in response to 3D graphics commands issued based on a standard 3D graphics application programmer interface such as Microsoft's DirectX 7.0 or other version. A set of stereo loudspeakers 1237 is also connected to system bus 1207 via a sound generating interface such as a conventional “sound card” providing hardware and embedded software support for generating high quality stereophonic sound based on sound commands provided by bus 1207. These hardware capabilities allow system 1201 to provide sufficient graphics and sound speed performance to play software stored in storage medium 62.


All documents referenced above are hereby incorporated by reference.


While the invention has been described in connection with what is presently considered to be the most practical and preferred embodiment, it is to be understood that the invention is not to be limited to the disclosed embodiment, but on the contrary, is intended to cover various modifications and equivalent arrangements included within the scope of the appended claims.

Claims
  • 1. In a graphics system including a processing pipeline that renders and displays images at least in part in response to polygon vertex data and texture image data stored in memory, an arrangement for implementing environment-mapped bump mapping in a single rendering pass, comprising: texture memory for storing image data and bump mapping data;texture retrieval circuitry for accessing and retrieving data stored in texture memory; andtexture coordinate/bump processing circuitry coupled to the texture retrieval circuitry and configured to receive data retrieved from texture memory for generating a set of modified texture coordinates, said texture coordinate/bump processing circuitry including multiplication circuitry for performing at least scaling of texture coordinates and a storage buffer for saving a set of modified texture coordinates for reuse by the texture retrieval circuitry in accessing texels of at least an environment map image and/or one or more corresponding texture image data maps stored in texture memory multiple texture image data maps in the texture memory;wherein the texture retrieval circuitry is responsive to a set of indirect texture coordinates to provide said texture coordinate/bump processing circuitry with data retrieved from the texture memory for use in generating said set of modified texture coordinates.
  • 2. The arrangement for implementing environment-mapped bump mapping of claim 1 wherein the coordinate/bump processing circuitry includes matrix multiplication circuitry for performing space translation and scaling operations.
  • 3. The arrangement for implementing environment-mapped bump mapping of claim 1 wherein the coordinate/bump processing circuitry includes matrix multiplication circuitry capable of performing operations requiring at least a 3×2 matrix.
  • 4. The arrangement for implementing environment-mapped bump mapping of claim 1 wherein the coordinate/bump processing circuitry includes at least scaling and summing circuitry for computing values for a perturbed texture coordinate based at least in part on data obtained from a bump map stored in texture memory.
  • 5. The arrangement for implementing environment-mapped bump mapping of claim 1 wherein the coordinate/bump processing circuitry includes an output buffer for saving computed and/or modified texture coordinates for use by the texture retrieval circuitry in accessing multiple texture image data maps in the texture memory.
  • 6. In a graphics system that renders and displays images at least in part in response to polygon vertex data and texture data stored in memory, said system capable of direct and indirect texture coordinate processing, a method [dXdYdZ] of environment-mapped bump mapping based on a bump map function modeled with respect to a 3D surface, comprising the steps of: precomputing forward difference values of a surface bump function F(u, v) modeled with respect to a particular 3D surface and storing said values as a texture map in memory;supplying, for each of the plural vertices, model-space data representing a surface Normal vector,converting said Normal vectors to eye-space;generating texture coordinate values using only x and y eye-space vector components of said Normal vectors;interpolating said texture coordinate values across a polygon of an object being rendered;using said interpolated texture coordinates in an indirect mode of texture coordinate processing for looking up, in said texture map, a set of precomputed forward difference values of a surface bump function F(u, v) modeled with respect to a 3D surface;computing a set of perturbed texture coordinates based on said interpolated texture coordinates and said set of precomputed forward difference values;using said set of perturbed texture coordinates for performing a lookup in memory to a texel in an environment texture map; andusing said texel to determine a pixel color.
  • 7. The method of claim 6 wherein computing a set of perturbed texture coordinates includes transforming said bump map data from object space to eye space.
  • 8. In a graphics system that renders and displays images at least in part in response to polygon vertex data and texture data stored in memory, said system capable of direct and indirect modes of texture coordinate processing wherein, in an indirect texture coordinate processing mode, stored texture data is retrieved and used for further texture coordinate processing, a dSdT method of environment-mapped bump mapping based on a bump map function modeled with respect to a flat surface, comprising the steps of: supplying, for each of the plural vertices, model-space data representing a surface Normal vector, a Tangent vector and Binormal vector;converting said Normal, Tangent vector and Binormal vectors to eye-space;generating texture coordinate values using only x and y eye-space vector components of said Normal, Tangent vector and Binormal vectors;interpolating said texture coordinate values across a polygon comprising a surface of an object being rendered for a pixel;using interpolated texture coordinates of said Normal vector, in an indirect mode of texture coordinate processing, for looking up a set of precomputed forward difference values, Fu and Fv, of a surface bump function F(u, v) modeled in two dimensions with respect to a flat surface, wherein said precomputed forward difference values are stored as a texel in a texture data map stored in memory;computing a set of perturbed texture coordinates based on said interpolated texture coordinates and said set of precomputed forward difference values;using said set of perturbed texture coordinates for performing multiple lookups to a texel in a plurality of different color and/or image data maps stored as texture data in memory, wherein at least one data maps is a light map and at least one of said maps is an environment texture map; andblending texel color data from each of said multiple lookups to determine a pixel color.
  • 9. The method of claim 8 wherein computing a set of perturbed texture coordinates includes transforming said bump map data from object space to eye space.
  • 10. In a graphics system including a graphics processor that generates image information for display at least in part in response to stored texture images, said graphics processor including texture processing components coupled to a texture memory, said texture processing components performing texture mapping in response to applied texture coordinates, a method of performing environment-mapped bump mapping comprising: storing environment image mapping data in said texture memory;storing bump mapping data in said texture memory;generating indirect texture coordinates;using said indirect texture coordinates to retrieve said bump mapping data stored in texture memory;generating computed texture coordinates based at least in part on retrieved bump mapping data; andusing said computed texture coordinates to retrieve pixel color data from said environment image mapping data stored in said texture memory; andoutputting retrieved pixel color data for use in rendering a graphics object having an environment-mapped bump-mapped texture.
  • 11. The method of claim 10 wherein said generating computed texture coordinates comprises computing texture coordinate values based on said retrieved bump mapping data and at least one set of non-indirect texture coordinates.
  • 12. The method of claim 10 wherein said generating computed texture coordinates comprises perturbing direct texture coordinates by said retrieved bump mapping data.
  • 13. The method of claim 10 wherein said environment image mapping data comprises one or more light maps stored in texture memory.
  • 14. The method of claim 10 wherein said environment image mapping data comprises at least one reflection map stored in texture memory.
  • 15. The method of claim 10 wherein said environment image mapping data comprises at least one environment texture map stored in texture memory.
  • 16. The method of claim 10 wherein said generating computed texture coordinates comprises computing a set of scaled texture coordinates.
  • 17. The method of claim 10 wherein further comprising saving at least one set of said computed texture coordinates for reuse in subsequent processing stages.
  • 18. In a graphics system, in a graphics pipeline, texture processing components coupled to a texture memory, said texture processing components performing texture mapping and environment-mapped bump mapping in response to applied texture coordinates, comprising: texture coordinate processing circuitry for identifying indirect texture coordinates and receiving bump function difference data retrieved from a texture map stored in texture memory;matrix multiplication circuitry for performing eye-space coordinate transformations on texture coordinate data; and buffer circuitry for saving computed texture coordinates.
US Referenced Citations (446)
Number Name Date Kind
4275413 Sakamoto et al. Jun 1981 A
4357624 Greenberg Nov 1982 A
4388620 Sherman Jun 1983 A
4425559 Sherman Jan 1984 A
4463380 Hooks, Jr. Jul 1984 A
4491836 Collmeyer et al. Jan 1985 A
4570233 Yan et al. Feb 1986 A
4586038 Sims et al. Apr 1986 A
4600919 Stern Jul 1986 A
4615013 Yan et al. Sep 1986 A
4625289 Rockwood Nov 1986 A
4653012 Duffy et al. Mar 1987 A
4658247 Gharachorloo Apr 1987 A
4692880 Merz et al. Sep 1987 A
4695943 Keeley et al. Sep 1987 A
4710876 Cline et al. Dec 1987 A
4725831 Coleman Feb 1988 A
4768148 Keeley et al. Aug 1988 A
4785395 Keeley Nov 1988 A
4790025 Inoue et al. Dec 1988 A
4808988 Burke et al. Feb 1989 A
4812988 Duthuit et al. Mar 1989 A
4817175 Tenenbaum et al. Mar 1989 A
4829295 Hiroyuki May 1989 A
4829452 Kang et al. May 1989 A
4833601 Barlow et al. May 1989 A
4855934 Robinson Aug 1989 A
4862392 Steiner Aug 1989 A
4866637 Gonzalez-Lopez et al. Sep 1989 A
4888712 Barkans et al. Dec 1989 A
4897806 Cook et al. Jan 1990 A
4901064 Deering Feb 1990 A
4907174 Priem Mar 1990 A
4914729 Omori et al. Apr 1990 A
4918625 Yan Apr 1990 A
4935879 Ueda Jun 1990 A
4945500 Deering Jul 1990 A
4965751 Thayer et al. Oct 1990 A
4974176 Buchner et al. Nov 1990 A
4974177 Nishiguchi Nov 1990 A
4975977 Kurosu et al. Dec 1990 A
4989138 Radochonski Jan 1991 A
5003496 Hunt, Jr. et al. Mar 1991 A
5016183 Shyong May 1991 A
5018076 Johary et al. May 1991 A
5043922 Matsumoto Aug 1991 A
5056044 Frederickson et al. Oct 1991 A
5062057 Blacken et al. Oct 1991 A
5086495 Gray et al. Feb 1992 A
5091967 Ohsawa Feb 1992 A
5097427 Lathrop et al. Mar 1992 A
5136664 Bersack et al. Aug 1992 A
5144291 Nishizawa Sep 1992 A
5163126 Einkauf et al. Nov 1992 A
5170468 Shah et al. Dec 1992 A
5179638 Dawson et al. Jan 1993 A
5204944 Wolberg et al. Apr 1993 A
5224208 Miller, Jr. et al. Jun 1993 A
5239624 Cook et al. Aug 1993 A
5241658 Masterson et al. Aug 1993 A
5255353 Itoh Oct 1993 A
5268995 Diefendorff et al. Dec 1993 A
5268996 Steiner et al. Dec 1993 A
5278948 Luken, Jr. Jan 1994 A
5307450 Grosssman Apr 1994 A
5315692 Hansen et al. May 1994 A
5345541 Kelley et al. Sep 1994 A
5353424 Partovi et al. Oct 1994 A
5357579 Buchner et al. Oct 1994 A
5361386 Watkins et al. Nov 1994 A
5363475 Baker et al. Nov 1994 A
5377313 Scheibl Dec 1994 A
5392385 Evangelisti et al. Feb 1995 A
5392393 Deering Feb 1995 A
5394516 Winser Feb 1995 A
5402532 Epstein et al. Mar 1995 A
5404445 Matsumoto Apr 1995 A
5408650 Arsenault Apr 1995 A
5412796 Olive May 1995 A
5415549 Logg May 1995 A
5416606 Katayama et al. May 1995 A
5421028 Swanson May 1995 A
5422997 Nagashima Jun 1995 A
5432895 Myers Jul 1995 A
5432900 Rhodes et al. Jul 1995 A
5438663 Matsumoto et al. Aug 1995 A
5448689 Matsuo et al. Sep 1995 A
5457775 Johnson, Jr. et al. Oct 1995 A
5461712 Chelstowski et al. Oct 1995 A
5467438 Nishio et al. Nov 1995 A
5467459 Alexander et al. Nov 1995 A
5469535 Jarvis et al. Nov 1995 A
5473736 Young Dec 1995 A
5475803 Stearns et al. Dec 1995 A
5487146 Guttag et al. Jan 1996 A
5490240 Foran et al. Feb 1996 A
5495563 Winser Feb 1996 A
5504499 Horie et al. Apr 1996 A
5504917 Austin Apr 1996 A
5506604 Nally et al. Apr 1996 A
5535374 Olive Jul 1996 A
5543824 Priem et al. Aug 1996 A
5544292 Winser Aug 1996 A
5548709 Hannah et al. Aug 1996 A
5553228 Erb et al. Sep 1996 A
5557712 Guay Sep 1996 A
5559954 Sakoda et al. Sep 1996 A
5561746 Murata et al. Oct 1996 A
5561752 Jevans Oct 1996 A
5561756 Miller et al. Oct 1996 A
5563989 Billyard Oct 1996 A
5566285 Okada Oct 1996 A
5573402 Gray Nov 1996 A
5579456 Cosman Nov 1996 A
5586234 Sakuraba et al. Dec 1996 A
5593350 Bouton et al. Jan 1997 A
5594854 Baldwin et al. Jan 1997 A
5600763 Greene et al. Feb 1997 A
5606650 Kelley et al. Feb 1997 A
5607157 Nagashima Mar 1997 A
5608424 Takahashi et al. Mar 1997 A
5608864 Bindlish et al. Mar 1997 A
5616031 Logg Apr 1997 A
5621867 Murata et al. Apr 1997 A
5628686 Svancarek et al. May 1997 A
5638535 Rosenthal et al. Jun 1997 A
5644364 Kurtze et al. Jul 1997 A
5649082 Burns Jul 1997 A
5650955 Puar et al. Jul 1997 A
5651104 Cosman Jul 1997 A
5657045 Katsura et al. Aug 1997 A
5657443 Krech, Jr. Aug 1997 A
5657478 Recker et al. Aug 1997 A
5659671 Tannenbaum et al. Aug 1997 A
5659673 Nonoshita Aug 1997 A
5659715 Wu et al. Aug 1997 A
5664162 Dye Sep 1997 A
5666439 Ishida et al. Sep 1997 A
5678037 Osugi et al. Oct 1997 A
5682522 Huang et al. Oct 1997 A
5684941 Dye Nov 1997 A
5687304 Kiss Nov 1997 A
5687357 Priem Nov 1997 A
5691746 Shyu Nov 1997 A
5694143 Fielder et al. Dec 1997 A
5696892 Redmann et al. Dec 1997 A
5701444 Baldwin Dec 1997 A
5703806 Puar et al. Dec 1997 A
5706481 Hannah et al. Jan 1998 A
5706482 Matsushima et al. Jan 1998 A
5714981 Scott-Jackson et al. Feb 1998 A
5721947 Priem et al. Feb 1998 A
5724561 Tarolli et al. Mar 1998 A
5726689 Negishi et al. Mar 1998 A
5726947 Yamazaki et al. Mar 1998 A
5727192 Baldwin Mar 1998 A
5734386 Cosman Mar 1998 A
5739819 Bar-Nahum Apr 1998 A
5740343 Tarolli et al. Apr 1998 A
5740383 Nally et al. Apr 1998 A
5740406 Rosenthal et al. Apr 1998 A
5742749 Foran et al. Apr 1998 A
5742788 Priem et al. Apr 1998 A
5745118 Alcorn et al. Apr 1998 A
5745125 Deering et al. Apr 1998 A
5748199 Palm May 1998 A
5748986 Butterfield et al. May 1998 A
5751291 Olsen et al. May 1998 A
5751292 Emmot May 1998 A
5751295 Becklund et al. May 1998 A
5751930 Katsura et al. May 1998 A
5754191 Mills et al. May 1998 A
5757382 Lee May 1998 A
5758182 Rosenthal et al. May 1998 A
5760783 Migdal et al. Jun 1998 A
5764228 Baldwin Jun 1998 A
5764237 Kaneko Jun 1998 A
5764243 Baldwin Jun 1998 A
5767856 Peterson et al. Jun 1998 A
5767858 Kawase et al. Jun 1998 A
5768626 Munson et al. Jun 1998 A
5768629 Wise et al. Jun 1998 A
5774133 Neave et al. Jun 1998 A
5777623 Small Jul 1998 A
5777629 Baldwin Jul 1998 A
5781927 Wu et al. Jul 1998 A
5791994 Hirano et al. Aug 1998 A
5798770 Baldwin Aug 1998 A
5801706 Fujita et al. Sep 1998 A
5801711 Koss et al. Sep 1998 A
5801716 Silverbrook Sep 1998 A
5801720 Norrod et al. Sep 1998 A
5805175 Priem Sep 1998 A
5805868 Murphy Sep 1998 A
5808619 Choi et al. Sep 1998 A
5808630 Pannell Sep 1998 A
5809219 Pearce et al. Sep 1998 A
5809278 Watanabe et al. Sep 1998 A
5815165 Blixt Sep 1998 A
5815166 Baldwin Sep 1998 A
5818456 Cosman et al. Oct 1998 A
5819017 Akeley et al. Oct 1998 A
5821940 Morgan et al. Oct 1998 A
5821949 Deering Oct 1998 A
5822516 Krech, Jr. Oct 1998 A
5828382 Wilde Oct 1998 A
5828383 May et al. Oct 1998 A
5828907 Wise et al. Oct 1998 A
5831624 Tarolli et al. Nov 1998 A
5831625 Rich et al. Nov 1998 A
5831640 Wang et al. Nov 1998 A
5835096 Baldwin Nov 1998 A
5835792 Wise et al. Nov 1998 A
5838334 Dye Nov 1998 A
5844576 Wilde et al. Dec 1998 A
5850229 Edelsbrunner et al. Dec 1998 A
5852451 Cox et al. Dec 1998 A
5856829 Gray, III et al. Jan 1999 A
5859645 Latham Jan 1999 A
5861888 Dempsey Jan 1999 A
5861893 Sturgess Jan 1999 A
5867166 Myhrvold et al. Feb 1999 A
5870097 Snyder et al. Feb 1999 A
5870098 Gardiner Feb 1999 A
5870102 Tarolli et al. Feb 1999 A
5870109 McCormack et al. Feb 1999 A
5870587 Danforth et al. Feb 1999 A
5872902 Kuchkuda et al. Feb 1999 A
5874969 Storm et al. Feb 1999 A
5877741 Chee et al. Mar 1999 A
5877770 Hanaoka Mar 1999 A
5877771 Drebin et al. Mar 1999 A
5880736 Peercy et al. Mar 1999 A
5880737 Griffen et al. Mar 1999 A
5883638 Rouet et al. Mar 1999 A
5886701 Chauvin et al. Mar 1999 A
5886705 Lentz Mar 1999 A
5887155 Laidig Mar 1999 A
5890190 Rutman Mar 1999 A
5892517 Rich Apr 1999 A
5892974 Koizumi et al. Apr 1999 A
5894300 Takizawa Apr 1999 A
5900881 Ikedo May 1999 A
5903283 Selwan et al. May 1999 A
5909218 Naka et al. Jun 1999 A
5909225 Schinnerer et al. Jun 1999 A
5912675 Laperriere Jun 1999 A
5912676 Malladi et al. Jun 1999 A
5914721 Lim Jun 1999 A
5914725 Mcinnnis et al. Jun 1999 A
5914729 Lippincott Jun 1999 A
5917496 Fujita et al. Jun 1999 A
5920326 Rentschler et al. Jul 1999 A
5920876 Ungar et al. Jul 1999 A
5923332 Izawa Jul 1999 A
5923334 Luken Jul 1999 A
5926182 Menon et al. Jul 1999 A
5926647 Adams et al. Jul 1999 A
5933150 Ngo et al. Aug 1999 A
5933154 Howard et al. Aug 1999 A
5933155 Akeley Aug 1999 A
5933529 Kim Aug 1999 A
5936641 Jain et al. Aug 1999 A
5940086 Rentschler et al. Aug 1999 A
5940089 Dilliplane Aug 1999 A
5940538 Spiegel et al. Aug 1999 A
5943058 Nagy Aug 1999 A
5943060 Cosman et al. Aug 1999 A
5945997 Zhao et al. Aug 1999 A
5949421 Ogletree et al. Sep 1999 A
5949423 Olsen Sep 1999 A
5949424 Cabral et al. Sep 1999 A
5949428 Toelle et al. Sep 1999 A
5949440 Krech, Jr. et al. Sep 1999 A
5956042 Tucker et al. Sep 1999 A
5956043 Jensen Sep 1999 A
5958020 Evoy et al. Sep 1999 A
5959640 Rudin et al. Sep 1999 A
5963220 Lee et al. Oct 1999 A
5963683 Lin Oct 1999 A
5966134 Arias Oct 1999 A
5969726 Rentschler et al. Oct 1999 A
5977979 Clough et al. Nov 1999 A
5977984 Omori Nov 1999 A
5982376 Abe et al. Nov 1999 A
5982390 Stoneking et al. Nov 1999 A
5986659 Gallery et al. Nov 1999 A
5986663 Wilde Nov 1999 A
5986677 Jones et al. Nov 1999 A
5987567 Rivard et al. Nov 1999 A
5990903 Donovan Nov 1999 A
5995120 Dye Nov 1999 A
5995121 Alcokrn et al. Nov 1999 A
5999189 Kajiya et al. Dec 1999 A
5999196 Storm et al. Dec 1999 A
5999198 Horan et al. Dec 1999 A
6002407 Fadden Dec 1999 A
6002409 Harkin Dec 1999 A
6002410 Battle Dec 1999 A
6005582 Gabriel et al. Dec 1999 A
6005583 Morrison Dec 1999 A
6005584 Kitamura et al. Dec 1999 A
6007428 Nishiumi et al. Dec 1999 A
6008820 Chauvin et al. Dec 1999 A
6011562 Gagne et al. Jan 2000 A
6011565 Kuo et al. Jan 2000 A
6014144 Nelson et al. Jan 2000 A
6016150 Lengyel et al. Jan 2000 A
6016151 Lin Jan 2000 A
6018350 Lee et al. Jan 2000 A
6020931 Bilbrey et al. Feb 2000 A
6021417 Massarksy Feb 2000 A
6022274 Takeda et al. Feb 2000 A
6023261 Ugajin Feb 2000 A
6023738 Priem et al. Feb 2000 A
6025853 Baldwin Feb 2000 A
6026182 Lee et al. Feb 2000 A
6028608 Jenkins Feb 2000 A
6028611 Anderson et al. Feb 2000 A
6031542 Wittig Feb 2000 A
6035360 Doidge et al. Mar 2000 A
6037948 Liepa Mar 2000 A
6037949 DeRose et al. Mar 2000 A
6038031 Murphy Mar 2000 A
6038348 Carley Mar 2000 A
6040843 Monroe et al. Mar 2000 A
6040844 Yamaguchi et al. Mar 2000 A
6041010 Puar et al. Mar 2000 A
6043804 Greene Mar 2000 A
6043821 Sprague et al. Mar 2000 A
6046746 Deering Apr 2000 A
6046747 Saunders et al. Apr 2000 A
6046752 Kirkland et al. Apr 2000 A
6049337 Van Overveld Apr 2000 A
6049338 Anderson et al. Apr 2000 A
6052125 Gardiner et al. Apr 2000 A
6052126 Sakuraba et al. Apr 2000 A
6052127 Vaswani et al. Apr 2000 A
6052129 Fowler et al. Apr 2000 A
6052133 Kang Apr 2000 A
6054993 Devic et al. Apr 2000 A
6054999 Strandberg Apr 2000 A
6057847 Jenkins May 2000 A
6057849 Haubner et al. May 2000 A
6057851 Luken et al. May 2000 A
6057852 Krech, Jr. May 2000 A
6057859 Handelman et al. May 2000 A
6057861 Lee et al. May 2000 A
6057862 Margulis May 2000 A
6057863 Olarig May 2000 A
6061462 Tostevin et al. May 2000 A
6064392 Rohner May 2000 A
6067098 Dye May 2000 A
6070204 Poisner May 2000 A
6072496 Guenter et al. Jun 2000 A
6075543 Akeley Jun 2000 A
6075546 Hussain et al. Jun 2000 A
6078311 Pelkey Jun 2000 A
6078333 Wittig et al. Jun 2000 A
6078334 Hanaoka et al. Jun 2000 A
6078338 Horan et al. Jun 2000 A
6081274 Shiraishi Jun 2000 A
6088035 Sudarsky et al. Jul 2000 A
6088042 Handelman et al. Jul 2000 A
6088487 Kurashige Jul 2000 A
6088701 Whaley et al. Jul 2000 A
6091431 Saxena et al. Jul 2000 A
6092124 Priem et al. Jul 2000 A
6092158 Harriman et al. Jul 2000 A
6094200 Olsen et al. Jul 2000 A
6097435 Stanger et al. Aug 2000 A
6097437 Hwang Aug 2000 A
6104415 Gossett Aug 2000 A
6104417 Nielsen et al. Aug 2000 A
6105094 Lindeman Aug 2000 A
6108743 Debs et al. Aug 2000 A
6111582 Jenkins Aug 2000 A
6111584 Murphy Aug 2000 A
6115047 Deering Sep 2000 A
6115049 Winner et al. Sep 2000 A
6118462 Margulis Sep 2000 A
6128026 Brothers, III Oct 2000 A
6144365 Young et al. Nov 2000 A
6144387 Liu et al. Nov 2000 A
6151602 Hejlsberg et al. Nov 2000 A
6155926 Miyamoto et al. Dec 2000 A
6157387 Kotani Dec 2000 A
6163319 Peercy et al. Dec 2000 A
6166748 Van Hook et al. Dec 2000 A
6172678 Shiraishi Jan 2001 B1
6173367 Aleksic et al. Jan 2001 B1
6177944 Fowler et al. Jan 2001 B1
6181352 Kirk et al. Jan 2001 B1
6191794 Priem et al. Feb 2001 B1
6198488 Lindholm et al. Mar 2001 B1
6200253 Nishiumi et al. Mar 2001 B1
6204851 Netschke et al. Mar 2001 B1
6215496 Szeliski et al. Apr 2001 B1
6215497 Leung Apr 2001 B1
6226012 Priem et al. May 2001 B1
6226713 Mehrotra May 2001 B1
6229553 Duluk et al. May 2001 B1
6232981 Gossett May 2001 B1
6236413 Gossett et al. May 2001 B1
6239810 Van Hook et al. May 2001 B1
6252610 Hussain Jun 2001 B1
6262608 Snyder et al. Jun 2001 B1
6259460 Gossett et al. Jul 2001 B1
6264558 Nishiumi et al. Jul 2001 B1
6268861 Sanz-Pastor et al. Jul 2001 B1
6275235 Morgan, III Aug 2001 B1
6285779 Lapidous et al. Sep 2001 B1
6292194 Powll, III Sep 2001 B1
6329997 We et al. Dec 2001 B1
6331856 Van Hook et al. Dec 2001 B1
6337689 Hochmuth et al. Jan 2002 B1
6339428 Fowler et al. Jan 2002 B1
6342892 Van Hook et al. Jan 2002 B1
6353438 Van Hook Mar 2002 B1
6356497 Puar et al. Mar 2002 B1
6384824 Morgan et al. May 2002 B1
6408362 Arimilli et al. Jun 2002 B1
6411301 Parikh et al. Jun 2002 B1
6417858 Bosch et al. Jul 2002 B1
6426747 Hoppe et al. Jul 2002 B1
6437781 Tucker et al. Aug 2002 B1
6452600 Parikh Sep 2002 B1
6459429 Deering Oct 2002 B1
6466223 Dorbie et al. Oct 2002 B1
6469707 Voorhies Oct 2002 B1
6476808 Kuo et al. Nov 2002 B1
6476822 Burbank Nov 2002 B1
6496187 Deering et al. Dec 2002 B1
6501479 Root et al. Dec 2002 B1
6580430 Hollis Jun 2003 B1
6593923 Donovan et al. Jul 2003 B1
6597363 Duluk, Jr. et al. Jul 2003 B1
6618048 Leather Sep 2003 B1
6636214 Leather Oct 2003 B1
6639595 Drebin Oct 2003 B1
6664958 Leather Dec 2003 B1
6664962 Komsthoeft Dec 2003 B1
6672963 Link Jan 2004 B1
6700586 Demers Mar 2004 B1
6707458 Leather Mar 2004 B1
6717577 Cheng et al. Apr 2004 B1
Foreign Referenced Citations (25)
Number Date Country
2070934 Dec 1993 CA
0 637 813 Feb 1995 EP
1 074 945 Feb 2001 EP
1 075 146 Feb 2001 EP
1 081 649 Mar 2001 EP
1 189 172 Mar 2002 EP
9-330230 Dec 1997 JP
11053580 Feb 1999 JP
11076614 Mar 1999 JP
11161819 Jun 1999 JP
11203500 Jul 1999 JP
11226257 Aug 1999 JP
11259671 Sep 1999 JP
11259678 Sep 1999 JP
2000-66985 Mar 2000 JP
2000-92390 Mar 2000 JP
2000-132704 May 2000 JP
2000-132706 May 2000 JP
2000-149053 May 2000 JP
2000-182077 Jun 2000 JP
2000-207582 Jul 2000 JP
2000-215325 Aug 2000 JP
2000-156875 Jun 2002 JP
WO9304429 Mar 1993 WO
WO 9410641 May 1994 WO
Related Publications (1)
Number Date Country
20050046639 A1 Mar 2005 US