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

System and method for creating and modifying graphs in a computer system using a multiple segment graph format

Assignee: Verigy Singapore Pte Ltd
•
Filing: 1993-08-02
•
Granted: 1995-09-19
•
Expires: 2013-08-02
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A system and method for creating and maintaining graphs in a computer system. The computer system contains a windowing system. The present invention performs its functions without placing a great burden on computer system resources. According to the present invention, a graph is drawn on multiple forms. The graph is initially displayed on a display screen by writing the forms to the display screen. Each form stores a single data point of the graph. A new data point is added to the graph by representing the new data point in the appropriate form. To display the new data point on the display screen, only the modified form (that is, the form containing the new data point) is written to the display screen.

Inventors

  • 👤 Jeffry H. Smith

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-08 03:08
CPC Classifications
G; G01; G01R; G01R13/00; G01R13/02; G06; G06T; G06T11/00; G06T11/20; G06T11/26; G09; G09G; G09G1/00; G09G1/06; G09G1/14; G09G1/16; G09G1/162; G09G5/00; G09G5/14

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 177 words
In a computer system having a display screen and a windowing system, a method for displaying a graph on said display screen, said method comprising the steps of: (a) drawing the graph on multiple forms wherein the graph comprises T ticmarks each having P data points, the graph having a plurality of data points, each form containing a single data point of the graph, wherein the step for drawing the graph on multiple forms comprises the steps of: (1) building a data array of said data points; (2) building a form array of said forms, wherein each of said forms contains a bitmap, a horizontal offset, and a vertical offset; (3) initializing said horizontal and vertical offsets; (4) initializing said bitmap for each of said forms; (5) initializing an index to said data and forms array; and (6) initializing a range; (b) displaying said forms on the display screen; (c) modifying one of said forms to modify the data point contained therein; and (d) re-displaying only said modified form on the display screen thereby modifying the graph.
Claim 2
Dependent Claim 177 words
In a computer system having a display screen and a windowing system, a method for displaying a graph on said display screen, said method comprising the steps of: (a) drawing the graph on multiple forms wherein the graph comprises T ticmarks each having P data points, the graph having a plurality of data points, each form containing a single data point of the graph, wherein the step for drawing the graph on multiple forms comprises the steps of: (1) building a data array of said data points; (2) building a form array of said forms, wherein each of said forms contains a bitmap, a horizontal offset, and a vertical offset; (3) initializing said horizontal and vertical offsets; (4) initializing said bitmap for each of said forms; (5) initializing an index to said data and forms array; and (6) initializing a range; (b) displaying said forms on the display screen; (c) modifying one of said forms to modify the data point contained therein; and (d) re-displaying only said modified form on the display screen thereby modifying the graph.
Claim 3
Dependent Claim 52 words
The method of claim 1, wherein said step for initializing said horizontal and vertical offsets comprises the steps of: (1) determining a horizontal width of the graph in pixels; (2) generating a Q by dividing said horizontal width by T times P; (3) setting said horizontal offsets according to an equation: (index-1)*Q.
Claim 4
Dependent Claim 79 words
The method of claim 2, wherein the step for modifying one of said forms to modify the graph comprises the steps of: (1) receiving a new data point; (2) storing said new data point in said data array according to said index; (3) identifying one of said forms in said form array by using said index; (4) erasing pixels associated with said identified form; (5) modifying said pixels to represent said new data point; and (6) incrementing said index.
Claim 5
Dependent Claim 71 words
The method of claim 3, further comprising the following steps after step (2): (i) determining whether said new data point is greater than a range variable; (ii) branching to step (3) if said new data point is not greater than said range variable; (iii) setting said range variable to a value greater than said new data point; (iv) initializing said index; and (v) performing steps (1)-(6) for all of said forms.
Claim 6
Dependent Claim 45 words
The method of claim 3, further comprising the following steps after step (2): (i) determining whether said index is greater than T*P; (ii) branching to step (3) if said index is not greater than T*P; (iii) scrolling the graph; and (iv) branching to step (3).
Claim 7
Dependent Claim 127 words
The method of claim 5, wherein the step for scrolling the graph comprises the steps of: decreasing by P times Q said horizontal offsets associated with said forms which are right of a first ticmark; clearing said bitmaps associated with said forms which are left of said first ticmark; increasing by P times (T-1) times Q said horizontal offsets associated with said forms which are left of said first ticmark; reordering said form array such that said forms are ordered by increasing horizontal offset; reordering said data array such that said data points are ordered relative to corresponding forms in said form array; initializing the last P elements in said data array; setting said index to P times (T-1); and displaying said forms on the display screen.
Claim 8
Dependent Claim 33 words
The method of claim 1, wherein said step for initializing said bitmap for each of said forms comprises the step of setting pixels in said bitmap to a background color of the graph.
Claim 9
Dependent Claim 96 words
A computer system comprising: (1) a display screen; (2) a windowing system; (3) means for displaying a graph on said display screen, said displaying means comprising: (a) means for drawing said graph on multiple forms, the graph having a plurality of data points, each form containing a single data point of the graph; (b) means for displaying said forms on said display screen; (c) means for modifying one of said forms to modify the single data point contained therein; and (d) means for re-displaying only said modified form on said display screen thereby modifying the graph.
Claim 10
Dependent Claim 96 words
A computer system comprising: (1) a display screen; (2) a windowing system; (3) means for displaying a graph on said display screen, said displaying means comprising: (a) means for drawing said graph on multiple forms, the graph having a plurality of data points, each form containing a single data point of the graph; (b) means for displaying said forms on said display screen; (c) means for modifying one of said forms to modify the single data point contained therein; and (d) means for re-displaying only said modified form on said display screen thereby modifying the graph.

References Cited (Backward Citations)

US4628470A Cited
US4800510A Cited
US5142618A Cited
US4965743A Cited
US5230040A Cited
US5121470A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1998-09-18 1999-03-20 1999-09-19 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2002-09-18 2003-03-20 2003-09-19 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2006-09-18 2007-03-20 2007-09-19 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag