中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

6 records (took 0.017 seconds)

    2.
    发明专利
    未知

    公开(公告)号：DE3851046D1

    公开(公告)日：1994-09-15

    申请号：DE3851046

    申请日：1988-11-21

    Applicant: IBM

    Inventor： BEAUREGARD GARY MICHAEL ,  LOUCKS LARRY KEITH ,  NGUYEN KHOA DANG ,  URQUHART ROBERT JOHN

    IPC: G06T11/40 ,  G06F15/72

    Abstract: Two faster polygon fill routines are presented for filling polygons on a graphics display in addition to a conventional fill routine. The first fast fill routine fills polygons that are strictly convex. The second fast fill routine fills a larger class of polygons than the first fast fill routine which includes polygons being concave in the x direction, and polygons having crossing lines. The first fast fill routine tests the polygon for strict convexity by testing for a consistent turning direction, and by testing for once around in the y direction. The first polygon fill routine then stores the maximum and minimum value of the pel selected by the Bresenham routine for each scan line of the polygon. The fill line is drawn from the pel having the minimum value to the pel having the maximum value for each scan line of the polygon. The second fast fill routine tests the polygon to ensure that it can be filled with one unique fill line for each scan line of the polygon. The second fast fill routine stores both a minimum value and maximum value for each scan line line of the polygon for each line of the polygon. A fill line is then drawn from the least minimum value to the greatest maximum value for each scan line of the polygon.

    4.
    发明专利
    未知

    公开(公告)号：DE3851046T2

    公开(公告)日：1995-03-09

    申请号：DE3851046

    申请日：1988-11-21

    Applicant: IBM

    Inventor： BEAUREGARD GARY MICHAEL ,  LOUCKS LARRY KEITH ,  NGUYEN KHOA DANG ,  URQUHART ROBERT JOHN

    IPC: G06T11/40

    Abstract: Two faster polygon fill routines are presented for filling polygons on a graphics display in addition to a conventional fill routine. The first fast fill routine fills polygons that are strictly convex. The second fast fill routine fills a larger class of polygons than the first fast fill routine which includes polygons being concave in the x direction, and polygons having crossing lines. The first fast fill routine tests the polygon for strict convexity by testing for a consistent turning direction, and by testing for once around in the y direction. The first polygon fill routine then stores the maximum and minimum value of the pel selected by the Bresenham routine for each scan line of the polygon. The fill line is drawn from the pel having the minimum value to the pel having the maximum value for each scan line of the polygon. The second fast fill routine tests the polygon to ensure that it can be filled with one unique fill line for each scan line of the polygon. The second fast fill routine stores both a minimum value and maximum value for each scan line line of the polygon for each line of the polygon. A fill line is then drawn from the least minimum value to the greatest maximum value for each scan line of the polygon.

    5.
    发明专利
    未知

    公开(公告)号：DE3774283D1

    公开(公告)日：1991-12-12

    申请号：DE3774283

    申请日：1987-01-15

    Applicant: IBM

    Inventor： BEAUREGARD GARY MICHAEL ,  BOHRER KATHRYN ANN ,  LEONARD ANNE GREGORY

    IPC: G06F3/023 ,  H03M11/04 ,  H03M11/14 ,  H03M11/16 ,  H03M11/22

    Abstract: The apparatus for entering information comprises a sequence of predetermined characters into an information processing system by means of a keyboard (12) having a number of keys, selected ones of which have a number of operating states. A device enters into the system code point, designation signals each representing a selected character in response to operating a corresponding key and code page designation signals each representing a keyboard operating state. The device for entering comprises a device (10,11,16,17) for entering only a code point designation signal when the associated character is in the same code page as the previous character in the sequence. Both a code page designation signal and a code point designation signal are entered when the code page of the previous character in the sequence is different.

Patent Agency Ranking