Glenn W Strunk, Age 63709 Parkview Dr, Fort Collins, CO 80525

6137497, Oct 24, 2000

May 30, 1997

8/866843

Glenn W. Strunk - Fort Collins CO
Edmundo Rojas - Westminster CO
Theodore G. Rossin - Fort Collins CO

Hewlett-Packard Company - Palo Alto CA

G06T 1530

345434

A system and method for performing view clipping and model clipping of graphics primitives in a geometry accelerator of a computer graphics system. The method includes performing view clipping and model clipping of the graphics primitives in homogeneous window coordinates. The geometry accelerator includes a transform machine, a light machine, a clipping machine, and a plane equation machine. The transform machine receives vertex data defining a graphics primitive, in object coordinates, and transforms the vertex data into homogeneous window coordinates. The light machine receives the transformed vertex data from the transform machine and enhances the transformed vertex data by simulating lighting conditions of the graphics primitive. The light machine provides light enhanced transformed vertex data to the clipping machine. The clipping machine receives the light enhanced vertex data from the light machine and determines intersections of edges of the graphics primitive with view clipping planes and with any user specified model clipping planes.

6219071, Apr 17, 2001

Oct 6, 1998

9/209934

Alan S. Krech - Fort Collins CO
Theodore G. Rossin - Fort Collins CO
Edmundo Rojas - Fort Collins CO
Michael S McGrath - Fort Collins CO
Ted Rakel - Fort Collins CO
Glenn W Strunk - Fort Collins CO
Jon L Ashburn - Fort Collins CO
S Paul Tucker - Ft Collins CO

Hewlett-Packard Company - Palo Alto CA

G06F 1516

345503

The invention provides for a system and method for minimizing space requirements and increasing speed in a geometry accelerator for a computer graphics system. In architecture, the system is implemented as follows. The geometry accelerator includes a plurality of processing elements (e. g. , an arithmetic logic unit, a multiplier, a divider, a compare mechanism, a clamp mechanism, etc. ) and a plurality of control units (e. g. , a transform mechanism, a decomposition mechanism, a clip mechanism, a bow-tie mechanism, a light mechanism, a classify mechanism, a plane equation mechanism, a fog mechanism, etc. ) that utilize the processing elements for performing data manipulations upon image data. In accordance with the invention, the control units are implemented in a read-only memory (ROM) via microcode. A next address field is associated with each of the microcode instructions and defines a location in the ROM of a next instruction to be executed.

5877773, Mar 2, 1999

May 30, 1997

8/865902

Theodore G. Rossin - Fort Collins CO
Edmundo Rojas - Fort Collins CO
Glenn W. Strunk - Fort Collins CO

Hewlett-Packard Company - Palo Alto CA

G06F 1500

345434

A system and method for reducing an amount of memory that is needed to perform view clipping and model clipping of an input primitive in a geometry accelerator of a computer graphics system. The method includes view clipping the input graphics primitive with each view clipping boundary to determine a view-clipped geometry, storing view-clipped vertex data defining the view clipped geometry in memory, model clipping a view-clipped triangle forming the view-clipped geometry with each user defined model clipping plane to determine a model-clipped geometry, and storing model-clipped vertex data defining the model-clipped geometry in the memory in the memory locations previously occupied by said view-clipped vertex data. The method is repeated until each view-clipped triangle forming the view-clipped geometry has been model-clipped.

6184902, Feb 6, 2001

Apr 30, 1997

8/845975

Alan S. Krech - Fort Collins CO
Theodore G. Rossin - Fort Collins CO
Glenn W Strunk - Fort Collins CO
Michael S McGrath - Fort Collins CO
Edmundo Rojas - Fort Collins CO
S Paul Tucker - Fort Collins CO
Jon L Ashburn - Fort Collins CO
Ted Rakel - Fort Collins CO

Hewlett-Packard Company - Palo Alto CA

G06F 1516

345503

The invention provides for a system and method for minimizing space requirements and increasing speed in a geometry accelerator for a computer graphics system by providing a branch central intelligence mechanism. Architecturally, the geometry accelerator includes a plurality of processing elements (e. g. , an arithmetic logic unit, a multiplier, a divider, a compare mechanism, a clamp mechanism, etc. ) and a plurality of control units (e. g. , a transform mechanism, a decomposition mechanism, a clip mechanism, a bow-tie mechanism, a light mechanism, a classify mechanism, a plane equation mechanism, a fog mechanism, etc. ) that utilize the processing elements for performing data manipulations upon image data. In accordance with the invention, the control units are implemented in a read-only memory (ROM) via microcode. A next address field is associated with each of the microcode instructions and defines a location in the ROM of a next instruction to be executed.

5889997, Mar 30, 1999

May 30, 1997

8/866574

Glenn W. Strunk - Fort Collins CO

Hewlett-Packard Company - Palo Alto CA

G06F 945

395706

An assembler system enables efficient usage of space in a read only memory (ROM) that permits multiway instruction branching. Source code is analyzed and assembled by the assembler system and the assembler system then efficiently places the instructions in the ROM. The source code includes at least the following elements or an equivalent counterpart thereof: next state statements, nonaligned instructions, align statements, and aligned instructions. Next state statements serve as a flag to separate the various instructions. Nonaligned instructions are defined as those instructions that are nonaddressable by other instructions, i. e. , those instructions that are not branched to. Align statements serve as a flag to the assembler system that a plurality k (where k is equal to 2. sup. n and where n is a positive integer) of aligned instructions directly follow in succession. Furthermore, aligned instructions are defined as those that are addressable by a plurality of other instructions, i. e.

5956047, Sep 21, 1999

Apr 30, 1997

8/846363

Alan S. Krech - Fort Collins CO
Theodore G. Rossin - Fort Collins CO
Edmundo Rojas - Fort Collins CO
Michael S McGrath - Fort Collins CO
Ted Rakel - Fort Collins CO
Glenn W Strunk - Fort Collins CO
Jon L Ashburn - Fort Collins CO
S Paul Tucker - Fort Collins CO

Hewlett-Packard Co. - Palo Alto CA

G06F 1516

345503

The invention provides for a system and method for minimizing space requirements and increasing speed in a geometry accelerator for a computer graphics system. In architecture, the system is implemented as follows. The geometry accelerator includes a plurality of processing elements (e. g. , an arithmetic logic unit, a multiplier, a divider, a compare mechanism, a clamp mechanism, etc. ) and a plurality of control units (e. g. , a transform mechanism, a decomposition mechanism, a clip mechanism, a bow-tie mechanism, a light mechanism, a classify mechanism, a plane equation mechanism, a fog mechanism, etc. ) that utilize the processing elements for performing data manipulations upon image data. In accordance with the invention, the control units are implemented in a read-only memory (ROM) via microcode. A next address field is associated with each of the microcode instructions and defines a location in the ROM of a next instruction to be executed.

5883641, Mar 16, 1999

Apr 29, 1997

8/837875

Alan S. Krech - Fort Collins CO
Glenn W Strunk - Fort Collins CO

Hewlett-Packard Company - Palo Alto CA

G06F 1580

345505

A system and method for performing speculative execution of state machine operation in a graphics accelerator. In accordance with one aspect of the invention, the method includes the step of executing steps in a first state machine that is operating on a graphic primitive. As is known, a graphic primitive is defined by a plurality of vertices. In accordance with the invention, the preferred embodiment receives the coordinate parameters for the second to last primitive vertex. Then it evaluates one or more conditions that indicate whether steps in a second state machine need to be executed, based upon parameters of primitive vertices already received. It then branches to and begins executing steps in another state machine, based upon the tentative conditions, and continuing execution of the steps in the transformation state machine in parallel with the continued execution of the steps in the another state machine. After a predetermined number of states, the method reevaluates the one or more conditions, at which time the value of the one or more conditions is no longer tentative, but determinative of the next state information. Then, the method invokes a reset condition, aborts execution of the steps in the another state machine, and returns execution to a predetermined step in the first state machine, if the one or more conditions of the evaluating and reevaluating steps are inconsistent.