中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

10 records (took 0.034 seconds)

    3.
    发明专利
    未知

    公开(公告)号：DE3584939D1

    公开(公告)日：1992-01-30

    申请号：DE3584939

    申请日：1985-08-13

    Applicant: IBM

    Inventor： BASS VANCE RICHARD ,  BONEBRAKE VERONICA ANNE ,  GARRISON DAVID ALLAN ,  LANDIS JAMES KEVIN ,  NEFF MARY SUSAN ,  URQUHART ROBERT JOHN ,  WILLIAMS SUSAN CLAIRE

    IPC: G06F17/27 ,  G06F15/20

    Abstract: Method of verifying the compound word spelling wherein all initial substrings of the word found in the dictionary are saved in a list. If the entire word is not found in the dictionary (4), the longest substring in the substring list is subtracted from the entire word to be verified to yield a "remainder" portion of the input text word. The dictionary words are then compared with this remainder portion to determine if a match occurs. If so, then both portions of the word are found in the dictionary (4) and spelling of the word is considered correct. If the remainder is not found in the dictionary (4), successively shorter initial substrings are accessed to yield successively longer remainders. The word is considered correctly spelled if both a substring and a remainder are found in the dictionary 54).

    4.
    发明专利
    未知

    公开(公告)号：DE69129975D1

    公开(公告)日：1998-09-17

    申请号：DE69129975

    申请日：1991-12-05

    Applicant: IBM

    Inventor： ALBAUGH VIRGIL ANTHONY ,  URQUHART ROBERT JOHN

    IPC: G06T15/40 ,  G06F3/153

    Abstract: In a computer graphics system, a means and method is provided for initializing and updating a group of pixels contained on a display in blocks. A group of pixels is considered as a block and has a status word associated therewith. This status word maintains a running total of the maximum Z value of any pixel contained within a group or block of pixels. In this manner, once a block of pixels is rendered on to the display screen, a comparison can be made between the current pixels being displayed and a group of pixels which are to be displayed. The minimum Z value of the block of pixels to be displayed is compared with the maximum Z value for the block of pixels currently being displayed. If the current maximum Z value, as stored in the status word, is less than the minimum Z value for the pixels to be displayed, then the block of pixels currently being displayed will all "win" when compared to the pixels in the block to be displayed. In this case, a full block bypass of the blocks of pixels to be displayed is implemented, thereby saving considerable time and overhead when compared to conventional Z buffer systems that compare Z values for each individual pixel.

    7.
    发明专利
    未知

    公开(公告)号：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.

    8.
    发明专利
    未知

    公开(公告)号：DE69129975T2

    公开(公告)日：1999-04-15

    申请号：DE69129975

    申请日：1991-12-05

    Applicant: IBM

    Inventor： ALBAUGH VIRGIL ANTHONY ,  URQUHART ROBERT JOHN

    IPC: G06T15/40 ,  G06F3/153

    Abstract: In a computer graphics system, a means and method is provided for initializing and updating a group of pixels contained on a display in blocks. A group of pixels is considered as a block and has a status word associated therewith. This status word maintains a running total of the maximum Z value of any pixel contained within a group or block of pixels. In this manner, once a block of pixels is rendered on to the display screen, a comparison can be made between the current pixels being displayed and a group of pixels which are to be displayed. The minimum Z value of the block of pixels to be displayed is compared with the maximum Z value for the block of pixels currently being displayed. If the current maximum Z value, as stored in the status word, is less than the minimum Z value for the pixels to be displayed, then the block of pixels currently being displayed will all "win" when compared to the pixels in the block to be displayed. In this case, a full block bypass of the blocks of pixels to be displayed is implemented, thereby saving considerable time and overhead when compared to conventional Z buffer systems that compare Z values for each individual pixel.

    10.
    发明专利
    未知

    公开(公告)号：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.

Patent Agency Ranking