Computer graphics priority system with antialiasing
First Claim
1. A process for resolving priority at specific locations of designated coordinate values of x and y for a graphics display between a first primitive P1 defined in conventional three-dimensional space in a plane a1 x+b1 y+c1 z+d1 =0 and a second primitive P2 similarly defined in a plane a2 x+b2 y+c2 z+d2 =0, said planes potentially although not necessarily intersecting along a projected line of intersection in said display, comprising the steps of:
- defining said projected line of intersection by determining the values of (c2 a1 -c1 a2), (c2 b1 -c1 b2) and (c2 d1 -c1 d2);
storing the determined values (c2 a1 -c1 a2), (c2 b1 -c1 b2) and (c2 d1 -c1 d2);
storing picture element data to define elemental areas of said graphics display;
resolving priority for said elemental areas in sequence as between said primitives for said display to determine precedence in favor of one of said primitives P1 or P2 under control of c1, c2, and one or more of (c2 a1 -c1 a2), (c2 b1 -c1 b2) and (c2 d1 -c1 d2); and
storing display data of said one primitive for said elemental areas to provide electrical signals for the graphics display.
3 Assignments
0 Petitions
Accused Products
Abstract
Image data is composed from primitives (polygons) to attain data for displays with the removal of hidden surfaces and smooth-appearing edges. Defined polygons are tested for priority in a determined field of vision by scan conversion to specify individual picture elements (pixels). Polygon contention for pixels is resolved by determining the edge of intersection between the planes of such polygons and testing the signs of certain values in accordance with predetermined criteria. Subpixel priority is treated for similar resolution to provide improved antialiased images.
-
Citations
20 Claims
-
1. A process for resolving priority at specific locations of designated coordinate values of x and y for a graphics display between a first primitive P1 defined in conventional three-dimensional space in a plane a1 x+b1 y+c1 z+d1 =0 and a second primitive P2 similarly defined in a plane a2 x+b2 y+c2 z+d2 =0, said planes potentially although not necessarily intersecting along a projected line of intersection in said display, comprising the steps of:
-
defining said projected line of intersection by determining the values of (c2 a1 -c1 a2), (c2 b1 -c1 b2) and (c2 d1 -c1 d2); storing the determined values (c2 a1 -c1 a2), (c2 b1 -c1 b2) and (c2 d1 -c1 d2); storing picture element data to define elemental areas of said graphics display; resolving priority for said elemental areas in sequence as between said primitives for said display to determine precedence in favor of one of said primitives P1 or P2 under control of c1, c2, and one or more of (c2 a1 -c1 a2), (c2 b1 -c1 b2) and (c2 d1 -c1 d2); and storing display data of said one primitive for said elemental areas to provide electrical signals for the graphics display. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A hidden surface elimination system for resolving priority as between primitives for a computer graphics image display with respect to picture element areas, the primitives P1, P2 and so on being defined in planes, a1 x+b1 y+c1 z+d1 =0;
- a2 x+b2 y+c2 z+d2 =0 and so on, the hidden surface elimination system comprising;
means for receiving primitive data to specify components for a computer graphics display in the form of said primitives P1 and P2 and so on; structure for sequencing said picture element areas to be occupied by said primitives P1 and P2 as specified by the received primitive data to identify primitives contending for a picture element area; structure for resolving priority between primitives P1 and P2 contending for a pixel area, by determining the values (c2 a1 -c1 a2), (c2 b1 -c1 b2) and (c2 d1 -c1 d2) and logically analyzing the signs of certain of the values to select one of said contending primitives P1 or P2 for the picture element area; and cache memory means for receiving the determined values (c2 a1 -c1 a2), (c2 b1 -c1 b2) and (c2 d1 -c1 d2) and means for identifying said values for use on occurrence of another pixel with contention between the primitives P1 and P2.
- a2 x+b2 y+c2 z+d2 =0 and so on, the hidden surface elimination system comprising;
-
13. A hidden surface elimination system for resolving priority as between primitives for a computer graphics image display with respect to picture element areas, the primitives P1, P2 and so on being defined in planes, a1 x+b1 y+c1 z+d1 =0;
- a2 x+b2 y+c2 z+d2 =0 and so on, the hidden surface elimination system comprising;
means for receiving primitive data to specify components for a computer graphics display in the form of said primitives P1 and P2 and so on; structure for sequencing said picture element areas to be occupied by said primitives P1 and P2 as specified by the received primitive data to identify primitives contending for a picture element area, said structure for sequencing comprising a raster converter for scan converting said primitives; and memory means for receiving the determined values (c2 a1 -c1 a2), (c2 b1 -c1 b2) and (c2 d1 -c1 d2) and means for identifying said values for use on occurrence of another pixel with contention between the primitives P1 and P2. - View Dependent Claims (14, 15, 16)
- a2 x+b2 y+c2 z+d2 =0 and so on, the hidden surface elimination system comprising;
-
17. A hidden surface elimination system for resolving priority as between primitives for a computer graphics image display with respect to picture element areas, the primitives P1, P2 and so on being defined in planes, a1 x+b1 y+c1 z+d1 =0;
- a2 x+b2 y+c2 z+d2 =0 and so on, the hidden surface elimination system comprising;
means for receiving primitive data to specify components for a computer graphics display in the form of said primitives P1 and P2 and so on; structure for sequencing said picture element areas to be occupied by said primitives P1 and P2 as specified by the received primitive data to identify primitives contending for a picture element area; a polygon memory for storing data on said polygons; a mask memory for storing data on said picture element areas; structure for resolving priority between primitives P1 and P2 contending for a pixel area, by determining the values (c2 a1 -c1 a2), (c2 b1 -c1 b2) and (c2 d1 -c1 d2) and logically analyzing the signs of certain of the values to select one of said contending primitives P1 or P2 for the picture element area; and means for storing signal indications of said one contending primitive in said mask memory. - View Dependent Claims (18, 19, 20)
- a2 x+b2 y+c2 z+d2 =0 and so on, the hidden surface elimination system comprising;
Specification