JPS5960560A - Figure data processing method - Google Patents

Figure data processing method

Info

Publication number
JPS5960560A
JPS5960560A JP57171973A JP17197382A JPS5960560A JP S5960560 A JPS5960560 A JP S5960560A JP 57171973 A JP57171973 A JP 57171973A JP 17197382 A JP17197382 A JP 17197382A JP S5960560 A JPS5960560 A JP S5960560A
Authority
JP
Japan
Prior art keywords
line segment
line
segment
multiplicity
given
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
JP57171973A
Other languages
Japanese (ja)
Other versions
JPH0253823B2 (en
Inventor
Noriaki Nakayama
中山 範明
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 JP57171973A priority Critical patent/JPS5960560A/en
Publication of JPS5960560A publication Critical patent/JPS5960560A/en
Publication of JPH0253823B2 publication Critical patent/JPH0253823B2/ja
Granted legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00Image analysis

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)

Abstract

PURPOSE:To extract easily a complicated overlapping figure having an optional overlap by giving directivity to a loop-like pattern line, and setting a multiple degree to a segment to which directivity is given. CONSTITUTION:A double overlapping area is selected by a figure formed by overlapping a figure Q and a figure R on a figure P having a hollow space area P0. First of all, an inputted pattern is fetced as a line in the X axis direction, respectively. Subsequently, an area dividing line passing through segment end points P1, P2 of the figure P is set as a left end line, and to the right side successively from said line, an area dividing line Y11 passing through a segment end point of each figure is set, an area dividing line Y19 passing through segment end points P3, P4 of the figure P is set as a right end line, and area dividing lines between them are denoted as Y12-Y18. Subsequently, the segment direction is set to a direction where a figure area always exists on the left side, a positive code is given to a segment in the right direction, a negative code is given to a segment in the left advancing direction, a multiple degree of a segment of the lowest end is set to +1, and a vaue of a multiple degree and a code are given successively to a right above segment. In this way, a multiple degree of a segment is set, and a segment having a designated multiple degree is extracted from said multiple degree.

Description

【発明の詳細な説明】 (a)  発明の技術分野 本発明は半導体集積回路(工C)などの回路パターン図
設計のだめの図形データの加工に係り、特に図形の論理
演算に必要となる領域の重なりを高速に選出できる図形
データ処理方法に関する。
[Detailed Description of the Invention] (a) Technical Field of the Invention The present invention relates to the processing of graphic data for circuit pattern diagram design of semiconductor integrated circuits (engineering C), etc. The present invention relates to a graphic data processing method that allows high-speed selection of overlaps.

(b)  技術の背景 CA D (Computer Aided Desi
gn )は■Cの高集積化と共に重要性を増し、LSI
、VLSIなとの開発・設計・製造には不可欠のものと
なつてきた。かようなCA Dシステムにおいて、複数
の部分図形を繋ぎ合わせる図形処理、あるいは回路内の
コンデンサ面積を抽出するなどの回路検討や回路解析の
ための図形処理には、通常同一領域上の異なる複数の図
形を瓜ね合わせて、重なり度を選出する図形データ処理
が必要となる。
(b) Technology background CA D (Computer Aided Desi)
gn) has become more important with the increasing integration of ■C, and LSI
It has become indispensable for the development, design, and manufacturing of VLSI. In such a CAD system, graphic processing that connects multiple partial graphics, or graphic processing for circuit study or circuit analysis such as extracting the area of a capacitor in a circuit, usually requires the processing of multiple different parts on the same area. Graphic data processing is required to match the shapes and select the degree of overlap.

即ち、CADシステムではアートワーク設計図をパター
ンジェネレータ(PG)用図形データに変換する図形処
理が行われているが、このような図形データから設計者
や解析者に必要な重なり図形を容易に表示するだめの図
形データ処理方法が必要である。
In other words, in a CAD system, graphic processing is performed to convert artwork blueprints into graphic data for a pattern generator (PG), but it is possible to easily display overlapping shapes required by designers and analysts from such graphic data. A comprehensive graphic data processing method is required.

(c)  従来技術と問題点 今、重なりをもった図形から重なシ図形を選出するため
の従来の図形データ処理方法を、例示した第1図および
第2図にょシ説明する。第1図においては、図形Aが線
分端点al、a、、a3.a4の座標値で与えられ、ま
た図形Bが線分端点bl、b2゜b3. b4の座標値
で与えられると、これらの端点においてY軸に平行(X
軸に垂直)な領域分割線YI+ Y、、y3.y4を設
ける。そしてYI線と¥2線との間をイ分割領域、¥2
線と¥3線との間を四分?41j領域、Y3線とY4線
との間をへ分割領域として、そのうち四分割領域におい
ては図形Aの図形線分の間に、図形11の図形線分が含
まれているので、1)1点と1)2点とのYん標値の間
は2重の重なりであると認識する。これらはすべて計算
機の中で中央処理装置とメモリによって行われ、表示器
例えばCE(Tなどに表示さJLる。
(c) Prior Art and Problems A conventional figure data processing method for selecting overlapping figures from overlapping figures will now be described with reference to FIGS. 1 and 2, which illustrate them. In FIG. 1, figure A has line segment endpoints al, a, , a3 . It is given by the coordinate values of a4, and figure B is the line segment end point bl, b2°b3 . Given the coordinate values of b4, parallel to the Y axis (X
(perpendicular to the axis) area dividing line YI+ Y,, y3. Provide y4. Then, between the YI line and the ¥2 line is the I-divided area, ¥2
A quarter between the line and the ¥3 line? 41j area, between the Y3 line and the Y4 line is divided into four areas, and the figure line segment of figure 11 is included between the figure line segments of figure A in the quadrant area, so 1) 1 point It is recognized that there is a double overlap between the Y reference values and 1) two points. All of these are performed by the central processing unit and memory in the computer, and are displayed on a display such as CE (T).

第2図はや!複4゛ILな図形を示しでいるが、同様に
して領域分割線’I’11によって重なりをもった図形
Cとは]形りを二・ホ・へ・1−・チ・りの各分割領域
に区分し、図示のようにホとへとの分割領域に2重の重
なりがあると認識される。
Figure 2 Haya! Although the diagram shows a multiple 4゛IL figure, what is the figure C which similarly overlaps by the area dividing line 'I'11] The shape is divided into 2, H, H, 1-, CH, and R The image is divided into regions, and as shown in the figure, it is recognized that there is a double overlap between the divided regions.

このように、従来はループ状図形線の線分列の間に他の
図形線の線分が存在するが否かの判定を行なっているが
、このような従来方法では、常に図形線の線分対が、他
の図形線の線分対とどのような位置関係にあるかの判定
が必要で、2重の重なシだけでなく3重以上の多重に重
なった場合、ぞの判定が極めて複雑になる。
In this way, conventionally, it is determined whether or not there is a line segment of another figure line between the line segment string of the loop figure line, but in this conventional method, the line of the figure line is always It is necessary to judge what kind of positional relationship the segment pair has with the line segment pairs of other figure lines, and if they overlap not only twice but also three times or more, the judgment is difficult. becomes extremely complex.

更に、図形りのような中抜き空間域をもった図形が重な
り、中抜き空間域同志がMLなった場合、その′!、ま
で処理することは不能となシ、従来は論理の矛盾として
除去して、処理されていない。その場合は、2つの中抜
き中間域を1つの中抜き空間域に操作者が人為的に合併
処理して入力している。例えば、第3図はこれを図示し
たもので、中抜き空間域Eoをもつ図形Eと、同じく中
抜き空間域17’oをもつ図形1・゛が重なって両方の
中抜き空間域も重なると、操作者は12個の座標値をも
つそ中形状の他の中抜き空間域GoとしてEOとp。
Furthermore, if figures with hollow space areas such as figures overlap and the hollow space areas become ML, then the '! , it is impossible to process the problem until now, and conventionally it has been removed as a logical contradiction and has not been processed. In that case, the operator artificially merges two hollow intermediate areas into one hollow space area and inputs the result. For example, Fig. 3 illustrates this, and shows that figure E, which has a hollow space area Eo, and figure 1. , the operator selects EO and p as other hollow space areas Go with 12 coordinate values.

を合併し、図形E又は図形Fの何れかの中抜き空間域と
する処理が操作者によって予め行われる。
The operator performs a process in advance to merge the shapes and create a hollow space area of either figure E or figure F.

しかし、このように重なシが多くなって処理が複雑とな
れば、処理時間が長くかがυ、且つ上記のように人為的
処理を加えなければならない問題が発生すれば、処理ミ
スが起る危険があり、また操作者にとって大きな負荷と
なる。
However, if the number of overlapping files increases and the processing becomes complicated, the processing time will be long, and if problems arise that require manual processing as described above, processing errors will occur. There is a danger that this will result in a large amount of stress on the operator.

(d、)  発明の目的 本発明はこのような欠点を解消させ、任意の重なりをも
つ複雑な軍なシ図形を高速に容易に抽出する図形データ
処理方法を提供することを目的とするものである。
(d.) Purpose of the Invention It is an object of the present invention to eliminate such drawbacks and provide a graphic data processing method that can quickly and easily extract complex military graphics with arbitrary overlaps. be.

(e)発明の41!4成 本発明の特徴は、複数の重なった入力図形から指定した
重なりをもつ図形を得る図形データ処理において、該複
数の入力図形それぞれの線分に方向を与え、該複数の人
力図形それぞれの線分端点を通り、所定の軸に対して平
行な分割線によって分割し、次いで同一分割領域内にあ
る線分に対し、最側端線分より順次該線分の方向に基づ
いた線分俳号を参照して該線分に多重度を設定し、該多
重度によって入力図形の重なシ度を認識することにより
指定した多重度をもつ線分を取り出すことにより達成さ
れ、特に線分方向は図形領域が絶えず左側に存在する方
向として、右進行方向の線分に正符号を与え、左進行方
向の線分に負荷号を与えて、最下端の線分を+l(反転
処理の場合には−1)として、順次に直上の線分に多重
度の値と符号とを付与し、その際、直下の線分と同一進
行方向の線分には+1(反転処理の詩は−1)を加え、
逆進行方向の線分には正負符号を反転させるのみとし、
且つ多重度がOとなる線分、多重度符号が正で且つ線分
の方向が左進行方向となる線分、および多重度符号が負
で且つ該線分方向が右進行方向となる線分を無効線分と
する多重度の選出処理がなされることにあるものである
(e) 41!4 Features of the present invention are that, in graphic data processing for obtaining a figure with a specified overlap from a plurality of overlapping input figures, a direction is given to each line segment of the plurality of input figures; The human figure is divided by a dividing line that passes through the end point of each line segment and is parallel to a predetermined axis, and then, for line segments within the same divided area, the line segment is sequentially moved in the direction of the line segment from the end point on the side. This is achieved by setting a multiplicity to the line segment by referring to the line segment haiku based on it, and extracting a line segment with the specified multiplicity by recognizing the degree of overlap of the input shape based on the multiplicity, In particular, regarding the line segment direction, the figure area is always on the left side, so a positive sign is given to the line segment in the right direction, a load sign is given to the line segment in the left direction, and the lowest line segment is +l (inverted). In the case of processing, the multiplicity value and sign are sequentially given to the line segments directly above, and +1 (in the case of reversal processing) is given to the line segment in the same direction of movement as the line segment immediately below. add -1),
For line segments in the opposite direction, only the sign is reversed,
A line segment whose multiplicity is O, a line segment whose multiplicity sign is positive and whose direction is a leftward movement direction, and a line segment whose multiplicity sign is negative and whose direction is a rightward movement direction. The purpose is to perform a multiplicity selection process in which the line segment is an invalid line segment.

(n 発明の実施例 ところで、計算機による図形処理はアートワーク設計図
(レイアウトパターン図)を座標読取装置より入力し、
計算処理された図形は表示器に出力されるが、本発明の
従来方法と異なる点は計算処理に際してループ状図形線
に方向性をもたせることにあり、それにより正確且つ迅
速に処理せんとするものである。第4図はその方向の一
例を示す図で、図形領域外枠の図形線5は1つの閉じた
ループで表わされ、また図形領域内中抜空間域を画する
図形線6も同じく閉じたル−プで表わされる。本発明で
は、これらの図形線の方向を、図形領域が絶えず左側に
ある方向、即ち外枠の図形線5の進行方向は常に反時計
方向、中抜きの図形線6の進行方向は常に時計方向と定
義づけする。
(n Embodiment of the invention By the way, graphic processing by a computer involves inputting an artwork design drawing (layout pattern drawing) from a coordinate reading device,
The calculated figures are output to the display, but the difference from the conventional method of the present invention is that the loop-shaped figure lines are given directionality during the calculation process, thereby achieving accurate and quick processing. It is. FIG. 4 is a diagram showing an example of the direction, in which the figure line 5 of the outer frame of the figure area is represented by one closed loop, and the figure line 6 that demarcates the hollow space area within the figure area is also closed. Represented by a loop. In the present invention, the direction of these figure lines is such that the figure area is always on the left side, that is, the outer frame figure line 5 always moves counterclockwise, and the hollow figure line 6 always moves clockwise. Define it as

このように図形に方向性を定義し、図形データ処理に際
しても定めた他の規定を設けて処理するもので、第5図
に示す一実施例の図形を、第6図に示す図形処理のフロ
ーチャートと比較しながら本発明の詳細な説明する。第
5図は中抜き空間域POをもった図形Pに図形Q、、図
形Rが重ね合った図形で、2重の重なり領域を選出する
ものとする。
In this way, the directionality is defined for the figure, and the figure data processing is also performed with other stipulations established, and the figure of one embodiment shown in FIG. The present invention will be described in detail in comparison with the following. FIG. 5 shows a figure in which figures Q, .

座標読取装置よシ入力した図形データは1つのルτプ図
形のデータとして読み込まれているから、それぞれの図
形をX軸方向の線として取り出す。
Since the graphic data input from the coordinate reading device is read as data for one loop figure, each figure is extracted as a line in the X-axis direction.

それが第6図に示すル−プデータの線分化11である。This is the line division 11 of the loop data shown in FIG.

次いで、線分化2された線分の端点において領域分割線
を設けるが、それには図形Pの線分端点P l + P
2を通る領域分割線を左端線とし、それよシ順次に右側
へ、各図形の線分端点を通る領域分割線Yllを設定し
、図形Pの線分端点P3. )’4を通る領域分割線Y
19を右喘線とし、その間の領域分割線をY+g〜Y+
sとする。これが第6図に示す領域分割線の決定12で
ある。
Next, an area dividing line is provided at the end point of the segment that has been segmented into line segment 2.
The area dividing line passing through P3. ) '4 area dividing line Y
19 is the right pant line, and the area dividing line between them is Y+g~Y+
Let it be s. This is the area dividing line determination step 12 shown in FIG.

以上の処理の後、それに伴なう分割領域1〜Vlll内
の分割領域13を確認し、その領域内の線分をY座標に
沿って、下方より上方に並べかえる処理、即ち線分Y座
標昇順ソーティング14が行われて、各分割領域内の線
分数nが把握される。次いで、本発明にかかる分割領域
内線分の処理がなされるが、それには先づ初期値の設定
16を行なう。初期値(i−〇)は、1を下方より昇順
の線分番号とし、■1を線分化された時に設定された線
分方向として左方向を−1,右方向を+1とし、41を
多重度の値とすると、vO=  1.(!o=  1と
設定する。これは最下端の線分より更に下の仮定の線分
であシ、もし図形領域を反転処理する場合にはVo=+
1. d(1=+1としテFk 定すレル。
After the above processing, the corresponding divided regions 1 to 13 within Vllll are confirmed, and the line segments within the regions are rearranged from the bottom to the top along the Y coordinate, that is, the line segment Y coordinate. Ascending sorting 14 is performed to determine the number n of line segments within each divided area. Next, the line segments within the divided area according to the present invention are processed, but first, initial values are set 16. The initial value (i-〇) is 1 as the line segment number in ascending order from the bottom, 1 as the line segment direction set when the line was divided, -1 for the left direction, +1 for the right direction, and 41 as the multi-line segment number. Assuming the severity value, vO=1. (Set !o=1. This is a hypothetical line segment further below the bottom line segment. If the graphic area is to be reversed, Vo=+
1. d(1=+1, then Fk).

このようにして線分番号1を下方より加算16し、1〉
nとなれば線分終了判定17がなされて、次の分割領域
に移り、順次に分割領域を処理してゆき、領域がなくな
れば処理終了となる。以上のことを第5図の実施例VC
よって具体的に説明すれば、領域分割h; ”’″11
とYI2とで区分された1分割領域内の下刃: 14H
分(端点Pg (III方の線分)から上方に処11 
L、次に領域分割線yt2とY13とで区分けされた■
分tす領域の線分を同様に下方から」三方に処理し、順
次にこのようにしてvl)1分割領域の最上方の線分(
端点P3側方の線分)まで処理することを息味している
In this way, line segment number 1 is added 16 from below, and 1>
When n is reached, a line segment end determination 17 is made, the process moves to the next divided area, and the divided areas are sequentially processed, and when there are no more areas left, the process ends. The above is explained in the example VC of FIG.
Therefore, to explain specifically, area division h; ``'''11
Lower blade in one divided area divided by and YI2: 14H
11 upwards from the end point Pg (III line segment)
L, then ■ divided by area dividing lines yt2 and Y13
Similarly, the line segments of the divided area are processed in three directions from the bottom, and in this way, the uppermost line segment of the divided area (vl)
It is intended to process up to the line segment on the side of the end point P3.

次に線分処理の内容を説明すると、線分jJついて■1
・Vi−1を検出18し、■1・Vx−]>O即ち線分
(i−1)と線分iとが同じ進行方向の場合にはその線
分iの値は(l 1=ffi−1+ 1とし、これを多
重度とする。また、■1・V4−+<O即ち線分(i−
1)と線分1とが異なる進行方向の場合は多重度の値を
ll1=li−1−1とする。この処理を多重度の設定
と呼ぶ。このようにして処理して得られた線分の多重度
を第5図にイτ1記している。
Next, to explain the contents of line segment processing, regarding line segment jJ■1
・Vi-1 is detected 18, and if ■1・Vx-]>O, that is, line segment (i-1) and line segment i are in the same direction of travel, the value of line segment i is (l 1=ffi −1+ 1, and this is the multiplicity. Also, ■1・V4−+<O, that is, the line segment (i−
1) and line segment 1 are in different traveling directions, the multiplicity value is set to ll1=li-1-1. This process is called multiplicity setting. The multiplicity of the line segment obtained by processing in this manner is indicated by τ1 in FIG.

なお、反転処理の場合は■1・Vl−+>Oのとき、e
l−++1 td、(Jl−1−1トfxル。
In addition, in the case of inversion processing, ■ When 1・Vl−+>O, e
l-++1 td, (Jl-1-1 tofx le.

次いで、elの絶対値L=lβ11を検出19し、所望
の選出しようとする止なシ度、例えば2瓜の重なりを検
出したい場合は、2重の重なシを表わす多重度の絶対値
のめを有効線分とする。
Next, detect the absolute value L=lβ11 of el, and if you want to detect the desired degree of selection, for example, the overlap of two melons, calculate the absolute value of the multiplicity representing two overlapping words. Let the line segment be the effective line segment.

次いで、nl・vlの検出20をおこなう。これは中抜
き空間域線分の多重度の判定でf)シ、換言すれば右進
行方向の線分は正符号、左進行方向の線分は負符号でな
ければならない規定である。寸たel・v1=0も無効
線分であると判定する。
Next, detection 20 of nl and vl is performed. This is a determination of the multiplicity of the hollow space area line segment f).In other words, the line segment in the rightward direction must have a positive sign, and the line segment in the leftward direction must have a negative sign. The line segment el·v1=0 is also determined to be an invalid line segment.

このようにして2重の重なシ度に有効な線分の多重度値
+2〜−2を抽出21Lで、表示器で表示すれば第7図
の図形Sが見られる。これはA ND処理であシ、また
図形領域があるかどうかのOR処理は多重度値+1〜−
■の線分を同様にして抽出すれはえられる。同様に3重
の重なりは多重度+3〜−3を選出すればえられる。
In this way, if the multiplicity values of the line segments effective for double overlapping degrees are extracted from +2 to -2 at 21L and displayed on the display, the figure S shown in FIG. 7 can be seen. This is an AND process, and the OR process to determine whether there is a graphic area is a multiplicity value of +1 to -
The line segment (①) can be extracted in the same way. Similarly, triple overlap can be obtained by selecting a multiplicity of +3 to -3.

第5図に示す図形では、11・v1検出20において問
題となる線分はなかったが、第8図に示すように外枠の
図形線が同一であり中抜き空間域、Go、J(o、工0
が3つ重なった場合には図に記入しているような多重1
度が設定され、多重7i値が0、線分方向が左で多重度
が+1および線分方向が右で多月f度が−1の線分が無
効とされて、中抜き空間域の重なりも選出することがで
きる。従来の図形データ処理ではこのような場合は不能
であった。
In the figure shown in FIG. 5, there were no line segments that caused problems in the 11·v1 detection 20, but as shown in FIG. , Effort 0
If three overlap, multiple 1 as shown in the figure
degree is set, the multiplicity 7i value is 0, the line segment direction is left and the multiplicity is +1, the line segment direction is right and the multiplicity f degree is -1, and the line segment is invalidated, and the hollow space area overlaps. can also be selected. Conventional graphic data processing could not handle such cases.

頓 発明の効果 以上の説明から判るように、本発明によれば方向性を与
えた線分に多重度を設定することにより、複雑な図形の
重なシも容易に抽出することができる。且つ中抜き空間
域の重なりも人為的な処理を加えることなく処理される
Effects of the Invention As can be seen from the above description, according to the present invention, by setting multiplicity to line segments that have been given directionality, it is possible to easily extract overlapping lines in complex figures. Moreover, overlapping of hollow space areas is also processed without adding any artificial processing.

したがって、本発明はCADシステムにおいて図形処理
が容易に高速に行われて、操作者の負荷も軽減され、正
確なチェックが可能になるものである。
Therefore, according to the present invention, graphical processing can be easily and quickly performed in a CAD system, the burden on the operator can be reduced, and accurate checking can be performed.

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

第1図、第2図、第3図は従来の図形データ処理を説明
するだめの図形、第4図は本発明にかかる線分の方向性
を示す図、第5図は本発明による一実施例の図形、第6
図は本発明にかかるフローグーヤー1、第7図は本発明
によってえられた2重の爪なり図形、第8図は本発明に
よる他の実施例の図形である。 図中、A、 13. C,f)、 ]ハF、 J’、 
Q、、 1(は図形、”’O+ ’O9J〕0.GO+
 HO1工0  は中抜き空間域、]〕1. l’2.
.1.’3. P4. a l+ al!+ a3. 
a4. J 、b、4゜b3.’l)4け線分端点、S
は2重の重なり図形を示すO 第1図 第2図 第3図 第4図 第5図 第7図 r−−”−−’    −一−−−−−−−−−−コ1 1 1 □ ]            1 「 第8図 1
Figures 1, 2, and 3 are diagrams for explaining conventional graphic data processing, Figure 4 is a diagram showing the directionality of line segments according to the present invention, and Figure 5 is an example of an implementation according to the present invention. Example shape, 6th
The figure shows a flow gear 1 according to the present invention, FIG. 7 shows a double claw pattern obtained by the present invention, and FIG. 8 shows a pattern of another embodiment according to the present invention. In the figure, A, 13. C, f), ]HaF, J',
Q,, 1(is a figure, "'O+ 'O9J]0.GO+
HO1 work 0 is the hollow space area,]]1. l'2.
.. 1. '3. P4. a l+ al! + a3.
a4. J, b, 4°b3. 'l) 4-digit line segment end point, S
indicates a double overlapping figure O Fig. 1 Fig. 2 Fig. 3 Fig. 4 Fig. 5 Fig. 7 □ ] 1 " Figure 8 1

Claims (2)

【特許請求の範囲】[Claims] (1)  複数の重なった入力図形から指定した重なυ
をもつ図形を得る図形データ処理において、該複数の入
力図形それぞれの線分に方向を与え、該複数の入力図形
それぞれの線分端点を通シ、所定の軸に対して平行な分
割線によって分割し、次いで同一分割領域内にある線分
に対し、最側端線分より順次読線分の方向に基づいた線
分俳号を参照して該線分に多重度を設定し、該多重度に
よって入力図形の重、1度を認識することによシ指定し
た多重度をもつ線分を取り出すことを特徴とする図形デ
ータ処理方法。
(1) Overlapping υ specified from multiple overlapping input figures
In graphic data processing to obtain a figure with , a direction is given to each line segment of the plurality of input figures, and the line segments of the plurality of input figures are divided by a dividing line parallel to a predetermined axis through the end point of each line segment. Then, for the line segments in the same divided area, the multiplicity is set for the line segment by referring to the line segment haiku based on the direction of the line segment, starting from the endmost line segment, and A graphic data processing method characterized in that a line segment having a specified multiplicity is extracted by recognizing the multiplicity of an input graphic, 1 degree.
(2)線分方向は図形領域が絶えず左側に存在する方向
として、右進行方向の線分に正符号を与え、左進行方向
の線分に負符号を与え、最下端の線分の多重度を+1(
反転処理の場合には−1)として、順次に直上の線分に
多重度の値と符号を付与し、その際、直下の線分と同一
進行方向の線分には+1(反転処理の時は−1)を加え
、逆進行方向の線分には正負符号を反転させるのみとし
、且つ線分多重度がOとなる線分、多重度符号が正でか
つ該線分の方向が左進行方同表なる線分、および多重度
符号が負でかつ該線分方向が右進行方向となる線分を無
効線分とする指定多重度をもつ線分の選出処理がなされ
てなることを特徴とする特許請求の範囲第1項記載の同
形データ処理方法。
(2) The line segment direction is the direction in which the figure area always exists on the left side, and a positive sign is given to the line segment in the right direction, a negative sign is given to the line segment in the left direction, and the multiplicity of the lowest line segment is +1(
In the case of reversal processing, the multiplicity value and sign are given to the line segments directly above one after another, and +1 (in the case of reversal processing) is given to the line segment in the same direction of movement as the line segment immediately below. -1) is added, and the positive and negative signs are only reversed for the line segment in the opposite direction, and the line segment multiplicity is O, and the multiplicity sign is positive and the direction of the line segment is leftward movement. The method is characterized in that a line segment having a specified multiplicity is selected, and a line segment whose multiplicity sign is negative and whose direction is a right-progressing direction is set as an invalid line segment. An isomorphic data processing method according to claim 1.
JP57171973A 1982-09-29 1982-09-29 Figure data processing method Granted JPS5960560A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP57171973A JPS5960560A (en) 1982-09-29 1982-09-29 Figure data processing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP57171973A JPS5960560A (en) 1982-09-29 1982-09-29 Figure data processing method

Publications (2)

Publication Number Publication Date
JPS5960560A true JPS5960560A (en) 1984-04-06
JPH0253823B2 JPH0253823B2 (en) 1990-11-19

Family

ID=15933173

Family Applications (1)

Application Number Title Priority Date Filing Date
JP57171973A Granted JPS5960560A (en) 1982-09-29 1982-09-29 Figure data processing method

Country Status (1)

Country Link
JP (1) JPS5960560A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6371777A (en) * 1986-09-13 1988-04-01 Sharp Corp Extracting method for relation of graphic connection

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0565884U (en) * 1992-02-17 1993-08-31 日東工業株式会社 Degassing machine for aerosol cans

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6371777A (en) * 1986-09-13 1988-04-01 Sharp Corp Extracting method for relation of graphic connection

Also Published As

Publication number Publication date
JPH0253823B2 (en) 1990-11-19

Similar Documents

Publication Publication Date Title
CN113642057B (en) Method for automatically generating Autocad format flow velocity vector diagram
CN114556352A (en) Method and system for performing automatic wiring
JPS5960560A (en) Figure data processing method
CN103745072B (en) Automatically the method for extended defect shape library
JP2005149273A (en) Apparatus and method for floor planning of semiconductor integrated circuit
CN115130415B (en) Power supply network transient simulation method, device, equipment and medium
JP3307498B2 (en) Graphic drawing apparatus and method
Courbot et al. Triplet Markov trees for image segmentation
CN116205198B (en) Circuit schematic diagram module column ordering method, equipment and medium based on dynamic programming
JP2684609B2 (en) Graphic display method in graphic data processing device
JPS5846173B2 (en) Logical wiring design method
JP2938431B1 (en) Wiring design device, wiring determination device, and methods thereof
Zhang et al. A fuzzy attributed graph approach to subcircuit extraction problem
JP3144785B2 (en) Signal delay time calculation method
JPS5922160A (en) Graph processing method
Tetelbaum Force embedding of a planar graph
JP2914025B2 (en) LSI automatic placement and routing processing method
JP2000222605A (en) Finite element generating device and finite element generating method
JPH06274308A (en) Uniform modeling generation processing method for bezier curve
JPH04167082A (en) Polygonal approximation system for curved section
JPS6180454A (en) Retrieving method of graphic element
JPS60254618A (en) Distinguishing method of connecting relation in circuit
JPH04369081A (en) Automatic wiring system
JPH06325132A (en) Automatic wiring method
JPH08194727A (en) Connection relation display method among arranged elements