JPS58220178A - Graphic display - Google Patents

Graphic display

Info

Publication number
JPS58220178A
JPS58220178A JP57103189A JP10318982A JPS58220178A JP S58220178 A JPS58220178 A JP S58220178A JP 57103189 A JP57103189 A JP 57103189A JP 10318982 A JP10318982 A JP 10318982A JP S58220178 A JPS58220178 A JP S58220178A
Authority
JP
Japan
Prior art keywords
graphic
memory
points
data
grid
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.)
Granted
Application number
JP57103189A
Other languages
Japanese (ja)
Other versions
JPH0318194B2 (en
Inventor
富田 達夫
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fujitsu Ltd
Original Assignee
Fujitsu Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Fujitsu Ltd filed Critical Fujitsu Ltd
Priority to JP57103189A priority Critical patent/JPS58220178A/en
Publication of JPS58220178A publication Critical patent/JPS58220178A/en
Publication of JPH0318194B2 publication Critical patent/JPH0318194B2/ja
Granted legal-status Critical Current

Links

Landscapes

  • Digital Computer Display Output (AREA)
  • Controls And Circuits For Display Device (AREA)

Abstract

(57)【要約】本公報は電子出願前の出願データであるた
め要約のデータは記録されません。
(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

【発明の詳細な説明】 発明の技術分野 本発明は、計算機から図形データを入力されてそれを表
示する図形表示装置に関する。
TECHNICAL FIELD OF THE INVENTION The present invention relates to a graphic display device that receives graphic data from a computer and displays it.

技術の背景 計算機から図形、文字、記号など(ここでは単に図形と
いう)のデータを入力され、それをCRTの管面に表示
する装置は第1図に示すように計算機(図示しない)に
接続されるオーダ制御部1o、ベクトル発生器12、ポ
ジショニング回路14、図形メモリ16、表示制御部1
8、CRT20、文字発生器22などを備え、三角形、
四角形などの図形表示は計算機からそれらの角の点Pi
のX。
Technical background A device that receives data such as figures, characters, symbols (herein simply referred to as figures) from a computer and displays it on a CRT screen is connected to a computer (not shown) as shown in Figure 1. order control unit 1o, vector generator 12, positioning circuit 14, graphic memory 16, display control unit 1
8, equipped with a CRT 20, a character generator 22, etc., a triangular shape,
When displaying figures such as rectangles, calculate their corner points Pi from a calculator.
X.

Y座標xi、’y’tが送られ、それをオーダ制御部1
0はベクトル発生器12へ与え、ベクトル発生器12は
P+  (X+、Y+)とP2 (XI Y2)を結ぶ
線分、P2  (X2.、Y2)とP3(XiY3)を
結ぶ線分などを発生し、それを図形メモリ16に書込む
。図形メモリ16はCRT20の画面対応のメモリで、
画面の各画素に対応するメモリセル具体的には水平走査
線数×水平走査縁当りの画素数個のメモリセルを持つ。
The Y coordinates xi and 'y't are sent to the order control unit 1.
0 is given to the vector generator 12, which generates a line segment connecting P+ (X+, Y+) and P2 (XI Y2), a line segment connecting P2 (X2., Y2) and P3 (XiY3), etc. and writes it into the graphic memory 16. The graphic memory 16 is a memory compatible with the CRT 20 screen.
Specifically, the number of memory cells corresponding to each pixel on the screen is the number of horizontal scanning lines times the number of pixels per horizontal scanning edge.

表示制御部18はこれをCRTの走査と同期して繰り返
し読み出し、読出しデータで輝度変目するので、CRT
の管面には図形メモリに書込まれた三角形、四角形など
の図形が表示される。文字は、計算機から文字コードお
よび表示位置情報が送られ、それを受けて文字発生器2
2が文字パターンを発生しまたボジショニング回路が表
示位置座標を発生し、後者をアドレス前者をデータとし
て図形メモリ16へ書込み、走査と同期してそれを読出
し輝度変調信号とすることによりCRT20に表示され
る。
The display control unit 18 repeatedly reads this data in synchronization with the scanning of the CRT, and changes the brightness depending on the read data.
Graphics such as triangles and squares written in the graphic memory are displayed on the screen. The character code and display position information are sent from the computer, and then the character generator 2
2 generates a character pattern, and the positioning circuit generates display position coordinates, the latter is an address, the former is written as data to the graphic memory 16, and is read out in synchronization with scanning and displayed on the CRT 20 by making it a brightness modulation signal. be done.

従来技術と問題点 このような図形表示装置がCAD (Computor
  Aided  Design)の分野などで使用さ
れると、CRTの管面を方眼紙状にしてそこへ図形を書
きたいという要求があり、このようにするとオペレータ
は方眼から直ちに図形の寸法、位置などを読取ることが
でき、正規化も容易で、方眼のない従って白紙に図形を
画く場合に比べて遥かに扱い易い利点がある。特にグリ
ッド方式でプリント板、集積回路などを設計する際は格
子点は不可欠である。
Prior art and problems This kind of graphic display device is CAD (Computer
When used in the field of aided design, etc., there is a demand for drawing figures on the surface of a CRT tube in the form of graph paper, and in this way the operator can immediately read the dimensions, position, etc. of the figure from the grid. It has the advantage that it can be easily normalized, and is much easier to handle than drawing figures on a blank sheet of paper because there is no grid. Especially when designing printed circuit boards, integrated circuits, etc. using the grid method, grid points are essential.

しかし従来の図形表示装置では図形発生部はベクトル発
生器(円図形発生器もある)位のものであるから、方眼
はベクトル発生器を利用して行なわねばならず、これで
は計算機から入力するデータの量が膨大である。即ち画
面が1024X 1024の画素からなるとすると、8
画素に1つの割合で格子点(交点)をつけたとしても該
点は128X128個あり計算機はそれらの各点のX、
Y座標を入力せねばならず、回線接続の装置では数10
秒以上などの長い時間がか−ってしまう。
However, in conventional graphic display devices, the graphic generator is a vector generator (there is also a circular graphic generator), so grids must be created using a vector generator, and with this, data input from a computer cannot be generated. The amount is huge. In other words, if the screen consists of 1024 x 1024 pixels, 8
Even if one grid point (intersection point) is added to each pixel, there are 128 x 128 points, and the computer calculates the X of each of those points,
You have to enter the Y coordinate, and it takes several tens of seconds for line-connected devices.
It takes a long time, such as more than a second.

発明の目的 本発明はか\る点を改善しようとするもので、図形表示
装置内部に格子点発生装置を設け、ピッチデータをもら
うだけで画面に方眼(格子点、つまり方眼の各交点の点
のみで、線分ではない)を付けられるようにしようとす
るものである。CRTの画面を構成する画素は分解能の
関係から余りに多くすることはできず(多くしてもつぶ
れてしまって無意味)、通寓のCRTでは100OX 
1000程度が限度である。これに画く方眼は3画素に
1個などの細かな間隔のものから10画素、100画素
に1個などの粗い間隔のものなど種々あり、その際割り
切れずに端数がでる場合も当然有り得る。
OBJECT OF THE INVENTION The present invention aims to improve the above points, by providing a grid point generator inside a graphic display device, and simply by receiving pitch data, grid points (grid points, that is, points at each intersection of the grids) are displayed on the screen. (but not line segments). The number of pixels that make up a CRT screen cannot be increased too much due to resolution (even if you increase it, it would be meaningless as it would be crushed), and standard CRTs have 100OX.
The limit is about 1000. There are a variety of grids drawn on this, from those with fine intervals such as one every three pixels to those with coarse intervals such as one every 10 or 100 pixels, and of course there may be cases where it is not divisible and results in a fraction.

端数がでる場合にも全方眼が可及的に等ピッチで並ぶよ
うにすることが、本発明の他の目的である。
Another object of the present invention is to arrange all the squares at as equal a pitch as possible even in the case of fractional numbers.

発明の構成 本発明は計算機より図形データを入力され、該図形デー
タに従って図形パターンを発生する回路、該図形パター
ンを書き込まれる図形メモリ、該メモリの読出し出力を
受けて該図形を表示する表示部を備える装置において、
前記計算機より格子点のピッチを示す小数点以下を含む
正確なデータおよび表示領域の始、終端座標を入力され
て該表示領域内の各格子点座標を出力する格子点発生回
路を備えることを特徴とするが、次に実施例を参照しな
がらこれを説明する。
Structure of the Invention The present invention comprises a circuit that receives graphic data from a computer and generates a graphic pattern in accordance with the graphic data, a graphic memory into which the graphic pattern is written, and a display section that receives readout output from the memory and displays the graphic. In the device equipped with,
It is characterized by comprising a lattice point generation circuit which receives accurate data including decimal points indicating the pitch of lattice points and the start and end coordinates of the display area from the computer and outputs the coordinates of each lattice point within the display area. However, this will now be explained with reference to examples.

第1図で24が本発明で設けた格子点発生回路であり、
その詳細を第2図に示す。格子点発生に際し、計算機か
ら該格子点のX方向のピッチΔXおよびY方向のピッチ
ΔYを送る。第2図の26゜28はこれらのΔX、ΔY
がセットされるレジスタである。また方眼は画面全体に
画く場合の他そ(7)一部のみに画く場合も望まれるの
で、その方眼の存在する領域を指定する左上隅の座標X
I、Y工と右下隅の座標X2.Y2も計算機から送る。
In FIG. 1, 24 is a lattice point generation circuit provided in the present invention,
The details are shown in Figure 2. When generating lattice points, the computer sends the pitch ΔX in the X direction and the pitch ΔY in the Y direction of the lattice points. 26°28 in Figure 2 is these ΔX, ΔY
is the register that is set. In addition to drawing the grid on the entire screen, (7) it is also desirable to draw it only on a part of the screen, so the coordinates of the upper left corner specifying the area where the grid exists
I, Y construction and lower right corner coordinates X2. Y2 is also sent from the computer.

30.32.34.36がこれらの座標値をセットされ
るレジスタである。38.40は選択回路、42.44
は加算器、46.48は比較器、50゜52.54はア
ンドゲート、56はオアゲート、58.60.62.6
4はラッチ(レジスタ)である。
30, 32, 34, and 36 are registers in which these coordinate values are set. 38.40 is the selection circuit, 42.44
is an adder, 46.48 is a comparator, 50°52.54 is an AND gate, 56 is an OR gate, 58.60.62.6
4 is a latch (register).

計算機から横ピッチΔX、縦ピッチΔY9表示領域の左
上端座標XI、Y1.右下端座標X2゜Y2がレジスタ
26.2B、30,32,34゜36にセントされ、ス
タート信号STがオアゲート56に入力すると、該オア
ゲートは出力を生し該出力が選択回路38のa入力端に
入る。該入力があると選択回路38はA入力を選択し、
ランチ58.60はそれを取込む。図示の如くA入力の
一方はO1他方はXlであるから、ラッチ58゜60の
内容は0.XIとなる。加算器42はX1+0=Xtを
出力し、これがメモリのXアドレスになる。比較器46
は加算器42の出力Xとレジスタ34の内容X2とを比
較し、X≦X2ならアンドゲート50,54を開く。従
ってタイミング信号T2が入力する時点でアンドゲート
50は出力を生じ、これはメモリに書込みを指令する信
号となる。またスタート信号STが入ると選択回路40
はA入力0.Ylを選択し、これらはランチ62.64
へ取込まれ、加算器44は0+Y1−Ylを出力し、こ
れがメモリのXアドレスになる。
From the computer, obtain the horizontal pitch ΔX, vertical pitch ΔY9, the upper left corner coordinates of the display area XI, Y1. When the lower right coordinate X2°Y2 is sent to the registers 26.2B, 30, 32, 34°36 and the start signal ST is input to the OR gate 56, the OR gate produces an output, and the output is connected to the a input terminal of the selection circuit 38. to go into. When there is this input, the selection circuit 38 selects the A input,
Lunch 58.60 takes it. As shown in the figure, one of the A inputs is O1 and the other is Xl, so the contents of the latches 58 and 60 are 0. Becomes XI. Adder 42 outputs X1+0=Xt, which becomes the memory's X address. Comparator 46
compares the output X of the adder 42 and the content X2 of the register 34, and opens AND gates 50 and 54 if X≦X2. Therefore, when the timing signal T2 is input, the AND gate 50 produces an output, which becomes a signal instructing the memory to write. Also, when the start signal ST is input, the selection circuit 40
is A input 0. Select Yl, these are lunch 62.64
The adder 44 outputs 0+Y1-Yl, which becomes the memory's X address.

図示しないが書込みデータは當に格子点を示す“1”ま
たは“0”本例では“1”であり、従ってメモリ16(
第1図)にはそのワード、コラムアドレスがXi、Yl
のメモリセルに“1″が書込まれる。
Although not shown, the write data is "1" or "0" that indicates the grid point. In this example, it is "1", and therefore the memory 16 (
In Figure 1), the word and column addresses are Xi, Yl.
"1" is written into the memory cell of.

次にタイミングT1でアンドゲート52.54にパルス
が入り、ゲート54が開いているので選′ 択回路38
のb端子に入力が入り、選択回路38はB入力を選択す
る。B入力はレジスタ26のΔXと加算器42の出力X
、ここではXlであり、加算器42はこれらを加算して
X=Xl+ΔXを出力する。X1+ΔX<X2であれば
比較器46はゲー)50.54を開き、T2のタイミン
グで書込みパルスWが出る。以下同様であり、こうして
X方向にΔXのピッチで格子点“1”がメモリ1.6に
次々に書込まれていく。計算機から入力されるΔXは、
例えば横13c+nの所に7等分した格子点を打つ場合
はΔX=13/7=1.8571428・・・・・・で
あるが小数点以下を含めた可及的に詳しいデータとする
。このようにすると、加算器等でアンダフローが生じて
各ピッチの最小桁で若干異同は生じるがほぼ均一なピッ
チで格子点を発生させることができる。なお格子点はメ
モリセル又は画素に対応する整数部のみで発生し、端数
は計算に使用する。計算結果の端数は切捨てる代りに四
捨五入してもよい。
Next, at timing T1, a pulse enters the AND gates 52 and 54, and since the gates 54 are open, the selection circuit 38
The selection circuit 38 selects the B input. B input is ΔX of register 26 and output X of adder 42
, here Xl, and the adder 42 adds these and outputs X=Xl+ΔX. If X1+ΔX<X2, the comparator 46 opens the gate 50.54, and a write pulse W is output at timing T2. The same goes for the rest, and in this way, lattice points "1" are written one after another in the memory 1.6 at a pitch of ΔX in the X direction. ΔX input from the computer is
For example, when drawing grid points divided into seven equal parts at horizontal 13c+n, ΔX=13/7=1.8571428... However, the data should be as detailed as possible, including the decimal places. In this way, lattice points can be generated at substantially uniform pitches, although underflow may occur in an adder or the like, resulting in slight differences in the minimum digit of each pitch. Note that lattice points occur only in integer parts corresponding to memory cells or pixels, and fractions are used for calculations. Fractions in the calculation result may be rounded off instead of being rounded down.

比較器46はX=X1+nΔX>X2となるとアンドゲ
ート50.54は開放せず、代ってアンドゲート52を
開く。従ってこのXアドレスのメモリセルに書込みは行
なわれず、代ってT1のタイミングパルスが入るとき、
アンドゲート52、従ってオアゲート56が出力を生じ
、選択回路38はA入力0.Xl、を選択する。従って
加算器42の出力は最初のXlに戻る。またアンドゲー
ト52の出力は選択回路40のb入力に入り、該選択回
路にB入力ΔY、加算器44の出力Y(こ−では前記の
如<Yl)を選択させる。従って加算器44はY1+Δ
Yを出力し、これがメモリのXアドレスになる。従って
今度はメモリ16のYア゛トレスはYl +AY、X7
FlzスはXI、X1+ΔX、X1+2ΔX、・・・・
・・のメモリセルに格子点“■”が書込まれていく。以
下同様であり、そして比較器48は加算器44が出力す
るXアドレスとレジスタ36の内容Y2とを比較し、Y
>2になるとメモリ書込み終了を示す信号ENDを出力
する。このメモリへ格子点を書込むひに要する時間は、
例えば従来法の2分に比べて1秒でよい。
Comparator 46 does not open AND gates 50 and 54 when X=X1+nΔX>X2, but instead opens AND gate 52. Therefore, writing is not performed to the memory cell at this X address, and instead, when the timing pulse of T1 is input,
AND gate 52 and therefore OR gate 56 produce an output, and selection circuit 38 has A inputs 0. Select Xl. Therefore, the output of adder 42 returns to the original Xl. The output of the AND gate 52 is input to the b input of the selection circuit 40, causing the selection circuit to select the B input .DELTA.Y and the output Y of the adder 44 (here <Yl as described above). Therefore, the adder 44 is Y1+Δ
Outputs Y, which becomes the memory's X address. Therefore, this time the Y address of memory 16 is Yl +AY,X7
Flz is XI, X1+ΔX, X1+2ΔX,...
Grid points "■" are written to the memory cells of . The same goes for the following, and the comparator 48 compares the X address output by the adder 44 with the content Y2 of the register 36, and
>2, a signal END indicating the end of memory writing is output. The time required to write grid points to this memory is
For example, it only takes 1 second compared to 2 minutes in the conventional method.

従来法ではベクトル発生器12を利用して格子点を発生
する。線分発生は前述のように始、終点座標を与えて行
なうが、格子点つまり点くスポット)発生は始、終点座
標を同じにして行なう。したがって100 x 100
 = 10000の格子点を発生するには2000(1
個のX、Y座標値を入力する必要があり、その各々の座
標値に端数(小数点以下)を含めた正確な値を採用する
と、そのデータ総量は″膨大である。これを96008
 P Sなどの通信速度の回線を通して伝送しなければ
ならない。この点本発明では必要データはΔXとΔYで
済み、表示領域指定用に(Xl、Yl)、  (X2.
Y2)を使用しても僅か6個で済む。
In the conventional method, a vector generator 12 is used to generate grid points. Line segment generation is performed by giving start and end point coordinates as described above, but lattice points (lit spots) are generated by giving the same start and end point coordinates. Therefore 100 x 100
= 2000(1) to generate 10000 grid points
It is necessary to input X and Y coordinate values, and if accurate values including fractions (below the decimal point) are used for each coordinate value, the total amount of data is ``huge''.
It must be transmitted through a communication speed line such as PS. In this regard, in the present invention, the required data are ΔX and ΔY, and for specifying the display area (Xl, Yl), (X2.
Even if Y2) is used, only 6 pieces are required.

画面が1024X 1024画素の場合、1024= 
2  であり、全画素を格子点とした場合が最もピッチ
小であるから、座標表示には10ビツトあればよい。
If the screen is 1024×1024 pixels, 1024=
2, and since the pitch is the smallest when all pixels are used as grid points, 10 bits are sufficient for coordinate display.

これは座標が整数で表わせる場合であるが、端数を含む
場合、これに10ビツトを割当てると、■座標値には2
0ビツト用意する必要がある。一般には1座標値に2バ
イト、1点表示に4バイトを使用することが多い。
This is a case where the coordinates can be expressed as an integer, but if it includes a fraction, then if 10 bits are assigned to it, the coordinate value will have 2 bits.
It is necessary to prepare a 0 bit. Generally, 2 bytes are often used for one coordinate value, and 4 bytes are used for displaying one point.

なおベクトルの発生には幾つかの方法があるが、その1
つは勾配を利用する方法である。即ち始点がXi、 Y
l、終点がX2.Y2なら勾配αはα=ΔY/ΔX= 
(Y2−Yl)/ (X2−Xi)であるからXをXi
、X1+1.X1+2.・・・・・・とインクレメント
させたときYはYl、Yl+α。
There are several ways to generate vectors, one of which is
One method is to use gradients. That is, the starting point is Xi, Y
l, the end point is X2. If Y2, the slope α is α=ΔY/ΔX=
(Y2-Yl)/(X2-Xi), so X is Xi
, X1+1. X1+2. When incremented, Y becomes Yl, Yl+α.

0 Y1+2α、・・・・・・になる。このα、2α、・・
・・・・が1,2・・・・・・になるか否かをチェック
し、端数切捨てでYl、Yl、Yl−1−1,・・・・
・・などとする。割算ΔY/ΔXをするのは厄介である
からΔX倍してΔY、2ΔY、・・・・・・かをチェッ
クするのが一般である。格子点発生の場合はΔY−ΔX
−0であり、単に始終点をプロットしてゆくだけである
0 Y1+2α,... This α, 2α,...
Check whether ... is 1, 2, etc., and round down the fractions to Yl, Yl, Yl-1-1, ...
...and so on. Since it is troublesome to divide ΔY/ΔX, it is common to multiply by ΔX and check whether ΔY, 2ΔY, . . . . In case of lattice point generation, ΔY - ΔX
-0, and simply plots the starting and ending points.

また、方眼を多数の格子点で表わすと、これを多数の縦
線と横線で表わす場合より、図形を見ずらくする又は見
誤ることがないなどの利点がある。
Moreover, when a grid is represented by a large number of grid points, there is an advantage that the figure is not difficult to see or is not misunderstood, compared to a case where the grid is represented by a large number of vertical lines and horizontal lines.

また格子点発生回路24で発生した格子点は図形メモリ
16に書込む代りに、格子点メモリを用意してこれに書
込み、CRTの走査と同期してそして図形メモリと共に
読出すようにすると、画面上の図形パターンを消去して
も格子点は残り、方眼紙を使用しているのと同等な感触
が得られる。
Furthermore, instead of writing the lattice points generated by the lattice point generation circuit 24 into the graphic memory 16, if a lattice point memory is prepared and written therein, and then read out together with the graphic memory in synchronization with the scanning of the CRT, the screen Even if you erase the upper graphic pattern, the grid points remain, giving you the same feel as using graph paper.

発明の詳細 な説明したように本発明によれば計算機からのデータ量
が少なくて所望ビ゛ツチ、所望領域に格子点を正確に発
生することができ、甚だ有効である。
DETAILED DESCRIPTION OF THE INVENTION As described in detail, according to the present invention, grid points can be accurately generated on desired beaches and in desired regions with a small amount of data from a computer, which is extremely effective.

【図面の簡単な説明】[Brief explanation of drawings]

第1図は本発明の概要を示すブロック図、第2図は格子
点発生回路の詳細を示すブロック図である。 図面で、12は図形パターンを発生する回路、16は図
形メモリ、20は表示部、24は格子点発生回路である
。 出願人 富士通株式会社 代理人弁理士  青  柳    稔 1 2 第2図
FIG. 1 is a block diagram showing an overview of the present invention, and FIG. 2 is a block diagram showing details of a lattice point generation circuit. In the drawing, 12 is a circuit for generating a graphic pattern, 16 is a graphic memory, 20 is a display section, and 24 is a lattice point generating circuit. Applicant Fujitsu Limited Representative Patent Attorney Minoru Aoyagi 1 2 Figure 2

Claims (1)

【特許請求の範囲】[Claims] 計算機より図形データを入力され、該図形データに従っ
て図形パターン渣発生する回路、該図形パターンを書き
込まれる図形メモリ、該メモリの読出し出力を受けて該
図形を表示する表示部を備える装置において、前記計算
機より格子点のピッチを示す小数点以下を含む正確なデ
ータおよび表示領域の始、終端座標を入力されて該表示
領域内の各格子点座標を出力する格子点発生回路を備え
ることを特徴とする図形表示装置。
An apparatus comprising: a circuit that receives graphic data from a computer and generates a graphic pattern residue according to the graphic data; a graphic memory into which the graphic pattern is written; and a display section that receives read output from the memory and displays the graphic. A figure characterized by comprising a lattice point generation circuit which receives accurate data including decimal points indicating the pitch of lattice points and the start and end coordinates of a display area and outputs the coordinates of each lattice point within the display area. Display device.
JP57103189A 1982-06-16 1982-06-16 Graphic display Granted JPS58220178A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP57103189A JPS58220178A (en) 1982-06-16 1982-06-16 Graphic display

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP57103189A JPS58220178A (en) 1982-06-16 1982-06-16 Graphic display

Publications (2)

Publication Number Publication Date
JPS58220178A true JPS58220178A (en) 1983-12-21
JPH0318194B2 JPH0318194B2 (en) 1991-03-11

Family

ID=14347568

Family Applications (1)

Application Number Title Priority Date Filing Date
JP57103189A Granted JPS58220178A (en) 1982-06-16 1982-06-16 Graphic display

Country Status (1)

Country Link
JP (1) JPS58220178A (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6678346B2 (en) * 2001-10-11 2004-01-13 Ge Medical Systems Global Technology Company Llc Cone-beam CT scanner with image reconstruction using multiple sub-images

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS50120738A (en) * 1974-03-08 1975-09-22
JPS5695284A (en) * 1979-10-05 1981-08-01 Kowa Co Screen display unit
JPS5793394A (en) * 1980-12-02 1982-06-10 Nippon Electric Co Screen divition type display

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS50120738A (en) * 1974-03-08 1975-09-22
JPS5695284A (en) * 1979-10-05 1981-08-01 Kowa Co Screen display unit
JPS5793394A (en) * 1980-12-02 1982-06-10 Nippon Electric Co Screen divition type display

Also Published As

Publication number Publication date
JPH0318194B2 (en) 1991-03-11

Similar Documents

Publication Publication Date Title
JPH0126072B2 (en)
JPH0225192B2 (en)
CA1200025A (en) Graphic and textual image generator for a raster scan display
KR890003033B1 (en) Listing system
JPH03119387A (en) Method and apparatus for forming contour of digital type surface
JPH10283492A (en) Layout typesetting method
JPS58220178A (en) Graphic display
US3818475A (en) Digitally operating graphic display system
JPS59223483A (en) Display
CN113220375B (en) Method and system for generating hollow text silk screen based on Allegro software
JPS63217394A (en) Character contour line generation system
JPH0315193B2 (en)
JPH08147210A (en) Bit map memory device
JP2001249656A (en) Character and graphic deformation processing device
JP2760522B2 (en) Display control device
JPH01590A (en) Character generation method for computer systems
JP2987983B2 (en) Character display device
JP2787487B2 (en) Circuit for determining the position of a line segment displayed and operated on a computer system
JPH0283589A (en) Character size representation system for display device
JPS62133578A (en) Data selecting and editing device
JPH05134641A (en) Cursor display method for display device
JPS62219180A (en) Pattern generating device
JPH05205070A (en) Graphic plotting method
JPS62157089A (en) Generation of vector character
JPH09325872A (en) Sfc production device