UST915006I4 - Coordinate-ordering for contour plotting - Google Patents
Coordinate-ordering for contour plotting Download PDFInfo
- Publication number
- UST915006I4 UST915006I4 US915006DH UST915006I4 US T915006 I4 UST915006 I4 US T915006I4 US 915006D H US915006D H US 915006DH US T915006 I4 UST915006 I4 US T915006I4
- Authority
- US
- United States
- Prior art keywords
- contour
- successor
- candidates
- plotting
- points
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K15/00—Arrangements for producing a permanent visual presentation of the output data, e.g. computer output printers
- G06K15/22—Arrangements for producing a permanent visual presentation of the output data, e.g. computer output printers using plotters
Definitions
- the program can be used to determine closure and discrete contours in a single or multiple contour environment, with particular application to plotting and analysis.
- the invention herein described was made in the course of or under a contract or subcontract thereunder with the f Department of the Army.
Landscapes
- Engineering & Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
A COMPUTER PROGRAM TO DERIVED AND CONTROL PLOTTING OF CONTOUR REPRESENTING LINES OF CONSTANT VALUES WITHIN A LINEAR, 2-DIMENSIONAL MATRIX. THE PROGRAM USES AN ALGORITHM WHICH ORDERS COORDINATE OF POINTS ON A CONTOUR, ENABLING CONTINUOUS PROGRESSIONS ALONG THE CONTOUR. THE BASIC STEPS WITHIN THE CONTOUR ORDERING ALGORITHM MAY BE DEFINES, AS: (1) DETERMINATION OF AVAILABLE POINTS AS POTENTIAL CANDIDATES, (2) USE OF A SEARCH WINDOW TO DISCARD POINTS TOO REMOTE TO BE A VALID SUCCESSOR CANDIDATE, (3) CLASSIFYING SUCCESSOR CANDIDATES TO ENABLE SELECTION OF THE BEST ONE AS THE VALID SUCCESSOR, AND
(4) WHEN NO SUCCESSOR CANDIDATES ARE FOUND OR SELECTION OF THE BEST ONE CANNOT BE MADE, THE CONTOUR SEGMENT IS PROCESSED OR STORED, AND THE ALGORITHM PROCEED TO THE NEXT AVAILABLE STARTING POINT. THE PROGRAM CAN BE USED TO DETERMINED CLOSURE AND DISCRETE CONTOURS IN A SINGLE OR MULTIPLE CONTOUR ENVIRONMENT, WITH PARTICULAR APPLICATION TO PLOTTING AND ANALYSIS. THE INVENTION HEREIN DESCRIBED WAS MADE IN THE COURSE OR OR UNDER A CONTRACT OR SUBCONTRACT THEREUNDER WITH THE DEPARTMENT OF THE ARMY.
(4) WHEN NO SUCCESSOR CANDIDATES ARE FOUND OR SELECTION OF THE BEST ONE CANNOT BE MADE, THE CONTOUR SEGMENT IS PROCESSED OR STORED, AND THE ALGORITHM PROCEED TO THE NEXT AVAILABLE STARTING POINT. THE PROGRAM CAN BE USED TO DETERMINED CLOSURE AND DISCRETE CONTOURS IN A SINGLE OR MULTIPLE CONTOUR ENVIRONMENT, WITH PARTICULAR APPLICATION TO PLOTTING AND ANALYSIS. THE INVENTION HEREIN DESCRIBED WAS MADE IN THE COURSE OR OR UNDER A CONTRACT OR SUBCONTRACT THEREUNDER WITH THE DEPARTMENT OF THE ARMY.
Description
DEFENSIVE PUBLICATION UNITED STATES PATENT OFFICE Published at the request oi! the applicant or owner in accordance with the Notice 01 Dec. 16, 1969. 869 O.G. 687. The abstracts of Defensive Publication applications are identified by distinctly numbered series and are arranged chronologically.
The heading of each abstract indicates the number of pages of specification, including claims and sheets of drawings contained in the application as originally filed. The files of these applications are available to the public for inspection and reproduction may be purchased for 30 cents a sheet.
Defensive Publication applications have not been examined as to the merits of alleged invention. The Patent Oiiice makes no assertion as to the novelty of the disclosed subject matter.
PUBLISHED OCTOBER 9, 1973 T915,006 COORDINATE-ORDERING FOR CONTOUR PLOTTING Paul Arnold Friedman, Morristown, N.J., assignor to International Business Machines Corporation, Armonk,
Continiration of abandoned application Ser. No. 213,078, Dec. 28, 1971. This application Feb. 9, 1973, Ser.
Int. Cl. G06f 15/20 us. Cl. 444-1 4 Sheets Drawing. 34 Pages Specification A computer program to derive and control plotting of contour representing lines of constant values within a linear, Z-dimensional matrix. The program uses an algorithm which orders coordinate of points on a contour, enabling continuous progressions along the contour. The basic steps within the contour ordering algorithm may be defined as:
(1) determination of available points as potential candidates; (2) use of a search window to discard points too remote to be a valid successor candidate; (3) classifying successor candidates to enable selection of the best one as the valid successor; and
Linn--- Y Hm: 5
The program can be used to determine closure and discrete contours in a single or multiple contour environment, with particular application to plotting and analysis. The invention herein described was made in the course of or under a contract or subcontract thereunder with the f Department of the Army.
Oct. 9, 1973 P. A. FRIEDMAN T915,006
COORDINATE-ORDERING FOR CONTOUR PLOTTING 4 Sheets-Sheet 1 Original Filed Dec. 28, 1971 FIG.1
FIG. 2
FY 88 r O FX 68 [IV EIV e 8 F(X,Y CONTOUR VALUE Get. 9, 1973 P. A. FRIEDMAN COORDINATE-ORDERING FOR CONTOUR PLO'ITING 4 Sheets-Sheet 2 Original Filed Dec. 28, 1971 FIG. 4
F(X,Y CONTOUR F(X,Y) CONTOUR FIG. 5
Oct. 9, 1973 p A, FRIEDMAN T9l5,006
COORDINATE-ORDERING FOR CONTOUR PLOTTING I Original Filed Dec. 28, 1971 4 Sheets-Sheet 5 FIG. 60
P A RNNENE R s SUBROUT'NE AND 4 mm PLOTTING GRID mums PASS-1 TO END OR MULTIPLE SUCCESSORS 2ND PASS-GENERATES CLOSURES AND RESOLVED SUCCESSIONS 3RD PASS-CENERATES ALL POSSIBLE REMAINING CONNECTIONS USED I PASS PASS 1 FIND 1ST POINT ON NEXT CURVE STORE NEXT POINT AND ,8 INCRE MENT COUNTERS IN ITIALIZE FOR NEXT POINT, SET WINDOW Oct. 9, 1973 A. FRIEDMAN COQRDTNATE-ORDERING FOR CONTOUR PLOTTING 4 Sheets-Sheet 4 Original Filed Dec. 28 1971 FIND NEXT SUCCESSDR CANDIDATE VALID SUCCESSCR IN WINDOW AND CURRENT 4 POINT 5RD PASS PL FIRST SUBROUTINE NTYPE 1 SAVE CLDSEST TYPE 1 POINT NTYPE 2 INCREMENT coum I T SAVE POINT I69 MORE SUCCESSOR CANDIDATES SUBRDUTINE PLOT CURVE TPLOT N0 STORE PAIR PARAMETERS YES
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US33114373A | 1973-02-09 | 1973-02-09 |
Publications (1)
Publication Number | Publication Date |
---|---|
UST915006I4 true UST915006I4 (en) | 1973-10-09 |
Family
ID=23292783
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US915006D Pending UST915006I4 (en) | 1973-02-09 | 1973-02-09 | Coordinate-ordering for contour plotting |
Country Status (1)
Country | Link |
---|---|
US (1) | UST915006I4 (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3938099A (en) | 1972-11-02 | 1976-02-10 | Alephtran Systems Ltd. | Electronic digital system and method for reproducing languages using the Arabic-Farsi script |
US5265040A (en) * | 1987-08-28 | 1993-11-23 | Hitachi, Ltd. | Method and device for displaying information on simulation result in a numerical simulation system |
-
1973
- 1973-02-09 US US915006D patent/UST915006I4/en active Pending
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3938099A (en) | 1972-11-02 | 1976-02-10 | Alephtran Systems Ltd. | Electronic digital system and method for reproducing languages using the Arabic-Farsi script |
US5265040A (en) * | 1987-08-28 | 1993-11-23 | Hitachi, Ltd. | Method and device for displaying information on simulation result in a numerical simulation system |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Bentley et al. | An optimal worst case algorithm for reporting intersections of rectangles | |
Porsching et al. | The reduced basis method for initial value problems | |
Zhang et al. | Laplacian scale-space behavior of planar curve corners | |
UST915006I4 (en) | Coordinate-ordering for contour plotting | |
Kadak | On relative weighted summability in modular function spaces and associated approximation theorems | |
Niyozmatova et al. | Unconditional discrete optimization of linear-fractional function “-1”-order | |
Tian et al. | Scalable and numerically stable descriptive statistics in systemml | |
Abo-Tabl | On links between rough sets and digital topology | |
Haining | Specification and estimation problems in models of spatial dependence. | |
Santhi et al. | Performance analysis of parallel k-means with optimization algorithms for clustering on spark | |
Khebchareon et al. | Alternating direction implicit Galerkin methods for an evolution equation with a positive-type memory term | |
CN108829932B (en) | Interest matching method, device, computer equipment and storage medium | |
Li et al. | The Hardy inequality for Hermite expansions | |
Karlqvist | Numerical solution of elliptic difference equations by matrix methods | |
Gupta et al. | Parameter estimation for multivariable systems | |
Akram et al. | Point Enclosure Problem for Homothetic Polygons | |
US9317125B2 (en) | Searching of line pattern representations using gestures | |
Jorgenson | Modeling production for general equilibrium analysis | |
CN106611014B (en) | Method and device for adjusting webpage query condition sequence | |
Dauwe et al. | Analysis of double decay spectra by the SIMPLEX stepping method | |
ES335257A1 (en) | Computer programming | |
Cai et al. | Feature selection based on density peak clustering using information distance measure | |
Kaiser | Trace calculation on electronic computer | |
Ovsyak et al. | Analysis of Modeling methods and tools of complex computer systems and information technologies | |
Cheng et al. | Plotting planar implicit curves and its applications |