JPH05128210A - Writing pattern data generator - Google Patents

Abstract

PURPOSE:To shorten the generating time of wiring pattern data by searching the destination of a wiring while retrieving a root to be wired without preliminarily deciding the destination of the wiring. CONSTITUTION:The position data of a wiring starting pad are inputted from a starting pad inputting part 101, a path is retrieved by a searching path deciding part 102, whether or not an obstacle is present on the path is checked by an obstacle detecting part 104 by referring to a wiring pattern storage area 110, a search node in generated by a search node generating part 103 by using the path on which no obstacle is present thereon as the search path, and stored in a search node storage area 109. Then, the search node is erased from the search node storage area 109 by a search node erasing part 105 at the time of reaching the dead end, whether or not a connection with an idle grid in the preceding direction of the searching path can be attained is checked by an idle grid detecting part 106, a wiring path is decided by a wiring path deciding part 107 by referring to the retrieval node storage area 109, and the pattern is registered in the wiring pattern storage area 110 by a wiring pattern registering part 108.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a wiring pattern data generator, and more particularly to wiring pattern data from a pad not on a grid to an arbitrary grid while avoiding the presence of obstacles such as existing wiring on a printed circuit board. The present invention relates to a wiring pattern data generator that generates a signal.

[0002]

2. Description of the Related Art A conventional wiring pattern data generator is
There has been one that generates a possible wiring pattern between two points where the wiring destination is uniquely determined. However, the wiring destination is unknown and there are many candidates for the wiring destination, and a wiring destination that can be wired is searched for and the wiring is performed. Nothing produced a pattern.

The need for such an apparatus arises, for example, when conducting a continuity test of a printed circuit board. Since the contact pin positions of the continuity tester are arranged in a grid pattern at regular intervals in accordance with the grid of the printed circuit board, in order to inspect a pad that deviates from the grid position on the inspection target board, this pad position A special substrate is required to bridge the electrical path between the contact pin position and the contact pin position, and a wiring pattern for bridging is generated on this special substrate to conduct the continuity test. Conventionally, the generation of this wiring pattern has been manually performed by repeating trial and error.

[0004]

The above-described conventional wiring pattern data generator generates wiring pattern data between two predetermined points, and when the wiring destination is unknown, all possible combinations are set. There is a drawback that it takes a lot of time to generate the wiring pattern because it is necessary to try the matching and search for a possible wiring pattern.

An object of the present invention is to find a wiring destination while searching for a route capable of wiring without predetermining a wiring destination. Therefore, the found wiring destination can be always wired, and the generation time of the wiring pattern data can be shortened. It is to provide a pattern data generator.

[0006]

SUMMARY OF THE INVENTION A wiring pattern data generator of the present invention is a wiring pattern storage means for storing existing wiring pattern data of a printed circuit board, and a start pad input for inputting position information of a pad on the printed circuit board. Means, a search route determining means for generating a pattern of the next search route from the tip of the pad position or the searched route, and a pattern of the search route generated by the search route determining means intersects with another wiring pattern. An obstacle detection means for inspecting whether or not the wiring pattern storage means is checked,
Search node generating means for generating a node holding information of the search route when the pattern generated by the search route determining means is judged to be valid by the obstacle detecting means, and search for storing the generated node Node storage means, search node erasing means for returning to a branch point of a searchable node and erasing a previous node from the branch point when the obstacle is encountered by the obstacle detection means and the search path is interrupted, and a tip of the search path An empty grid detecting means for detecting the existence of connectable empty grid points in a grid cell including
Wiring route determining means for determining a wiring route while tracing a search node in reverse when the available lattice detecting means detects a reachable lattice, and a wiring pattern for storing the data of the wiring route in the wiring pattern storage means. It is configured to include a registration means.

[0007]

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

FIG. 1 is a block diagram showing an embodiment of a wiring pattern data generator of the present invention.

As shown in FIG. 1, the wiring pattern data generator according to the present embodiment includes graphic information of an already-wiring pattern (type information of land or line, center coordinates in the case of land,
A wiring pattern storage area 110 holding the diameter, etc., starting point coordinates, ending point coordinates, etc. in the case of a line, and a starting pad input unit 10 for inputting position information of the starting pad of the wiring pattern.
1 and a route search unit 100 that searches for a route that can be wired to an empty grid or searches for a route until the search is deadlocked.
And a search node storage area 109 for storing a node which is information of a line segment searched by the route searching unit 100 as a candidate for a wiring route, and an end when the route searching unit 100 finds a route that can be wired to an empty grid. Tracing route in the reverse direction of the search from the search node to the start pad, and the wiring route determination unit 107 that picks up the coordinates of the tip of the search line segment stored in each search node and determines the sequence as the wiring route.
And the wiring pattern registration unit 108 that additionally registers the data of the determined wiring route in the wiring pattern storage area 110.
It consists of and.

The route search unit 100 includes a searched route determination unit 10
2, a search node generation unit 103, and an obstacle detection unit 104
, Search node erasing unit 105, and empty grid detecting unit 106
Includes and.

The search route determining unit 102 obtains end point coordinates of a line segment for moving from the tip of the searched route to the lattice cells in the traveling direction of the search and both lateral directions thereof. The start point coordinates of this line segment coincide with the end point coordinates of the line segment already obtained by the search route determination unit 102. In the initial stage, the starting point coordinates coincide with the position of the starting pad.

The obstacle detection unit 104 includes a search route determination unit 1
The line segment obtained in 02 is searched for an overlap from the graphic data forming the existing wiring pattern stored in the wiring pattern storage area 110. If such graphic data is found, it is determined that an obstacle is detected, and the line is detected. Minutes are determined to be invalid. If no overlapping graphic data is found, the line segment is determined to be valid.

When no obstacle is detected by the obstacle detection unit 104, the search node generation unit 103 reserves a node storing the information of the route line segment in the search node storage area 109 as a candidate for the wiring route.

The search node structure stores the coordinates of the end point of the search path, the pointer of the parent node, the pointer of one or more child nodes, the forward pointer and the backward pointer of the same generation node.

The search node erasing unit 105 releases from the search node storage area 109 the search node group holding the route information that has been traced so far when the obstacle detecting unit 104 detects an obstacle. At this time, the search node to be deleted is traced back to the branch of the tree structure.

The empty grid detection unit 106 detects whether the vertex on the traveling direction side of the grid cell including the end point of the current path line segment is an empty grid, and further detects from the end point of the path to the detected empty grid. Determine the possibility of wiring. The vacant grid can be detected by searching for a land of a certain diameter, which should be generated as a wiring target, in the figure data held in the wiring pattern storage area 110, and find out the success or failure. As for the reachability to the found empty grid, two types of L-shaped patterns are tried between the end point of the search line segment and the grid, and either one of them is used as the wiring pattern storage area 1.
If the figure held in 10 does not overlap, it is determined that the figure is reachable.

FIG. 2 is a flow chart showing the operation of the route search section 100.

FIG. 3 is a wiring diagram of a printed circuit board having obstacles 311, 312 and 313, which will be used for explaining the following specific examples. The grid lines are shown. The starting point of the search path 301 is the position of the starting pad.

FIG. 4 is an explanatory diagram of a data structure to be stored in the search node storage area 109 corresponding to the search of FIG.

The operation of the route search unit 100 will be described with reference to the flowchart of FIG. 2 by taking FIG. 3 as an example.

First, in the processing block 201, the search route determination unit 102 uses the position of the start pad given to the start pad input unit 101 as the starting point of the wiring to search the search route in the up, down, left and right directions, and the obstacle detection unit 104. By referring to the wiring pattern storage area 110, it can be determined whether or not a pattern can be generated. At this time, if the pattern cannot be generated in any of the upper, lower, left, and right directions, it is determined that the wiring cannot be performed from this start point, and the process ends (failure branch of the processing block 201). If there is at least one route that can be wired in four directions, it is determined as a search route, the search node generation unit 103 sends the search node to the search node storage area 109, and the process proceeds to the next process (processing block 2).
01 branch of success). In FIG. 3, only the search route 301 is valid because of the obstacle 311 and the search node 401 is stored in the search node storage area 109.

Next, in processing block 202, the free grid detection unit 106 stores a wiring pattern to determine whether or not there is a free grid that can be reached in the traveling direction side of the grid cell to which the end point of the search path held in the search node belongs. Area 11
Check with reference to 0. If there is a reachable empty grid, it is determined that the wiring route has been found, the process of the route searching unit 100 ends, and the process is transferred to the wiring route determining unit 107 (YES branch of the processing block 202). If no reachable free grid is found, the process moves to the processing block 203 (NO branch of the processing block 202). Since there is no reachable empty lattice on the advancing direction side of the lattice cell to which the end point of the search path 301 of FIG. 3 belongs, the process moves to the processing block 203.

In this processing block 203, the search route determining unit 102 searches for a new search route. Obstacle detection unit 1
If there is a search path that can be newly advanced by 04 (YES branch of processing block 203), the process moves to processing block 205 and the search node is generated. In FIG. 3, the search paths 302 and 303 are searched, the search nodes 402 and 403 are added to the search node storage area 109, and the process moves to the processing block 206.

In the processing block 206, it is checked whether or not there is a node of the next same generation, but in the example of FIG. 3, there is no node of the same generation as the search path 301, so it is moved to the processing block 207 to see if any nodes remain. Check if If no node remains (NO in processing block 207)
Although the branch) wiring route is not found and the processing ends there, the search nodes 401, 402, and 403 remain, and the processing moves to the processing block 208.

Here, the generation level of the search path is updated to the next level, and the processing moves to the processing block 202. Search route 30
Since the next-generation level search route 1 is 302 and 303, the search route 302 is started.

Since the search path 302 is NO in the processing block 202, the processing moves to the processing block 203, where the search paths 304 and 305 are generated, and the processing nodes 205 add the search nodes 404 and 405 to the search node storage area 109. .. Similarly, a search route 306 is generated for the search route 303 and a search node 406 is added.

Since the processing of the search paths 302 and 303 of the same generation is over, the process moves from the processing block 206 to the processing block 207 and then to the processing block 208 to proceed to the processing of the search paths 304, 305 and 306 of the next generation. ..

Since the search path 304 is NO in the processing block 202, the processing moves to the processing block 203. In this case, a new search path does not occur due to the obstacle 312 (NO branch of the processing block 203), and the processing moves to the processing block 204. ,
The search node deleting unit 105 deletes the search node stored in the search node storage area 109 until the node list that has reached that point is traced back to the branch node.
That is, the search node 404 of the search path 304 is deleted from the search node storage area 109, the child pointer of the search node 402 is changed from the search node 404 to 405, and the backward pointer of the search node 405 is changed from 404 to NULL. The branch node is judged to be a branch node if there is a node registered in the forward or backward pointer and if there is a node having the same parent node by referring to the parent pointer of the node.

Next, the processing block 206 proceeds to the processing of the search route 305 which is a search route of the same generation as the search route 304. Search route 305 is L on route L 310
Since the empty grid 309 capable of pattern wiring can be found, the empty grid detection unit 106 finds it in the processing block 202 (YES branch of the processing block 202), and the processing of the route search unit 100 ends.

As described above, in the wiring pattern data generator of this embodiment, by starting from a pad not on the grid of the printed board and searching for the target grid while carrying out a search capable of wiring without predetermining the target grid,
Wiring pattern data up to the target grid that can be wired in a short time can be generated.

[0031]

As described above, according to the wiring pattern data generator of the present invention, the target found by searching the wirable route can always be wired, so that the generation time of the wiring pattern can be shortened. There is an effect that you can.

[Brief description of drawings]

FIG. 1 is a block diagram showing an embodiment of a wiring pattern data generator of the present invention.

FIG. 2 is a flowchart showing the operation of the wiring pattern data generator of this embodiment.

FIG. 3 is a wiring diagram showing a wiring example of a printed circuit board for explaining the route search of the present embodiment.

FIG. 4 is an explanatory diagram showing a data structure of a search node.

[Explanation of symbols]

 100 Route Search Unit 101 Start Pad Input Unit 102 Search Route Determination Unit 103 Search Node Generation Unit 104 Obstacle Detection Unit 105 Search Node Erasure Unit 106 Free Lattice Detection Unit 107 Wiring Route Determination Unit 108 Wiring Pattern Registration Unit 109 Search Node Storage Area 110 Wiring pattern storage area 201-208 Processing block 301-306 Search path 309 Free grid 310 L pattern path 311-313 Obstacle 401-406 Search node

Claims (1)

[Claims] 1. A wiring pattern storage means for storing existing wiring pattern data of a printed circuit board, and a start pad input means for inputting position information of a pad on the printed circuit board,
A search route determining means for generating a pattern of the next search route from the pad position or the end of the searched route;
An obstacle detection unit that inspects whether or not the pattern of the search route generated by the search route determination unit intersects with another wiring pattern by referring to the wiring pattern storage unit, and a pattern generated by the search route determination unit. Search node generating means for generating a node holding information of the searched route when the obstacle detecting means determines that it is valid, search node storing means for storing the generated node, and obstacle detecting means When a search path is encountered due to an obstacle due to an obstacle, it is possible to connect to the search cell erasing means that goes back to the branch point of the searchable node and erases the previous node from the branch point, and the lattice cell including the tip of the search path. Free grid detecting means for detecting the existence of a free grid point, and a search node when a free grid reachable by the free grid detecting means is detected And determining not a Keru wiring routing means the routing by tracing the contrary, the wiring pattern data generating apparatus which comprises a wiring pattern registering means for storing the data of the wiring path on the wiring pattern storage means.