JPH03172972A - Loop pattern verification system - Google Patents

Abstract

PURPOSE:To grasp and verify the shape of loop patterns by tracing patterns divided at branch points from a start point to an end point and deciding an invalid loop pattern in accordance with the existence of a pattern connected to the branch point. CONSTITUTION:A graphic pattern is divided at all branch points (a) to (d) and the divided patterns 1 to 5 are stored in tables (a) to (c). Two optional branch points, e.g. (a), (d) are set up as the start point (a) and end point (d) of a loop pattern, routes from the start point (a) to the end point (d) are traced, flags indicating traced patterns out of the patterns 1, 3, 2, 4 arrived at the end point (d) can be stored in the tables twice, and when an untraced pattern 5 connected to the traced routes is not left in the tables, a valid loop pattern is decided. Thus, the shape of all the loop patterns 1 to 5 can be grasped and verified.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a method for verifying a loop pattern in a graphic pattern on a printed circuit board.

[Conventional technology]

As described in Japanese Patent Publication No. 63-62020, a method for detecting loop patterns in graphic patterns is to focus on an arbitrary branch point and store branch points connected to the branch point one after another in a table. There is a loop pattern detection method that is characterized in that if a branch point to be stored is already stored in a table, it is determined to be a loop pattern and processing is stopped.

[Problem to be solved by the invention]

The above-mentioned conventional technology only verifies the presence or absence of a loop pattern, but does not take into consideration the shape of the loop pattern, and has a problem in that the shape of the loop pattern is not grasped.

The present invention grasps the shape of the loop pattern and
The purpose is to verify patterns.

[Means to solve the problem]

In order to achieve the above purpose, one graphic pattern is divided at all branch points, the divided patterns are stored in tables, and this table is used from the starting point to the ending point.

The connected pattern is traced, and a traced flag is stored in the table along with the pattern for the route pattern that has arrived at the end point. Further, the branch points passed during this tracing are stored in another table, and this tracing, storage of the traced flag, and storage of the branch point are repeated twice.

If tracing is not possible twice, it is determined that the loop pattern is invalid. If the trace can be traced twice, a third trace is performed, and if the same trace can be traced three times, it is determined that the loop pattern is invalid.

If tracing is performed only twice, if there is no traced flag in the table that stores the divided pattern, and if the endpoint of the pattern is a branch point passed during tracing, it is an invalid loop pattern. It is determined that This makes it possible to point out illegal loop patterns by displaying data.

[Effect]

The processing method of the present invention stores patterns divided at branch points in a table, traces them from the start point to the end point, and
A traced flag is stored in the traced pattern, and if the pattern does not have a traced flag and there is a pattern connected to the traced branch point, an illegal loop
A loop where there are two routes from the start point to the end point, and there are no patterns other than those two routes, where the pattern is determined.
With the method of the present invention, there will be no corresponding pattern in the table, so there will be no malfunction.

〔Example〕

Embodiments of the present invention will be described below with reference to the drawings.

FIG. 1 shows a loop pattern with no excess or deficiency. The start and end points of the loop are 9 and d. First, this pattern is stored in a table as shown in Fig. 2(a) in pattern units divided at branch points, and then traced from the starting point a to the ending point, and for the pattern used for tracing, To indicate that the trace has been completed, 1 is stored in the pattern sequence. Also, the branch points used for tracing are stored in a table. At this time, pattern 1 and pattern 3 are stored as traced and 1 is stored, and b is stored in the table as a passed branch point. (b), and then trace again from the starting point a to the ending point d, storing 1 in pattern 2.4 as traced, and storing C in the table as the branch point passed through, as shown in Figure 2 (Q) The untraced pattern is pattern 5, and its end points d and e are not the branch points I and c that have passed once, so this pattern is determined to be a valid loop pattern.

FIG. 3 shows a loop pattern with an excess of patterns. The starting point is a and the ending point is d.

First, as shown in Fig. 4(a), the pattern is stored in the table. When the first trace is performed, the traced flag is stored in pattern 1.4 as shown in Fig. 4(b). b is stored in the table as a branch point passed through once. In the second tracing, traced flags are stored in patterns 2 and 5, and C is stored in the table as a branch point that has been passed once, as shown in FIG. 4(c). Furthermore, since the third trace can be made from pattern 3, this pattern is determined to be an invalid loop pattern.

FIG. 5 is an example of a loop pattern when there is a shortage of patterns. The starting point is a and the ending point is f.

First, patterns are stored in a table as shown in FIG. 6(a). Results of the first trace.

As shown in Fig. 6(b), for patterns 1, 3, 4, 5°7, 1 is stored in the table as traced, and branch points a, d, and e are stored in the table as 9 passing points. be done. When tracing is performed for the second time, it passes through pattern 3 and reaches branch point C, and since no further tracing is possible, it is determined that the loop pattern is invalid.

〔Effect of the invention〕

According to the present invention, since loop patterns can be verified for all loop patterns, it is possible to verify whether the wiring pattern on the printed circuit board meets the specifications.

[Brief explanation of the drawing]

FIG. 1 is a diagram showing a valid loop pattern, FIG. 2 is a diagram explaining a table according to the present invention for the loop pattern in FIG. 1, and FIG. 3 is a diagram showing a loop pattern with excessive patterns. 4 is a diagram illustrating the table, FIG. 5 is a diagram illustrating loop patterns with insufficient patterns, and FIG. 6 is a diagram illustrating the table. Figure 2, Figure 3, Figure 5, Figure 6

Claims (1)

[Claims] 1. In the process of wiring a graphic pattern on a printed circuit board, divide the graphic pattern at all branch points, store the divided patterns in a table, and set any two branch points as the starting point of the loop pattern. and the end point, trace from the start point to the end point, and store the traced flag twice in the table for the pattern of the route that arrived at the end point, and connect to the traced route in the table. A loop pattern verification method is characterized in that a loop pattern is determined to be a valid loop pattern when there are no untraced patterns remaining.