Method of recognizing overlapped graphics in each degree of overlapping thereof

Claim 2

In a computer aided design system comprising a graphics data input means for inputting data representing figures of a circuit pattern of an integrated circuit, said figures having points in a coordinate system, a graphics processor for processing said input data and output means for displaying graphics obtained by said graphics processor, a method of recognizing an object graphic on which given first graphics overlap with each other at a designated degree of overlapping comprising the steps of: (a) making a first list of first segments defining given first graphics which are overlapped with each other on an image plane and storing said first list in a memory of said graphics processor; (b) recognizing respective apices and crosspoints of said first graphics through use of said first list; (c) dividing said first segments into partial segments at said crosspoints; (d) reconnecting said partial segments with each other at said crosspoint while changing a connecting relation among said partial segments so that reconnected partial segments form a boundary between areas on which said first graphics overlap with each other at different degrees of overlapping, respectively, to thereby convert said first graphics to second graphics which define an area on said image plane for each degree of overlapping of said first graphics; (e) storing said reconnected said partial segments in said memory; (f) making a second list of second segments defining respective contours of said second graphics and storing said second list in said memory; (g) selecting one segment within third segments which are included in said second segments and defining an area on which said first graphics overlap with each other at said designated degree of overlapping; (h) accessing said memory and extracting said third segments from said second list by tracing said third segments in said second list from said one segment, to recognize said object graphic defined by said third segments; and (i) transmitting said recognized object graphic to said output means.

Claim 3

A method of claim 1, wherein the step (f) includes the step of: (f-1) modifying said first segments in said first list in accordance with division of said first segments in the step (c) and reconnection of said partial segments in the step (d), to thereby obtain said second list.

Claim 4

A method of claim 2, wherein the step (a) includes the step of: (a1) providing pointers to each first segment in said first list in order to indicate segments which are connected with said each first segment in said first list, and the step (f-1) includes the step of: modifying said pointers in accordance with said reconnection of said partial segments.

Claim 5

A method of claim 3, wherein first and second directions which are perpendicular to each other are defined on said image plane, and the step (b) includes the steps of: (b-1) providing said image plane with first sweep lines which are in parallel to said second direction and pass through said apices, respectively, wherein said first sweep lines are provided in order in said first direction; and (b-2) calculating positions of said crosspoints in respective sections between said first sweep lines in order to provide said image plane with second sweep lines which are in parallel to said second direction and pass through said crosspoints, respectively, said division and said reconnection being performed on each second sweep line in order.

Claim 6

A method of claim 4, wherein the step (b-2) includes the step of: (b-21) specifying a part of said first segments which are located in a region following one of said first sweep lines in said first direction when said one of said first sweep lines is provided at a first apex of said first graphics; (b-22) calculating a position of a crosspoint between said part of said first segments; (b-23) comparing said position of said crosspoint with a position of a second apex of said first graphics adjacent to said first apex in said first direction; (b-24) providing one of said second sweep lines at said second apex when said position of said second apex is between said first and second apices in said first direction; and (b-25) repeating the steps (b-21) through (b-24) at each of said first sweep lines.

Claim 7

A method of claim 5, wherein each of said first and second segments is provided with directionality, the step (c) includes the steps of: (c-1) providing each partial segment with a directionality in accordance with directionalities of said first segments from which said partial segments are obtained; and (c-2) providing each partial segment with a first data indicating a relative degree of overlapping of said first graphics on an area existing on a predetermined side of said each partial segment, said relative degree being determined for respective areas around each of said crosspoints under the condition where a predetermined reference degree is assigned to one of said respective areas, and the step (d) includes the steps of: (d-1) extracting first and second partial segments having a same value of said first data from said partial segments obtained at one of said crosspoints, in which said first partial segment has a start point thereof at said one of said crosspoints and said second partial segment has an end point thereof at said one of said crosspoint; (d-2) connecting said first partial segment with said second partial segment; (d-3) repeating the steps (d-1) and (d-2) until all of said partial segments are paired and connected with each other; and (d-4) repeating the steps (d-1) through (d-3) while serially selecting said one of said crosspoints within all of said crosspoints.

Claim 8

A method of claim 6, wherein the step (g) includes the step of: (g-1) providing each second segment with a second data indicating a degree of overlapping of said first graphics on an area existing on a predetermined side of said each second segment, whereby said third segments are provided with a same value of said second data; and (g-2) selecting a segment whose second data has a value corresponding to said designated degree of overlapping within said second segments, to thereby provide said one segment.

Claim 9

A method of claim 7, wherein the step (g-1) includes the steps of: classifying said second segments into groups according to respective values of said second data; selecting a segment from each of said groups to thereby obtain a set of selected segments; and finding a segment whose second data has said value corresponding to said designated degree of overlapping within said selected segments, to thereby obtain said one segment.

Claim 10

A method of claim 8, wherein the step (h) includes the step of: (h-1) searching said second list for said third segments each having a same value of said second data with said one segment.

Claim 11

A method of claim 1, wherein said first segments include a curve which is identified by a given parameter.

Claim 12

A method of claim 10, wherein the step (b) includes the step of: (b-1) generating an auxiliary polygonal line when a crosspoint between said curve and another one of said first segments is calculated, in which said auxiliary polygonal line has termination points at respective termination points of said curve and has a first apex at said crosspoint, the step (f) includes the step of: (f-1) registering respective straight parts of said auxiliary polygonal line in said second list in place of partial curves which are obtained by dividing said curve at said first apex, and the step (h) includes the step of; (h-1) extracting a first straight part of said auxiliary polygonal line which is connected with said one segment from said second list; and (h-2) replacing said first straight part by one of said partial curves which corresponds to said first straight part, said one of said partial curves defining a part of said object graphic.

Claim 13

A method of claim 11, wherein the step (a) includes the steps of: (a-1) detecting a turning point of said curve at which said curve turns in a predetermined direction; (a-2) generating an initial auxiliary polygonal line which has termination points at said respective termination points of said curve and has a second apex at said turning point; and (a-3) registering respective straight parts of said initial auxiliary polygonal line in said first list in place of said curve.

Claim 14

A method of claim 12, wherein the step (b-1) includes the step of: adding said first apex to said initial auxiliary polygonal line to thereby obtain said auxiliary polygonal line.

Claim 15

A method of claim 1, wherein the output means is a plotter.

Claim 16

A method of claim 1, wherein the output means is a CRT.

Claim 17

In a computer aided design system comprising a graphics data input means for inputting data representing figures of a circuit pattern of an integrated circuit, said figures having points in a coordinate system, a graphics processor for processing said input data and output means for displaying graphics obtained by said graphics processor, a method of recognizing an object graphic on which given first graphics overlap with each other at a designated degree of overlapping comprising the steps of: (a) making a first list of first segments defining given first graphics which are overlapped with each other on an image plane and storing said first list in a memory of said graphics processor; (b) recognizing respective apices of said first graphics; (c) sorting said respective apices according to coordinates of said respective apices in a predetermined direction defined on said image plane, to define an order of said respective apices in said direction; (d) selecting a first apex from said respective apices according to said order; (e) specifying a part of said first segments which are located in a region following said first apex in said direction; (f) finding a crosspoint between said part of said first segments in said region through use of said first list; (g) dividing a part of said first segments which intercross at said crosspoint into partial segment; (h) reconnecting said partial segments with each other at said crosspoint while changing a connecting relation among said partial segments so that reconnected partial segments form a boundary between areas on which said first graphics overlap with each other at different degrees of overlapping, respectively; (i) storing said reconnected said partial segments in said memory; (j) repeating steps (d) through (i) while sequentially selecting said first apex according to said order, to thereby convert said first graphics to second graphics which define an area on said image plane for each degree of overlapping of said first graphics; (k) making a second list of second segments defining respective contours of said second graphics and storing said second list in said memory; (l) selecting one segment within third segments which are included in said second segments and defining an area on which said first graphics overlap with each other at said designated degree of overlapping; (m) accessing said memory and extracting said third segments from said second list by tracing said third segments in said second list from said one segment, to recognize said object graphic defined by said third segments; and (n) transmitting said recognized object graphic to said output means.

Claim 18

In a computer aided design system comprising a graphics data input means for inputting data representing figures of a circuit pattern of an integrated circuit, said figures having points in a coordinate system, a graphics processor for processing said input data and output means for displaying graphics obtained by said graphics processor, a method of recognizing an object graphic on which given first graphics overlap with each other at a designated degree of overlapping comprising the steps of: (a) making a first list of first segments defining given first graphics which are overlapped with each other on an image plane and storing said first list in a memory of said graphics processor; (b) recognizing respective apices of said first graphics; (c) sorting said respective apices according to coordinates of said respective apices in a predetermined direction defined on said image plane, to define an order of said respective apices in said direction; (d) selecting a first apex from said respective apices according to said order; (e) specifying a part of said first segments which are located in a region following said first apex in said direction; (f) finding a crosspoint between said part of said first segments in said region through use of said first list; (g) dividing a part of said first segments which intercross at said crosspoint into partial segment; (h) reconnecting said partial segments with each other at said crosspoint while changing a connecting relation among said partial segments so that reconnected partial segments form a boundary between areas on which said first graphics overlap with each other at different degrees of overlapping, respectively; (i) storing said reconnected said partial segments in said memory; (j) repeating steps (d) through (i) while sequentially selecting said first apex according to said order, to thereby convert said first graphics to second graphics which define an area on said image plane for each degree of overlapping of said first graphics; (k) making a second list of second segments defining respective contours of said second graphics and storing said second list in said memory; (l) selecting one segment within third segments which are included in said second segments and defining an area on which said first graphics overlap with each other at said designated degree of overlapping; (m) accessing said memory and extracting said third segments from said second list by tracing said third segments in said second list from said one segment, to recognize said object graphic defined by said third segments; and (n) transmitting said recognized object graphic to said output means.

Claim 19

A method of claim 16, wherein a limit of said region is defined by a sweep line which is perpendicular to said direction and passes through said first apex.

Claim 20

A method of claim 17, further comprising the steps of: selecting a second apex next to said first apex in said order from said respective apices; comparing respective positions of said crosspoint and said second apex with each other in said direction; updating said region such that said region follows said crosspoint in said direction when said crosspoint is located between said first and second apices; and repeating the steps (e) through (i) for said region which is updated, and then returning to the step (d) in order to update said first apex.

Claim 21

A method of claim 16, wherein the output means is a plotter.

Claim 22

A method of claim 16, wherein the output means is a CRT.