AU619055B2 - Method and apparatus for optimized depth cueing using short vectors - Google Patents

Method and apparatus for optimized depth cueing using short vectors Download PDF

Info

Publication number
AU619055B2
AU619055B2 AU43972/89A AU4397289A AU619055B2 AU 619055 B2 AU619055 B2 AU 619055B2 AU 43972/89 A AU43972/89 A AU 43972/89A AU 4397289 A AU4397289 A AU 4397289A AU 619055 B2 AU619055 B2 AU 619055B2
Authority
AU
Australia
Prior art keywords
line segment
intensity
intensities
values
value
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
AU43972/89A
Other versions
AU4397289A (en
Inventor
Chris Malachowsky
Curtis Priem
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sun Microsystems Inc
Original Assignee
Sun Microsystems Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Sun Microsystems Inc filed Critical Sun Microsystems Inc
Publication of AU4397289A publication Critical patent/AU4397289A/en
Application granted granted Critical
Publication of AU619055B2 publication Critical patent/AU619055B2/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G09EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
    • G09GARRANGEMENTS OR CIRCUITS FOR CONTROL OF INDICATING DEVICES USING STATIC MEANS TO PRESENT VARIABLE INFORMATION
    • G09G1/00Control arrangements or circuits, of interest only in connection with cathode-ray tube indicators; General aspects or details, e.g. selection emphasis on particular characters, dashed line or dotted line generation; Preprocessing of data
    • G09G1/06Control arrangements or circuits, of interest only in connection with cathode-ray tube indicators; General aspects or details, e.g. selection emphasis on particular characters, dashed line or dotted line generation; Preprocessing of data using single beam tubes, e.g. three-dimensional or perspective representation, rotation or translation of display pattern, hidden lines, shadows

Description

619055 COMMON WEALTHI OIV AUSTRALIA PAT ALI52 -QmrlL=SCJ1aLQRQ NAME ADDRESS OF APPLICANT: Sun Microsystems, ic.
2550 Garcia Avenue Mountain View Californ 941043 United States of America NAME(S) OF INVENTOR(S): Chris MALACI{OWSKY Curtis PRIE[M ADDRESS FOR SERVICE: DAVIES COLLISON Patent Attorneys 1 Little Collis Street, Melbourne, 3000.
COMPLETE SPECIFICATION FOR THE INVENTION ENTITLED: Methodand apparatus for optimized depth cuig using short vectors 4 The following statement is a full description of this invention, including performing it known to me/us:the best method of *r 4 *4a 4 4
I.
*i* BACKGROUND OF THE INVENTION 1. FIELD OF THE INVENTION: This invention relates to computer graphics systems and, more s particularly, to arrangements for varying the intensity of lines presented on computer displays in order to indicate a third dimension.
2. HISTORY OF THE PRIOR ART: In presenting three dimensional representations of figures or shapes on two dimensional output displays, some means must be used for indicating the third dimension. Various methods of accomplishing this result have evolved from standard drafting techniques. An example of this is perspective drawing.
15 Certain other techniques have developed because of the peculiarities of the computer display. For example, in bit-mapped and vector computer output displays which are presented on a cathode ray tube (CRT), a method used to indicate or cue the viewer to the different depths of portions of a line is to vary the intensity of the bits of a line as the depth of the line increases, Thus, for a line running from the viewer's position to infinity, the closest location of the line is given its fullest intensity and the farthest location its zero Intensity, The fading of the line from view provides the same effect as that given by Images as they extend progressively further from the viewer. This technique enhances the feeling of depth of the line on the output display.
The method of accomplishing the effect requires that each pixel have a different intensity value from a maximum to zero. In actual systems of the prior art, any individual line having a depth dimension is drawn by dividing the line length by the number of pixels and calculating an intensity value for each pixel. Thereafter, each individual pixel is written to the output display, a single pixel at a time. In color systems, If the line also varies in color along its length, the circuitry of such systems must calculate intensities for each of the colors red, 82225,P081 2/16/89 ~l~ BACKGROUND OF THE INVENTION 4u 4 4 4 4 OJ *4 4 r? 4 -r 4 ri 444* 4 4b 4 44 4OD 4 4i 4 4r 1. FIELD OF THE INVENTION: This invention relates to computer graphics systems and, more particularly, to arrangements for varying the intensity of lines presented on computer displays in order to indicate a third dimension.
2. HISTORY OF THE PRIOR ,RT: In presenting three dimensional representations of figures or shapes on two dimensional output displays, some means must be used for Indicating the third dimension. Various methods of accomplishing this result have evolved from standard drafting techniques. An example of this is perspective drawing.
1s Certain other techniques have developed because of the peculiarities of the computer display. For example, In bit-mapped and vector computer output displays which are presented on a cathode ray tube (CRT), a method used to indicate or cue the viewer to the different depths of portions of a line is to vary the intensity of the bits of a line as the depth of the line increases.
20 Thus, for a line running from the viewer's position to infinity, the closest location of the line is given its fullest Intensity and the farthest location Its zero intensity.
The fading of the line from view provides the same effect as that given by images as they extend progressively further from the viewer. This 25 technique enhances the feeling of depth of the line on the output display.
The method of accomplishing the effect requires that each pixel have a different intensity value from a maximum to zero. In actual systems of the prior art, any individual line having a depth dimension is drawn by dividing the line length by the number of pixels and calculating an Intensity value for each pixel. Thereafter, each individual pixel is written to the output display, a single pixel at a time. In color systems, If the line also varies in color along its length, the circuitry of such systems must calculate Intensities for each of the colors red, 1A 82225.P081 2/16/89 _i ;L i green, and blue separately, each from zero to one hundred percent Intensity.
The prior art arrangements for accomplishing this form of depth cueing require a separate calculation engine for the colors for each pixel.
s In Improving computer systems, the emphasis has boon on Improving the speed of operation of such systems. This Is especially true of systems using blt.mapped displays where the graphics output is tho point of the system which limits its speed, Consequently, providing depth cueing In three dimensional bitmapped graphics output systems has been speed limiting for the system.
It is, therefore, an object of the present invention to improve the speed of computer graphics systems, It is another object of the present Invention to provide an extremely rapid means of providing depth cueing in a computer graphics system.
An additional object of this Invention Is to provide a now technique for providing depth cueing in a three dimensional computer graphics system.
82225.P081 V/16189 I- -:rr -3- In accordance with the present invention, there is provided a computer graphics system comprising: a transformation engine for rotating and scaling X, Y and Z values of a line segment; depth cueing means coupled to said transformation engine for receiving said line segment values, wherein said depth cueing means, in use, determines intensities of points representing said line segments in three dimensions to be displayed on a computer output display, said intensities vary in accordance with a depth dimension of each point to be represented, and said depth dimension varies in accordance with said varying Z values; and a drawing engine coupled to said depth cueing means for providing X, Y and intensity values of said line segment to a frame buffer for presentation to a computer output display, said depth cueing means comprising: input means coupled to said transformation engine for receiving end points of said line segment; intensity means coupled to said input means for determining intensities of each end point of said line segment to be displayed; 25 median means coupled to said intensity means for Saveraging the intensities of the two end points of said line segment, said median means providing an averaged intensity value; and output means for rendering all points describing the line segment using the averaged intensity value to give a three dimensional appearance without modifying said system.
In accordance with the present invention, there is also provided a method for determining the intensities of points representing a line segment in three dimensions to be displayed on a computer output display of a computer 911018,P -I H SP.19Olsunmncr.Sp., 3A graphics system comprising a transformation engine for rotating and scaling X, Y and Z values of said line segment, depth cueing means coupled to said transformation engine for receiving said line segment values, a drawing engine coupled to said depth cueing means for providing X, Y, and intensity values of said line segment to a frame buffer for presentation to said computer output display, wherein said intensities vary in accordance with a depth dimension of each point of said line segment to be represented, said depth dimension varying in accordance with said varying Z values, said method comprising the steps of: determining the intensity of each end point of said line segment to be displayed; averaging the intensities of the two end points of said line segment; and providing a value for rendering all points describing the line segment at an intensity equal to an averaged value of the intensities of the two end points.
These and other objects and features of the I" invention will become apparent to those skilled in the 25 art by reference to the following detailed description of a preferred embodiment taken together with the several 4,I figures of the drawing in which like elements have been referred to by like designation; throughout the several views.
S
l 9 911018,P HHSIS'E.019,suunlcro.spi,4 BRIEF DEFSCRIPTION OF THE -DRAWINGS Figure I Is a side view Illustrating a viewers perspective of a three dimensional line; Figure 2 Is a view Indicating the manner In which the prior art describes a three dimensiohal tine on a bit-mapped computer display; Figure 3 Is a view Indicating the manner In which the Present invention describes a three dimensional line on a bit-mapped computer display; Figure 4 is a block diagram Illustrating a computer graphics system in accordance with the present Invention; 15 Figure 5 Is a block diagram illustrating a second computer graphics system in accordance with the present Invention; Figure 6 is a block diagram illustrating a specific circuit arrangement for the computer graphics system of Figure 5; and 44 4 4 44 4 44 4 4 44 4 44~ 44,4 4 4, 44 44 44 4 4- 4 44-44 4444 Figure 7 Is a diagram useful In explaining the transform used !n the 4144 4- 4 4 44- system.
It ~,4 44 4 4 4 82225,POSI2169 2/16/89 I.OTATION AND NOMENCLATURE Some portions of the detailed descriptions which follow are presented In terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled In'the data processing arts to most effectively convey the substance of their work to others skilled in the art.
An algorithm is here, and generally, conceived to be a selfconsistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. it has proven convenient at times, principally for reasons of o oo is common usage, to refer to these signals as bits, values, elements, symbols, 0 o a characters, terms, numbers, or the like. It should be borne in mind, however, that a °all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities.
0*00 !o Further, the manipulations performed are often referred to In terms, such as adding or comparing, which are commonly associated with mental operations performed by a human operator. No such capability of a human operator is necessary or desirable In most cases in any of the operations described herein which form part of the present invention; the operations are machine operations. Useful machines for performing the operations of the present invention include general purpose digital computers or other similar devices. In all cases the distinction between the method operations In operating a computer and the method of computation itself should be borne in mind. The present Invention relates to method steps for operating a computer in processing electrical or other mechanical, chemical) physical signals to generate other desired physical signals.
82225.P081 2/16/89 The present Invention also relates to apparatus for performing these operations. This apparatus may be specially constructed for the required purposes or it may comprise a general purpose computer as selectively activated or reconfigured by a computer program stored in the computer. The algorithms presented herein are not inherently related to any particular computer or other apparatus. In particular, various general purpose machines may be used with programs written in accordance with the teachings herein, or it may prove more convenient to construct more specialized apparatus to perform the required method steps. The required structure for a variety of these machines will appear from the description given below.
4 4 I I* B2225,P081 2/16189
'I
i- I i -Lllii i :ii.lii-i-iL.:iiiili.ii~- :i Xii*IL~~liliil~~ii-~ii DESCRIPTION OF THE PREFERRED EMBODIMENT In presenting three dimenJonal representations on two dimensional output displays of computer systems, some means must be used for Indicating the third dimension to the viewer. One method of accomplishing this result In a bit mapped computer output display which is usually presented on a cathode ray tube (CRT),is to Indicate or cue the viewer to the different depths of portions of a line by varying the intensity of the bits of a line as the depth of the line Increases.
The fading of the line from view on the screen enhances the feeling of depth because it conveys the same effect as do real Images as they recede progressively further from the viewer.
The way this is done by the prior art is to give the closest location of a line its fullest intensity, the farthost location zero intensity, and intervening is locations intensities varying with the distance from the eye. Figure 1 illustrates a line 10 lying in a three dimensional cube 12 of space. The cube 12 Is provided with a Y axis, an X axis, and a Z axis to indicate the three dimensions of space in a conventional manner. The eye 14 of a viewer is also shown.
In Figure 1, an endpoint A of the line 10 nearest the eye 14 of the viewer is indicated to be bright and an endpoint B farthest from the viewer is indicated to be dark. In fact, the endpoint B is given a color to blend with the background color of the display in most prior art arrangements. In this manner, the line 10 appears to disappear into the background.
The method of accomplishing the effect in a system using a bitmapped output display requires that each pixel defining the line have a different intensity value varying from a maximum to zero. In actual systems, the line is drawn by dividing the line length by the number of pixels and calculating an intensity value for each pixel. Figure 2 illustrates the actual bits of the line shown in Figure 1 with percentage values applied to the bit positions from the brightest point at A (100%) to the least bright point B 82225.P081 -7- L.
WMMMU
i 1 *0 0 0* 0 0 0 0* 0 0 0 ng0 *00 0 4b 04 o 4t 04 $I .4 4 4.
In general, most Individual lines are displayed with but a single color; however, many graphics displays may well present a Ine which changes in color from one end to the other. For a system to handle such a situation, the circiltry of the system must include separate calculation engines which calculate intensities for each pixel of each of the colors red, green, and blue separately, each from zero to one hundred percent Intensity. Such an operation Is extremely time consuming and Is one of the reasons computer graphics displays are so slow.
As computer systems have improved, the emphasis at each step has been on improving the speed of operation of such systems. This Is especially true of computer systems using bit-mapped displays where the graphics output is slowest and thus becomes the limiting point of the system.
Consequently, providing depth cueing in three dimensional bit-mapped graphics is output systems has been speed limiting for the system.
In designing computer systems, it ha.' become apparent that the display of graphic images substantially slows the operation of most computers.
This occurs because the amount of information that the computer must deal with 20 for each frame to be presented on the output display Is very large and because the manipulation of that Information to present the graphics image requires Inordinate use of the central processing unit (CPU).
The system of which the invention is a part reduces the delay inherent in the normal systems used for displaying computer graphics by handling most of the operations in hardware so that the information is available instantaneously. In order to allow the use of hardware to implement the presentation of graphics, it has been found that the Information presented to the hardware must, as viewed by that hardware, appear to be of essentially the same o3 nature no matter what the shape to be presented on the display. In this manner, decisional steps need not be taken to determine what type of information is involved, slowing the processing time. This invention is part of a system which is based on breaking the graphics images to be presented into quadrilaterals all of 82225,P081 2116/89 which may be handled In the same manner by the graphics presentation hardware and recombined on the display to present the desi red shape, The system decomposes these quadrilaterals Into pairs of line segments each of which subtend the same output display scan lines, Thus, each quadrilateral Is s decomposed Into a series of line segment pairs which define the minimum set of trapezoids required to properly reconstruct, the quadrilateral In the display memory. The X and Y coordinates of the two ends of each scan line between the line segments are then determined. Using only these two points, each scan line may be defined without the necessity of determining Intermediate pixels, The endpoints of each scan line may be stored In a frame buffer and displayed on an output display. This is accomplished In hardware so that an Insignificant delay occurs In the translation and the output to the display is not delayed.
Various portions of the system above described are more particularly described In the following patent applications, all of which are assigned to the assignee hereof: Serial No. 07/297,475, HARDWARE 04*0 IMPLEMENTATION OF CLIPPING AND INTER-COORDINATE COMPARISOki LOGIC, Malachowsky and Priem; Serial No. 07/297,604, APPARATUS AND METHOD FOR PROCESSING GRAPHICAL INFORMATION TO MINIMIZE PAGE CROSSINGS AND ELIMINATE PROCESSING OF INFORMATION OUTSIDE A PREDETERMINED CLIP, Malachowsky and Priem; Serial No.
0 4 4 07/297,590, APPARATUS AND METHOD FOR LOADING COORDINATE REGISTERS FOR USE WITH A GRAPHICS SUBSYSTEM UTILIZING AN INDEX REGISTER, Malachowsky and Priem; Serial No. 07/297,093, APPARATUS AND METHOD FOR USING A TEST WINDOW IN A GRAPHICS SUBSYSTEM WHICH INCORPORATE HARDWARE TO PERFORM CLIPPING OF IMAGES, Malachowsky and Priem; Serial No. 07/287,392, filed December 20, 1988, METHOD AND APPARATUS FOR SORTING LINE SEGMENTS FOR DISPLAY AND MANIPULATION BY A COMPUTER SYSTEM, Malachowsky and Priem; Serial No. 07/286,997, filed December 20, 1988, METHOD AND APPARATUS FOR DETERMINING LINE POSITIONS FOR DISPLAY AND MANIPULATION 82225,PO8I 2/16/89 it I I ij h s BY A COMPUTER SYSTEM, Malachowsky and Priam; Serial No. 07/287,493, filed December 20, 1988, METHOD AND APPARATUS FOR TRANSLATING RECTILINEAR INFORMATION INTO SCAN LINE INFORMATION FOR DISPLAY BY A COMPUTER SYSTEM, Malachowsky and Priom; and Serial No.
5 07/287,128, filed December 20,1988, METHOD AND APPARATUS FOR DECOMPOSING A QUADRILATERAL FIGURE FOR DISPLAY AND MANIPULATION BY A COMPUTER SYSTEM, C. Malachowsky.
If the system described were to utilize the conventional manner of to providing depth cueing In which each of the Individual pixels would have to be computed, the entire system would be slowed to approximately one-tenth of its actual speed.
The present Invention eliminates the need to determine the number of pixels which are used to describe a line having depth, the need to assign different intensities to each pixel, and the need to describe each of the pixels, one at a time. The Invention relies on one basic assumption. The first of these is that most lines described on an output display are short. This is especially true in molecular modelling, one of the more advanced uses of a graphics display, where all of the vectors displayed are exceedingly short. In other uses such as describing the wing of an airplane where one might assume that a number of very long vectors are used the actual lines are often found to be composed of a large number of very short line segments.
The system of the present invention accomplishes depth cueing without the time consuming operations of the prior art arrangement by computing the Intensity of the two end points of each line segment to be described on the output display, averaging the Intensity of the two end points, and using this average Intensity to describe all of the points connecting the two end points of the line. Consequently, the system operates at a rate approximately ten times the rate it would otherwise operate.
8222S.P081 -10- 2/16189 82225.POB1 -1 0~ 2)15/89 Figure 3 Is a diagram Illustrating a line 20 drawn according to the present Invention, The line 20 is comprised of a number of line segments Joining the points B, C, D, and F. Also shown are mid-points E and G of the line segments CD and DF, respectively. In order to provide depth cueing, the system determines for each of the Individual line segments shown the Intensity of the end points of that line segment. It then averages these two Intensities and draws the entire line segment at that intensity. For example, to render the line segment CD, the Intensities of the points C and D &re determined and averaged; and the line segment CD is drawn at the average intensity of the mid-point E. In like manner, to render the line segment DF, the Intensities of the points D and F are determined and averaged; and the line segment DF Is drawn at the average intensity of the mid-polnt G. As may be seen, since the point C has a higher intensity than the point D and, likewise, the point D has a higher intensity than the point F, the average value of intensity at point E used for rendering the line segment CD is greater than the average value of Intensity at point G used for rendering the line segment DF. Thus the Intensities of the' line segments vary decreasingly as the line recedes from the viewer. With short lne segments, the effect of this rendering of intensities is to provide depth cueing to the viewer.
Systems utilizing the present invention demonstrate the effectiveness of the depth cueing provided by the invention without the slowing effect of depth cueing arrangements of the prior art methods of accomplishing the effect. As pointed out, the speed accrues because the invention draws the whole line at a single intensity no matter how many pixels are involved in the line.
The removal of the requirement to compute and describe the individual pixels eliminates a substantial portion of the bottleneck to speed of the prior art systems.
Examples of systems using the invention have demonstrated that the Invention does, In fact, provide depth cueing without any of the detrimental effects which might be expected such as color banding in which the colors of the system appear to change in Jumps. Again, this is because most line segments described by computer graphics systems are very short line segments.
82225.P081 -11- 313/89 ila 'i i I i il I In situations in which the line segments are not short, it is possible to use the teachings of this invention by simply breaking the longer line segments into shorter line segments and describing the shorter line segments each at their average intensities. Figure 3 illustrates a second line segment 30 which is, in fact, a single straight line. In order to use the present Invention, the line segment is broken into the shorter line segments MN, NO, OP, PQ, QR, and RS and described by the Intensities at the mid-points of each of these short line segments.
Figure 4 illustrates In block diagram form a computer graphics system 40 utilizing the present invention. The system 40 Includes a transformation engine 42, a central processor 44, a line drawing engine 46, a frame buffer 48, and an output display 50 such as a cathode ray tube. The circuitry of all of these Individual components may be of a type well known to the prior art although their association is distinct therefrom. For example, the transformation engine 42 receives as input the X, Y, and Z values of each Individual point to be described on the output. The engine 42 utilizes circuitry well known to the prior art to transform the original coordinates of the point by rotation, translation, scaling or perspective to accomplish whatever is to be done to the particular point, Normally this provides an output having new X, Y, and Z values.
In the system 40 of the present invention the Z values may be directly utilized to provide intensity values for the points. That is, the Input Z values Is operated on by the transformation engine 42 so that the output gives a new X, Y, and an intensity value. The new Intensity value Is directly related to the Z value which would normally be produced but has a percentage Intensity level from 100% at the display to 0% at the least point.
The method by which the transformation engine accomplishes the conversion of Z values to intensity values is an extension of the normal transformation operation. The normal transformation operation applies a four-byfour transform which Is the result of applying matrices which Individually 82225,P081 .12- 33/3189 represent the translation, rotation about the desired axes, and scaling transforms to the X, Y,'and Z values. In the present invention the four-by-four matrix may be realized by including a transform representing the cueing operation. Such a transform is represented by the concatenation of the standard transformation s matrices which may be found in Chapter 22, Principles of Interactive Computer Graphics. 2d. Edition, Newman and Sproull, McGraw-Hill Book Co., with a transform representing the cueing operation.
The cueing operation may be termed the Z-to-intenslty conversion 1o transform. It is reached using Figure 7 of the drawing as follows: I (Imax Imin) Zmin) I (Zmax Zmin) Imin, where Z is the Z value of a point of Interest, Zmin Is the Z value of the object closest to the screen, and Zmax is the Z value of object farthest from the screen, imax and Imin are the maximum and minimum values of grey scale levels available.
I* I a A particular transform which Is a concatenation of equation 22-1 for translation and equation 22-5 for scaling along with the Z-to-I conversion transform from Principles of Interactive Computer Grahics. and therefore 4 accomplishes the conversion for translation, scaling, and Z-to-l conversion is: S[X YZ 1 00 0 Y' m1] 0100 0 0 ZsO 0 0Zt 1 Where Zs m (Imax Imin) (Zmax Zmin) Zt Imln Zmn (Imax Imn) (Zmax Zmin).
In this transform, only the Z values are changed since these are the only values of interest.
Then I' Z Zs Zt.
82225.P081 -13- 313189 The values for Intensity of the two ends of a line segment to be rendered which are provided by the transformation engine 42 are added by the CPU 44 and divided by two to give an average Intensity value. This average intensity value is handed to the drawing engine 46. In the preferred embodiment of the invention, the drawing engine 46 describes a line segment by drawing a straight line between these two endpolnts at the average Intensity. A drawing engine such as that of the preferred embodiment is described in the abovementioned patent applications descrbing various portions of the system. The drawing engine 46 provides the line values to the frame buffer 48 for presentation on the output display A second system 60 constructed in accordance with the Invention is shown in Figure 5. Such a system may be utilized in situations In which the system CPU does not have direct access to the component elements of the graphics systems. This is the more usual arrangement. In the system 60, the transformation engine 42 provides transformed X, Y, and I values derived from the X, Y, and Z values furnished to it for both ends of each line segment in a manner well known to the prior art. These output values are transferred to an intensity calculator 62 which provides output values of the X, Y, and average intensity values for each line segment. These values are transferred to the line drawing engine 46 described above for transfer to the frame buffer 48 and later rendering on the output display An Intensity calculator 62 Is illustrated in Figure 6. The converter 62 comprises an adder circuit 64 constructed In a manner well known to the prior art. The adder 64 receives the two transformed I values from the transform engine 42, and adds those two values to give a result. This result is transferred to a shift register 66 which shifts the result by one bit, dropping the lowest order bit to accomplish a division by two. This result is furnished to the drawing engine 46 of Figure 5 to represent the average intensity of the line segment.
The speed of the operation of the system of the invention might be further enhanced by simply using the Intensity of the beginning or end point of an 82225,P081 *14- 3/3/89 4 Individual line cogmont to render the entire line segment, In such a case, the system need not average the two Intensities to compute a midpoint Intensity, t0 oven greater speeds are attained.t t Is also possible to utilize the Invention to draw lines which vary in color from one end to the other. Such an arrangement requires that each color be Individually describod but the Intensity of such color may be averaged over the Individual line segments just as described for one color line sogmonts above.
Although the present Invention has boon described in terms of a 1 o preferred embodiment, It will be appreciated that vadous modifications and alterations might be made by those skilled In the art without departing from the spirit and scope of the Invention. The invention should therefore be measured in terms of the claims which follow.
82225.P081 .15- 313/89

Claims (9)

1. A computer graphics system comprising: a transformation engine for rotating and scaling X, Y and Z values of a line segment; depth cueing means coupled to said transformation engine for receiving said line segment values, wherein said depth cueing means, in use, determines intensities of points representing said line segments in three dimensions to be displayed on a computer output display, said intensities vary in accordance with a depth dimension of each point to be represented, and said depth dimension varies in accordance with said varying Z values; and i 15 a drawing engine coupled to said depth cueing means 1 for providing X, Y and intensity values of said line Ssegment to a frame buffer fr- presentation to a computer i output display, said depth cueing means comprising: input means coupled to said transformation engine i 20 for receiving end points of said line segment; intensity means coupled to said input means for determining intensities of each end point of said line I segment to be displayed; median means coupled to said intensity means for averaging the intensities of the two end points of said line segment, said median means providing an averaged Sintensity value; and output means for rendering all points describing the line segment using the averaged intensity value to give a three dimensional appearance without modifying said system.
2. A computer graphics system as claimed in Claim 1 wherein said intensity means for determining the intensities of each end point of said line segment comprises means for converting the Z value of each end point of said line segment to an intensity value. 4 i i S 911018,PHHSP.019,sunmiro.sp,18 3I (7
3. A computer graphics system as claimed in Claim 2 wherein said means for converting the Z value of each end point of said line segment to an intensity value comprises means for applying a transform to said Z values.
4. A computer graphics system as claimed in Claim 1 wherein said median means averaging the intensities of the two end points comprises an adder for summing the intensity values of the two end points of said line segment and providing a result, and means for dividing the result by two.
A computer graphics system as claimed in Claim 4 wherein the means for dividing the result by two comprises a shift register.
6. A method for determining the intensities of points representing a line segment in three dimensions to be displayed on a computer output display of a computer o. graphics system comprising a transformation engine for rotating and scaling X, Y and Z values of said line segment, depth cueing means coupled to said transformation engine for receiving said line segment 25 values, a drawing engine coupled to said depth cueing means for providing X, Y, and intensity values of said line segment to a frame buffer for presentation to said computer output display, wherein said intensities vary in accordance with a depth dimension of each point of said line segment to be represented, said depth dimension varying in accordance with said varying Z values, said method comprising the steps of: determining the intensity of each end point of said line segment to be displayed; averaging the intensities of the two end points of said line segment; and providing a value for rendering all points
911018.1Hl l SP.019,sunui kJop,19 -1 describing the line segment at an intensity equal to an averaged value of the intensities of the two end points.
7. A method as claimed in Claim 6 wherein the step of determining the intensities of each end point of a line segment comprises converting the Z value of each such point to an intensity value.
8. A method as claimed in Claim 7 wherein the step of converting the Z value of each such point to an intensity value comprises applying a transform to such Z values.
9. A method as claimed in Claim 6 wherein the step of S* averaging the intensities of the two end points comprises summing the intensity values of the two end points of a line segment, and dividing the result by two. A method as claimed in Claim 9 wherein the step of dividing the result by two comprises shifting the result in a shift register. 11. A method as claimed in Claim 6 wherein the step of Sproviding a value for rendering all points describing the line segment at an intensity equal to the average value S' 25 of the intensities of the two end points comprises furnishing the value to a drawing engine for writing to a frame buffer. 12. A computer graphics system substantially as rA 30 hereinbefore described with reference to the drawings. M^S S 911018,PHHSP Q19,sunmfcos 13. A method for deterining the intensities of points substantially ais hereinbefore dnscribed with reference to the drawings. DATED this 18th day of October, 1991. SUN MICROSYSTEMS, INC. By its Patenit Attorneys DAVIES COLLISON 9 1 18y11I1SPP-0 19,sukospe,21
AU43972/89A 1989-03-03 1989-10-30 Method and apparatus for optimized depth cueing using short vectors Ceased AU619055B2 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US31947989A 1989-03-03 1989-03-03
US319479 1989-03-03

Publications (2)

Publication Number Publication Date
AU4397289A AU4397289A (en) 1990-09-06
AU619055B2 true AU619055B2 (en) 1992-01-16

Family

ID=23242406

Family Applications (1)

Application Number Title Priority Date Filing Date
AU43972/89A Ceased AU619055B2 (en) 1989-03-03 1989-10-30 Method and apparatus for optimized depth cueing using short vectors

Country Status (4)

Country Link
AU (1) AU619055B2 (en)
CA (1) CA2011407A1 (en)
GB (1) GB2228849B (en)
HK (1) HK48394A (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5368033A (en) * 1993-04-20 1994-11-29 North American Philips Corporation Magnetic resonance angiography method and apparatus employing an integration projection

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0221704A2 (en) * 1985-10-21 1987-05-13 Sony Corporation Video signal processing
EP0262619A2 (en) * 1986-09-29 1988-04-06 Kabushiki Kaisha Toshiba Shading circuit for shading a plurality of polygons which constitute a solid model, and method of shading the same
AU4660089A (en) * 1988-12-05 1990-06-26 Rediffusion Simulation Limited Image generator

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0221704A2 (en) * 1985-10-21 1987-05-13 Sony Corporation Video signal processing
EP0262619A2 (en) * 1986-09-29 1988-04-06 Kabushiki Kaisha Toshiba Shading circuit for shading a plurality of polygons which constitute a solid model, and method of shading the same
AU4660089A (en) * 1988-12-05 1990-06-26 Rediffusion Simulation Limited Image generator

Also Published As

Publication number Publication date
GB2228849A (en) 1990-09-05
HK48394A (en) 1994-05-27
GB2228849B (en) 1993-08-18
GB8923816D0 (en) 1989-12-13
CA2011407A1 (en) 1990-09-03
AU4397289A (en) 1990-09-06

Similar Documents

Publication Publication Date Title
US7675526B2 (en) System and method for multi-sampling primitives to reduce aliasing
US8610729B2 (en) Floating point computer system with fog
US6115047A (en) Method and apparatus for implementing efficient floating point Z-buffering
US5268995A (en) Method for executing graphics Z-compare and pixel merge instructions in a data processor
US6181352B1 (en) Graphics pipeline selectively providing multiple pixels or multiple textures
US20030184551A1 (en) Area pattern processing of pixels
US6476810B1 (en) Method and apparatus for generating a histogram of a volume data set
US5003497A (en) Method for three-dimensional clip checking for computer graphics
JPH09500462A (en) Computer graphics system with high performance multi-layer z-buffer
US6661423B2 (en) Splitting grouped writes to different memory blocks
EP0913795B1 (en) Image generation apparatus, image generation method, image generation program recording medium, image composition apparatus, image composition method, and image composition program recording medium
US5128872A (en) Method and apparatus for determining line positions for display and manipulation by a computer system
US4945497A (en) Method and apparatus for translating rectilinear information into scan line information for display by a computer system
US6731303B1 (en) Hardware perspective correction of pixel coordinates and texture coordinates
AU619055B2 (en) Method and apparatus for optimized depth cueing using short vectors
US7145570B2 (en) Magnified texture-mapped pixel performance in a single-pixel pipeline
US6784895B1 (en) Programmable multiple texture combine circuit for a graphics processing system and method for use thereof
US6515661B1 (en) Anti-aliasing buffer
US6847372B2 (en) Magnified texture-mapped pixel performance in a single-pixel pipeline
US6778174B1 (en) Method and apparatus for attribute processing with an active pipeline stage in a data processing system
AU618129B2 (en) Method and apparatus for sorting line segments for display and manipulation by a computer system
GB2234412A (en) Method and apparatus for spatial anti-aliased depth cueing
Fan et al. Streaming collision detection using programmable graphics hardware

Legal Events

Date Code Title Description
MK14 Patent ceased section 143(a) (annual fees not paid) or expired