Iterative real-time XY raster path generator for bounded areas

Abstract: Apparatus for defining a step-by-step path through pixels located at the intersections of rectilinear coordinates that lie between boundaries that cross one set of coordi­ nates. The respective distances of each of a pattern of pixels from one boundary and the distance between boundaries as well as the direction of the last step in the path are applied to a ROM to determine whether the next step is along one type of cordiate or the other or along a diagonal.

Description: The invention relates to an apparatus for generating a step-by-step path from a current pixel that extends through pixels located at intersections of first and second sets of rectilinear coordinates that lie between first and second boundaries. In U.S. Patent No. 4,471,449 issued on September 11, 1984 to Steven C. Leavitt et al, entitled "Scan Conversion System", and assigned to Hewlett-Packard Company, apparatus is described for deriving from analog signals produced along each of a plurality of radial lines in a sector data values that are to be displayed at pixels at rectilinear coordinates along parallel raster lines of a cathode ray tube. After two adjacent radial lines of raw data have been received and data is just beginning to be received along a third radial line, a state machine defines a step-by-step path through all of the pixels located in the slice between the radial lines. The steps are one pixel in length and go along the X or Y axis as required. By starting from a pixel location having a known radius and angular position with respect to the radial lines and iteratively adding certain values at each step, the radius and angular position of each pixel can be determined. The analog data along the radial lines is sampled and means utilizing the radial position of each pixel as it is attained selects four samples of raw data. A first intermediate interpolated data value is derived at the radius of the pixel from the two samples on one radial line, and a second interpolated data value is derived at the radius of the pixel from the two data samples on the other radial line. A final data value for display at each pixel is derived by interpolating the first and second interpolated data values. This process is carried out for every pixel in each slice in the sector. Whereas it works very well, the path of pixels for each slice is different and is effectively stored in memory associated with the state machine. If it should be desired to expand a given portion of the sector, a feature normally referred to as "zoom", new paths through the pixels of each slice containing a portion of the selected area would have to be provided for each degree of magnification. A large amount of memory would be required for each degree of magnification, and it would not be practicable to provide continuous zoom from one magnification to the other. An example of a system for shading areas on a raster scan screen, i.e. for finding points within boundaries, is disclosed in IEEE transactions on computers, vol. c-28, No. 7, July 1979, pages 528 to 531. In this document an algorithm is discribed for determining whether intersections in a rectilinear coordinate system are within certain boundaries or not. However, this document does not teach how to generate a raster path. Accordingly, the invention provides an apparatus for generating a step-by-step path from a current pixel that extends through pixels located at intersections of first and second sets of rectilinear coordinates that lie between first and second boundaries, comprising the features of claim 1. In accordance with this invention, the steps in the path through the pixels of a slice are calculated one at a time on a real-time basis by an iterative process. As each pixel in the path is reached, a determination is made as to whether each of a pattern of nearby test pixels is outside of the slice defined by the radial lines. From this determination and an indication of the direction in which the path approached the current pixel, the next step in the path is selected. In some cases, this next step will be to a pixel that is outside of the slice in order that a particular pixel be reached; but in such case, it is declared invalid. The pattern includes pixels in the same row as the current pixel in the path on either side thereof, a pixel in the same column as the current pixel, and a pixel in the same column as the pixel between the current pixel and the outer radial line, the latter two pixels being in a row adjacent the row in which the current pixel is located and on the side remote from the apex of the sector. If the angle of the sector is greater than 45°, an additional pixel is provided in the adjacent row and one column closer to the outer radial lines. The same procedure can be used in defining a path through pixels in a slice defined by parallel lines. FIGURE 1A illustrates parallel boundaries of pixels through which a path is to be determined; FIGURE 1B illustates radial boundaries of pixels through which a path is to be determined; FIGURE 1C illustrates a typical path through pixels between radial boundaries as well as certain parameters of the system; FIGURE 2 is a block diagram of a system incorporating the invention; FIGURE 3 is a Karnaugh map used in the invention when a test pixel P₄ is inside the outer boundary; FIGURE 4 is a Karnaugh map used in the invention when a test pixel P₄ is outside of the outer boundary; and FIGURES 5, 6, 7 and 8 illustrate how the invented apparatus determines a step in the paths for respectively different situations. FIGURE 1A illustrates a slice through a field of pixels that lies between two parallel lines L I and L O ; and FIGURE 1B illustrates a slice through a field of pixels that lies between an inner radial line R I that is closer to the center line CL of a sector S and an outer radial line R O that is farther away from the center line CL. Samples of raw data can be attained along the lines L I and L O or along the radial lines R I and R O as indicated by the dots. Although the invention will be described as defining a path through a slice between radial lines R I and R O of the sector S of FIGURE 1B, it can easily be used to define a path through the pixels of a slice between parallel lines L I and L O of FIGURE 1A. FIGURE 1C shows a portion of a slice between radial lines R I and R O . In the upper portion, there is a path PT shown that passes through the pixels shown as data that are at the intersections of equally spaced rows and columns. The path goes from a starting pixel P F through the other pixels in the direction of the arrows therein. By an arbitrary decision, pixels located on both of the radial lines R I or R O are considered to be within the slice. At each pixel in the path PT, the next pixel in the path is selected. Therefore, in the interest of saving time, it is desirable that the path PT not pass through pixels that are outside of the slice. This requires diagonal moves such as d₁ through d₄. In some situations that will be illustrated, however, the path will pass through pixels outside of the slice in order to avoid missing a pixel that is in the slice. At this point, certain terms must be defined. XHAT is the distance between boundary lines of a slice such as R I and R O as measured along a row of pixels. As used herein, it means the distance measured along the row where the current pixel P C is located, e.g., row C. XHAT NEXT is the distance between the boundary lines R I and R O as measured along the next outward row of pixels, such as CN. In a situation such as FIGURE 1A where the boundary lines L I and L O are parallel, XHAT will equal XHAT NEXT; but where the boundary lines are radial such as R I and R O of FIGURE 1B, XHAT NEXT is greater than XHAT by ΔY/ΔX times |tan ϑ O -tanϑ I | = DXHAT. In this particular embodiment of the invention, COUNT is the distance as measured along a row from the outer boundary line such as R O to the pixel of interest in FIGURE 1C. The dimension of COUNT for the pixel P₃ is shown. Note that in this case it is slightly less than the distance ΔX=1 between pixels because the next pixel to the right, P X has COUNT negative. The value of COUNT increases by what is called DCOUNTY for each step from one row of pixels to the next. When the step is along a diagonal such as d₁ through d₄, COUNT changes by DCOUNTY-1. This is illustrated by a step from P to P′ in FIGURE 1C. DCOUNTY is equal to ΔY/ΔX times tanϑ O , where ϑ O is the angle of the outer radial line. If the value of COUNT at the first pixel P F in the path is "0", the accumulated value of the changes in COUNT noted above will be positive if the pixel in question is inside of R O and negative if the pixel is outside of R O , e.g., the value of COUNT for the pixel P X would be negative. Furthermore, by comparing the value of COUNT for a pixel with the value of XHAT for the row in which it resides, it can be determined whether a pixel is inside of the inner boundary R I . An example of this would be the pixel P Y . Thus, if the sign of COUNT for a pixel is negative, the pixel is to the right of R O ; and if the positive value of COUNT for a pixel is greater than XHAT for the row in which it resides, the pixel is to the left of R I . Otherwise, the pixel is on R O or R I or in the slice between them. As a first step in determining what the next pixel is to be, the value of COUNT for a plurality of nearby test pixels is determined. In the particular embodiment of the invention herein described, the pattern of these nearby test pixels is shown in FIGURE 1C. The pixel P C is the current pixel, i.e., it is the last pixel in the path that has been determined. The test pixels are P₀, which is the next pixel toward the center of the sector from P C and in the same row as P C ; P₃ which is the next pixel away from the center of the sector and in the same row as P C ; P₁ which is in the same column as P C and in the next row on the side away from the apex of the sector; P₂ which is in the latter row and in the same column as P₃; and P₄ which is in the latter row and adjacent P₂. In the circuit shown in block diagram form in FIGURE 2, the values and/or signs of COUNT as may be required are derived as follows. The value of COUNT for the initial pixel in the path is derived from a multiplexer 3 and provided by an accumulator 2 and applied to each of the circuits P₀′, P₃′, P₁′, P₂′ and P₄′. After the initial value has been provided, the value of COUNT for each selected pixel in the path that is at the output of the multiplexer M is provided by the accumulator 2 to these circuits. The value of DCOUNTY for the particular slice is provided from a register 4 directly to P₁′ via a subtractor 6 of ΔX=1 to P₂′ and via a subtractor 8 of 2ΔX to P₄′. The circuit P₀′ adds ΔX=1 to the value of COUNT for P C so as to provide the value of COUNT for the test pixel P₀ at an output O₀. The circuit P₃′ subtracts ΔX=1 from the value of COUNT for P C so as to provide the value of COUNT for P₃ at one output O₃, and it also provides the sign of that value of COUNT at an output O₃′. The summer P₁′ supplies the value of COUNT for the pixel P₁ at its output O₁. The summer P₂′ provides the value of COUNT for P₂ because of the subtraction of ΔX=1 by the subtractor 6 at an output O₂, and the sign of that value of COUNT at a output O₂′. The summer P₄′, after internally deriving the value of COUNT for P₄ by virtue of the subtraction of 2ΔX=2 by the subtractor 8, provides the sign of that value of COUNT at its output O₄′. It does not need to provide the value of COUNT for P₄ because it is never going to be selected as a pixel for the path. The pixel P₄ is included in the pattern so as to provide for the situation where the angle of the outer radial line R O is greater than 45°. The values of COUNT at the outputs O₀, O₃, O₁ and O₂ are supplied to a multiplexer M that selects the one that is for the next one of the pixels P₀, P₁, P₂ and P₃ that is selected by a decision ROM D. The inputs to the decision ROM D include indications of the sign of COUNT for the pixels P₃, P₂ and P₄ via leads to the outputs O₃′, O₂′ and O₄′ respectively. An XHAT accumulator XA outputs in a manner to be described the value of XHAT for the row of pixels in which the current pixel P C resides. The output is applied to the A input of a comparator C₁ and the value of COUNT for the pixel P₀ that is at the output O₀ is supplied to the B input of C₁. If the value of COUNT for P₀ is greater than XHAT, C₁ outputs a "1" indicating that P₀ is inside R I and out of the slice; and if the value of COUNT for P₀ is less than or equal to XHAT, C₁ outputs a "0" indicating that P₀ is inside the slice formed by R I and R O . The output of C₁ is applied to the decision ROM D. The XHAT accumulator XA also supplies the value of XHAT NEXT to the B input of a comparator C₂, and the value of COUNT for the pixel P₁ that appears at the output O₁ is supplied to the B input of C₂. If the value of COUNT for P₁ is greater than XHAT NEXT, C₁ outputs a "1" indicating that P₁ is on the inside of R I and out of the slice; and if the value of COUNT for P₁ is less than or equal to XHAT NEXT, C₁ outputs a "0" indicating that P₁ is inside the slice formed by R I and R O . At the first pixel of the path, an assumption is made for the direction of the first step along the row of pixels in which the first pixel of the path resides. Also, the initial values of XHAT and COUNT are supplied to the respective accumulators. With this information, the decision ROM D outputs the direction XDIR of the first step in the path; an output on BUMPX if the next step in the path is to be to P₀ or P₃, depending on XDIR; an output on BUMPY if the next step in the path is to be to P₁; and an output on both BUMPX and BUMPY if the first step is a diagonal move to P₂. The ROM D also sends a signal to the multiplexer M so as to select the value of COUNT for the pixel to which the first step is made. On the next clock pulse, the process is repeated but the current pixel P C is now the pixel to which the first step in the path is made. Whenever any pixel is outside the slice, the ROM D outputs a signal INVAL. This is used to prevent the provision of any invalid data to such a pixel. In order that the ROM D may know the direction of the step taken to arrive at the current pixel P C , the output XDIR is coupled back to an XDIR input via a flip-flop F. The value of DXHAT is supplied from a source 7 to a summer 9 to which XHAT at the output of the XHAT accumulator XA is also supplied so as to provide the value of XHAT NEXT. At the start of a path, a multiplexer 11 supplies the value of COUNT for the first pixel in the path to the XHAT accumulator XA. Thus, for each step in Y from one row to the next, the output of XA is increased by DXHAT. The XHAT accumulator XA is updated by the BUMPY signal from the decision ROM D whenever it selects a step to a pixel in the next row of pixels so as to place the former XHAT NEXT at its output as the new value of XHAT. If the boundary lines of a slice are parallel, such as L I and L O of FIGURE 1A, the value of DCOUNTY is "0". With this change, the same calculations can be used. The outputs of the decision ROM D for any combination of inputs is set forth in FIGURES 3 and 4. They have to be determined by examining the relationship between the boundary lines R O and R I and the various test pixels that is indicated by each input of the Karnaugh maps of FIGURES 3 and 4. The operation of the ROM D is generally as follows. If the sign of COUNT for P₄ is " + ", as indicated by a "0" at the output O₄, it means that the test pixel P₄ is inside R O so that the Karnaugh map of FIGURE 3 is used; but if the sign of COUNT is " - ", the Karnaugh map of FIGURE 4 is used. Examination of these maps shows that they are identical except for the position 10:000 at the lower left corner. As previously stated, P₄ need be used when the angle of the outer radial line R O is greater than 45°. Reference is made to FIGURE 5 for an explanation of the need for P₄. If the outside boundary of a sector is a radial line R O at 45°, the path will be followed from P C to P₂ and then back toward P₁; but if knowledge of P₄ does not exist and the outermost line is at an angle of say 60°, the path would go from P C to P₂ and then left to P₁ so as to miss P₄ entirely. The problem with this is that it leaves a hole in the output image that might form an annoying artifact pattern. But if P₄ is examined, the path would go from P C to P₃ to P₄ and then go back to P₂. If the current pixel P C is well within the slice, as shown in FIGURE 6, and has been approached from the inner boundary as indicated, it is apparent that the next step is to the position occupied by P₃. To see that this occurs, note that the following inputs would be made to the decision ROM D. Because the value of COUNT for P₄ is " + ", we use the map of FIGURE 3. The inputs are: A = + = 0, B = + = 0: C = 0, D = 0, and E = 0. This is box 00:000 which indicates that the next step is a move to the right from the present position of P C , i.e., to the present position of P₃. After this first move, however, as shown in FIGURE 7, the sign of COUNT for P₄ is " - ", i.e., a "1", so that we use the Karnaugh map of FIGURE 4. The inputs for this situation are: A = + = 1, B = + = 0 : C = 0, D = 0, and E = 0. This is the box 10:000 which means that the path goes from P C to P₂ as indicated. FIGURE 8 illustrates the start of a path at the apex of the sector along a slice that is directed generally down and to the right. At the apex XHAT=0, COUNT=0 and XHAT NEXT is slightly greater than 0. The sign of COUNT for P₄ is " - " so that we use the map of FIGURE 4. The other inputs are A = 1, B = 0 : C = 0, D = 1, and E = 1. It is assumed that XDIR is to the right. From this, it can be seen that the box 10:011 is indicated so that the first step is diagonal to P₂ and is valid. The principle advantage of having P₂ is to provide for pixels along a 45° line. Therefore, the most significant test pixels are P₀, P₃ and P₂. When moving to the right from a point well within a slice, P₃ indicates when it is time to make a movement in Y; but the information of P₀ does not mean anything. The reverse is true when moving to the left. The test pixel P₁ is for the situation encountered when the slice is at a shallow angle with horizontal and thus at the point of interest, in which event the value of COUNT for P₁ will be greater than XHAT NEXT so that the appropriate step can be taken. For the third quadrant, everything would be a mirror image. It would be possible to measure the value of COUNT from the inside boundary R I but this would require different Karnaugh maps.

Claims: Apparatus for generating a step-by-step path from a current pixel that extends through pixels located at intersections of first and second sets of rectilinear coordinates that lie between first and second boundaries, comprising accumulator means (2) for providing the position of the current pixel in the path, characterized by calculating means (4, 6, 8, P ′ / 0, P ′ / 1, P ′ / 2, P ′ / 3, P ′ / 4) for providing indications as to which side of said first boundary given test coordinate intersections of a pattern of test intersections (P₀, P₁, P₂, P₃, P₄) having predetermined coordinate positions with respect to the current pixel in the path lie, calculating means (4, 6, 8, P ′ / 0, P ′ / 1, P ′ / 2, P ′ / 3, P ′ / 4) for providing indications as to which side of said second boundary other test coordinate intersections of said pattern of test intersections lie, circuit means (F) for providing an indication as to the direction of the step in the path to the current pixel with respect to the boundaries, and decision means (D) responsive to said indications for indicating at which of the test coordinate intersections the next pixel in the path is located. Apparatus as set forth in claim 1 wherein said pattern of test intersections includes at least first and second test intersections (P₀, P₃) on opposite sides of said current pixel (P C ) and on the same coordinate as said current pixel and a third test intersection (P₁) of a parallel coordinate and a coordinate perpendicular thereto that passes through the current pixel (P C ). Apparatus as set forth in claim 2 wherein said pattern of test intersections also includes a fourth test intersection (P₂) that is an intersection of said parallel coordinate with a coordinate that is perpendicular thereto and passes through one of said first and second test intersections (P₀, P₃). Apparatus as set forth in claim 3 wherein said pattern of test intersections further includes a test intersection (P₄) on said parallel coordinate that is on the side of said fourth intersection (P₂) that is remote from the current pixel (P C ). Apparatus as set forth in one of claims 1 to 4, characterized in that said calculating means comprises: circuit means (2, 3, M) for providing first signals (COUNT) respectively representing the distances from the first boundary, as measured along coordinates of one set of coordinates, of said given test coordinate intersections, each of said signals having an indication of one sign when its test intersection is on one side of said first boundary and indication of the opposite sign when its test intersection is on the opposite side of said first boundary, circuit means (9, 11, XA) for respectively providing second signals (XHAT) representing the distances between said boundaries as measured along coordinates of said one set of coordinates on which any test intersection is located, comparator means (C₁, C₂) for comparing the one of said first signals for each of said other given test intersections of said pattern with the one of said second signals for that test intersection so as to derive one indication when that test intersection is on one side of said second boundary and another indication when that test intersection is on the other side of said second boundary, and that said decision means (D) comprises circuit means for providing signals indicating the direction of approach of the path to said next pixel along the coordinate of said first set of coordinates in which it is located.

Inventors: HUNT BARRY F, SCHURMANN BRUCE, HUNT, BARRY F., SCHURMANN, BRUCE
Applicants: HEWLETT PACKARD CO, HEWLETT-PACKARD COMPANY
Application year: 1987
Main classification: G06F7
IPC codes: G06T1, G01S7, G09G1