← Back to Patent Explorer
US4947344A Expired / Lapsed US ⏱️ 0.0 years remaining

Method of rotating image data in a partitioned display buffer

Assignee: International Business Machines Corp
•
Filing: 1989-05-17
•
Granted: 1990-08-07
•
Expires: 2009-05-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method of operating a graphics system, in which a host processor sends a display terminal image data and image orders. The image orders coordinate the position and size of a source rectangle area and the postion of a destination rectangle area in an image storage memory. The image data of the souce rectangle area is rotated by a rotation angle of 90 degrees, 180 degrees or 270 degrees and is stored in the image storage memory. The image storage memory operates as a storage buffer of a display unit, which displays the image data of the destination rectangle area. The image storage memory is partitioned into areas of K bits. Image data is rotated in blocks of K×K bits.

Inventors

  • 👤 Yasumasa Hayashi
  • 👤 Katsumasa Oka
  • 👤 Hiroshi Satoh

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-05 00:04
CPC Classifications
G; G06; G06T; G06T3/00; G06T3/60; G06T3/606

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 375 words
A method of rotating image data representing a source rectangle area of a document by a specified rotation angle, said source rectangle area having a source edge and a source edge area adjacent the source edge, said source rectangle area comprising a plurality of lines, each line extending in a direction parallel to the source edge, said image data comprising a plurality of words, each word consisting of K bits of data extending along a line of the source rectangle area in the direction parallel to the source edge, said method comprising the steps of: partitioning a storage means by at least first and second boundaries separated from each other by K bits in a bit direction perpendicular to the boundaries, said storage means comprising a plurality of lines of storage, each line extending in the bit direction, groups of K bits on a line forming a word, said storage means having a destination rectangle area corresponding to the source rectangle area, said destination rectangle area having a destination edge parallel to and spaced from the boundaries, said destination edge corresponding to the source edge; calculating the number M of bits between the destination edge and the first boundary of the storage means; storing image data representing the source edge area in a K-line buffer, said buffer having K lines of storage and having first and second boundaries, the first boundary of the K-line buffer corresponding to the first boundary of the storage means, the second boundary of the K-line buffer corresponding to the second boundary of the storage means, each line of the K-line buffer extending in a line direction parallel to the boundaries of the K-line buffer, said K-line buffer being partitioned into blocks, each block having a size of K×K bits, each word of image data being stored on one line of the K-line buffer, said source edge being spaced from the first boundary of the K-line buffer by M lines in a direction perpendicular to the line direction; reading data from a block of the K-line buffer in groups of K bits in a direction perpendicular to the line direction; and storing each group of K bits in the storage means between the first and second boundaries of the storage means.
Claim 2
Independent Claim 375 words
A method of rotating image data representing a source rectangle area of a document by a specified rotation angle, said source rectangle area having a source edge and a source edge area adjacent the source edge, said source rectangle area comprising a plurality of lines, each line extending in a direction parallel to the source edge, said image data comprising a plurality of words, each word consisting of K bits of data extending along a line of the source rectangle area in the direction parallel to the source edge, said method comprising the steps of: partitioning a storage means by at least first and second boundaries separated from each other by K bits in a bit direction perpendicular to the boundaries, said storage means comprising a plurality of lines of storage, each line extending in the bit direction, groups of K bits on a line forming a word, said storage means having a destination rectangle area corresponding to the source rectangle area, said destination rectangle area having a destination edge parallel to and spaced from the boundaries, said destination edge corresponding to the source edge; calculating the number M of bits between the destination edge and the first boundary of the storage means; storing image data representing the source edge area in a K-line buffer, said buffer having K lines of storage and having first and second boundaries, the first boundary of the K-line buffer corresponding to the first boundary of the storage means, the second boundary of the K-line buffer corresponding to the second boundary of the storage means, each line of the K-line buffer extending in a line direction parallel to the boundaries of the K-line buffer, said K-line buffer being partitioned into blocks, each block having a size of K×K bits, each word of image data being stored on one line of the K-line buffer, said source edge being spaced from the first boundary of the K-line buffer by M lines in a direction perpendicular to the line direction; reading data from a block of the K-line buffer in groups of K bits in a direction perpendicular to the line direction; and storing each group of K bits in the storage means between the first and second boundaries of the storage means.
Claim 3
Dependent Claim 29 words
A method as claimed in claim 1, wherein a first line of bits of image data on the source edge is stored in line M+1 of the K-line buffer.
Claim 4
Dependent Claim 35 words
A method as claimed in claim 2, wherein bits in lines 1 through M of the K-line buffer are set equal to zero before each group of K bits is stored in the storage means.
Claim 5
Dependent Claim 33 words
A method as claimed in claim 2, wherein bits in lines 1 through M of the K-line buffer are set equal to zero before the image data is stored in the K-line buffer.

References Cited (Backward Citations)

US4084195A Cited
US4168488A Cited
US4271476A Cited
JPS57130144A Cited
US4636783A Cited
US4593407A Cited
EP0158314A2 Cited
US4716533A Cited
US4736442A Cited
US4694405A Cited
US4808985A Cited
US4806985A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1993-08-06 1994-02-05 1994-08-07 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1997-08-06 1998-02-05 1998-08-07 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2001-08-06 2002-02-05 2002-08-07 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag