JP3262970B2 - Arrangement method of member shape - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method for optimizing a so-called board-cutting process for cutting a component having a predetermined shape from a sheet material having an arbitrary shape. If the shape of the window is a window shape, cut out other parts from the window shape,
That is, the present invention relates to an arrangement method for efficiently arranging a component shape with respect to a window shape.

[0002]

2. Description of the Related Art In order to efficiently remove a part of an arbitrary shape from a plate using a laser beam machine or the like, usually,
The arrangement positions of the plurality of members are determined on the display screen using the computer. Generally, since the number of parts to be arranged is plural, when deciding the arrangement of these parts,
The shape data of each part (if CAD data already exists, can be imported from this CAD data) is sorted in descending order, and the shape data of the part is placed on this plate according to a predetermined rule. Place them. However, according to this method, if the component has a cutout window, the component is not arranged with respect to the cutout window. There is a disadvantage that it becomes larger.

In Japanese Patent Application Laid-Open No. 3-287307, if a component has a window 10 as shown in FIG. 16, the shape data of the window 10 is also set for this component, and the component is placed on a plate. There has been proposed a method of sequentially comparing the shape data of the window and other component data after the arrangement and arranging components as much as possible in the window. According to this method, the window 10 is defined as a shape from which a component can be extracted (hereinafter, referred to as a window shape), and an external shape (hereinafter, referred to as a component shape) of a component that can be arranged with respect to the window shape is extracted and arranged. Therefore, there is an advantage that the remaining material is further reduced and the utilization rate of the material is increased as compared with the conventional method.

[0004]

However, in the method of arranging the component shape with respect to the window shape as disclosed in JP-A-3-287307, the component shape is first arranged on a plate material, and then the component shape is arranged. If the component shape has a window shape, the window shape and the shape of the remaining material (however, the remaining material shape divided into rectangles) are ranked. Since the component shapes of the next order are arranged, the priority order of the window shape and the component shape changes at each time. For this reason, compared with the method of not arranging the component shape with respect to the window shape, it is excellent in that the final amount of residual material is reduced,
When there are a large number of components having window shapes, the dimensions of the empty regions (regions where the component shapes are arranged) are not always arranged in ascending order in order to avoid comparing the sizes of the many window shapes. Not exclusively. Further, in the arrangement method disclosed in the publication, the empty area shape is divided into rectangular areas and prioritized. Therefore, when the component shape is a complicated shape, the component May not be placed properly.

[0005] As described above, in the above-mentioned conventional method, there is a point to be further improved with respect to the demand for minimizing the waste of the material.

An object of the present invention is to provide a method of arranging member shapes that can further reduce remaining material.

[0007]

SUMMARY OF THE INVENTION According to the present invention, there is provided a system comprising:
It corresponds to the outer shape of the part to be placed in the window shape provided for the product.
Parts are sequentially arranged by computer calculation.
When sorting window shape data, sort
Sorting the shape data in descending order, and the window shape
Loop processing for processing target data in sort order
In which the component shape data is processed in the sort order
Is arranged, and in the second loop processing,
The part to be processed in the window shape to be processed
Judgment as to whether geometric calculation and placement processing of the product shape is possible
Steps and, if possible, steps to perform computational placement
In the method for arranging a member shape comprising:
The shape of the part to be processed
In the step of the above-mentioned operation arrangement processing to execute operation arrangement
Window element for each shape linear element
And one end point of the part-shaped element
All combinations that place the elements together
For the element within the window shape being processed
Component shape arrangement where the height of the component shape to be the bottom is the lowest
Is selected . Also,
When the component shape is calculated and arranged in the window shape,
Determining whether the elements intersect;
If it is determined that some of the elements intersect,
Is considered to be in a negotiation state, and the layout of the component shapes at that time
And a step of not selecting a state . Also,
In the above method of arranging the member shapes,
If there is a window shape that cannot place all the component shapes,
Shape and one element of the part shape
Performs the center matching process to match the center positions to each other
After the step and the center matching process, the part shape is
Along the element of the shape in the direction of its one end, the part
Any element of the shape contacts any element of the window shape
Perform the shift operation to move to the position where
And a step of calculating and disposing. Also,
In the above-described method of arranging the member shapes, the center matching process may be performed.
The elements of each shape intersect after processing
The step of determining whether or not any of the elements intersect
Is considered to be in the state of interference when
Not selecting the placement state of the embedded shape of the
Interference only when all elements do not intersect
Performing the shift operation assuming that there is no
It was to so. Further, in the above-described method of arranging the member shapes,
Before the shift operation, the arrangement after the center matching process is performed.
In a direction parallel to the mutually joined elements in the state
Define the distance between each element and each end point between the window shape and the part shape.
Step for performing the shift operation.
The part distance is determined by the shortest distance as the travel distance.
A shift operation in the shape of a letter is performed.

In this method, when there are a plurality of window shapes and component shapes, the window shapes are sorted in ascending order of the window shapes and in descending order of the component shapes at the initial stage. Then, the sequential arrangement of the component shapes with respect to the window shape is sequentially performed in the sort order, that is, in ascending order for the window shape, and in descending order for the component shape. Performing the sequential arrangement in the sort order means that, when the sequential arrangement is performed for a certain window shape, the component shapes are sequentially applied to the window shape in order from the largest, and the shape that can be embedded therein. If there is, repeat to arrange in the window shape,
This method refers to a method in which the above-described processing is performed in the same manner for the next-ordered window shape when no component shape can be arranged.

[0009]

[0010]

Further, the part shape with respect to one window shape if possible arranged in a plurality of patterns, selects those heights of the arrangement pattern of the part shape is the lowest. Such a method enables an efficient arrangement for minimizing residual material when component shapes are sequentially stacked from below.

In addition, when the component shape is arranged in the window shape, it is determined whether or not each element of each shape intersects. When any of the elements intersects, it is regarded that an interference state exists. In this case, the arrangement state of the component shape at that time is not selected, so that there is no interference of the entire shape.
The advantage is that the condition can be easily tested.

[0013]

[0014]

[0015]

[0016]

[0017]

[0018]

[0019] Further , a method is provided for examining whether or not it is possible to arrange the component shape by another method when the component shape cannot be arranged in the window shape. That is, the center position of each element of the part shape is aligned with the window shape, and the part shape is maximized in the direction of one end point along the element of the window shape (by a distance at which the elements do not intersect). Try to shift and arrange. This method is effective when the interior angle of the window shape is often acute and the component shape is rectangular. For example, if the window shape is a triangle and the component shape is a rectangle or a square, it will never be able to be placed when the two contacts are joined together, but the component will be located approximately at the center of the bottom of the window- shaped triangle. It is possible to arrange a square or rectangle that is a shape.

[0020]

[0021]

[0022]

[0023]

[0024]

Further, when there is any component window shape can not be placed shapes to be sorted, simplified process to the window shape is one single element becomes longer, this simplified window shape area A determination is made as to whether the area is larger than any of the component shapes, and if the area is larger than any of the component shapes, a member shape arrangement process according to claim 2 is performed. In this way, even if there is a part shape that cannot be arranged due to slight irregularities, the irregularities are removed by the simplification processing, and the parts can be arranged.

[0026]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS FIG. 1 shows a method of arranging components 2 on a plate 1 by an arrangement method of member shapes according to the present invention. As shown in the figure, the components 2 are sequentially arranged upward from below the plate 1. In addition, since some of the components 2 have the windows 3, a test is performed to determine whether each component 2 can be placed on the windows 3.
The arrangable components 2 are arranged in the window 3. Plate 1
Before sequentially arranging the parts 2, the shape of the window 3 provided in each part 2 to be arranged and the part shape of each part 2 to be arranged (that is, the outer shape of the part 2) are shown in FIG. Sorted by method. That is, window shapes are sorted in ascending order, and component shapes are sorted in ascending order. The result is registered in an appropriate area in the memory as shown in FIG. The registered shape is the shape data of each shape. Here, the shape data is CAD data. The CAD data is usually stored as a collection of data of each element such as a straight line, an arc, and a circle. By setting the shape data as CAD data, which is a collection of the element data, as will be described later, it is convenient to optimize the arrangement position of the component shape.

FIGS. 4 to 8 are flow charts showing the operation of the computer for executing the arrangement method according to the present invention.

As described above, first, the window shape and the component shape are defined, and these are sorted in steps ST1 and ST2. That is, the window shapes are sorted in ascending order, and the component shapes are sorted in ascending order. The total number of window shapes is set by N, and the total number of component shapes is set by M. Next, ST3
Defines a loop of (a process for) the window shape, defines a loop of the component shape in ST4, and performs the arrangement process (1) on the window in ST5 and the window shape update process in ST6 sequentially in these loops. In the window shape loop, the loop counter i loops from 1 to N, and in the component shape loop, the loop counter j loops from 1 to M. Therefore, at first, start from i = 1, j = 1, and then j = 2, j = 3,. . . . The process proceeds to j = M, and then i = 2, and the process is repeated from j = 1 to j = M.

FIG. 5 shows the operation of the arrangement processing (1) to the window in the above ST5.

Each shape data of the window shape and the component shape is
It is composed of element data such as straight lines, arcs, circles, etc., that is, data including end point coordinate data and attribute data such as straight lines. Is arranged. First S
In T20 and ST21, the window-shaped contacts (end points in contact with adjacent elements) and the component-shaped contacts are set as arrays of sizes P and Q, respectively. Then, ST22
Defines a window-shaped contact loop and ST23 defines a part-shaped contact loop. Then, in ST24, vector matching processing of the window shape and the component shape is performed. FIG.
FIG. 9 is a diagram showing the operation of the direction vector matching processing of the window shape and the component shape. Now, as shown in FIG. 9 (A), the contact point as1 of the window-shaped elements a1 and a2 is matched with the contact point bs1 of the component-shaped elements b1 and b2, and the two vectors are made identical to each other. Let us consider a case where they are arranged as shown in FIG. In this case, the part shape is rotated counterclockwise around the origin of the figure so that a1 and b1 are parallel to each other, as shown in FIG.

Next, as shown in FIG. 9 (C), the window-shaped contact as1 and the component-shaped contact bs1 are made to coincide. FIG. 9D shows the state at this time.

When the window shape and component shape direction vector matching processing is performed in ST24 of FIG. 5, the process proceeds to the interference check processing in the next ST25. This interference check process is a process for checking whether a window-shaped element and a component-shaped element intersect. As shown in FIG. 10, when the window-shaped element a and the component-shaped element b intersect (FIG. 10A), it is determined that "interfering", and when they do not intersect. Is determined as "not interfering" (FIG. 6B). Also, as shown in FIG. 4C, when the elements a and b are on the same line, they do not intersect,
It is determined that “there is no interference”. The above-described interference check processing is performed on all elements of the window shape and the part shape specified in ST22 and ST23 at that time.
FIG. 6 shows an operation for performing an interference check process on all the elements.

First, in steps ST40 and ST41, the element of the window shape i and the element of the component shape j are sized R and R, respectively.
Set as an array of S. Next, a loop of each element is defined in ST42 and ST43. If there is no interference between the elements, a flag indicating no interference is set in ST47, and if there is interference between any of the elements, a flag indicating interference is set in ST48.

After performing the above interference check processing, FIG.
The process returns to ST26 to determine the presence or absence of interference flag. When the interference flag is set, a loop return is performed, the counter j is incremented by one, and a vector matching process (ST24) and an interference check process (ST25) are performed for the contact point of the next component shape. If the flag of no interference is set in ST26, in ST27, the tangent angle θ, which is the inner angle of the component shape at the contact point in the vector matching state, is obtained, and this tangent angle θ is updated and registered in the memory up to the last time. Is compared with the minimum tangent angle θmin. If the tangent angle θ <the minimum tangent angle θmin, the minimum tangent angle θmin (i, j) is updated in ST28. That is, if the current tangent angle θ is smaller than the minimum tangent angle θmin, the minimum tangent angle θmin is replaced with the current tangent angle θmin. Note that (i, j) indicates the window shape and component shape numbers to which θmin was applied.

After performing the above processing, the process proceeds to ST31,
The component shape is arranged in the arrangement state of the minimum tangent angle θmin (i, j). By doing so, the component shape can be arranged in the window shape so as to have the lowest height, the remaining components of the window shape can be left wider, and the components can be arranged in that portion. It is easy to do.
In the arrangement processing (1) on the window, the area of the window shape is compared with the area of the component shape, and the arrangement processing (1) can be performed only when the former is larger than the latter.
In this case, when the window shape area is smaller than the component shape area, the layout cannot be absolutely performed. Therefore, the layout process (1) for the window in such a case can be omitted, and the processing can be speeded up.

In FIG. 4, when the arrangement processing (1) for the window is completed in ST5, the process proceeds to ST6 to update the window shape. FIG. 11 is a diagram for explaining a method of updating the window shape. As shown in the figure, the window shape before updating is now A1
When the component shapes are arranged as shown in FIG. 11 (B) with the triangle shapes of A1 to A3 and the component shapes being rectangular shapes of B1 to B4, the updated window shape becomes as shown in FIG. become. As described above, in the window shape updating process, when the component shape is arranged, the entire remaining shape is set as the updated window shape. When the window shape is updated, an embedding loop of ST4 and subsequent steps is executed on the updated window shape.
That is, the hole placement processing (1) in ST5 is performed on the updated window shape. Therefore, a plurality of component shapes can be sequentially arranged for one window shape.

When it is no longer possible to arrange the component shape with respect to the window shape, the process proceeds to ST8, and it is determined whether or not the component shape j can be arranged in the window (1) with respect to the window shape i. I do. If one or more arrangements have been made, the process returns from ST9 to ST3, increments i, and performs processing for the next window shape. In ST8,
When the arrangement by the arrangement processing (1) to the window cannot be performed, a loop of the part shape is defined in ST10, and ST11 is executed.
Performs the operation of the arrangement processing (2) on the window. In this arrangement process (2), one element of the window shape and the component shape is overlapped with their center positions aligned with each other, and from that state, the window is moved to one end point, that is, the contact side, along the element whose component shape is matched. The arrangement process is performed by performing a shift operation until the shape comes into contact with the shape. FIG. 7 is a flowchart showing the operation of the window arrangement processing (2).

First, in ST50 and ST51, an arrangement of elements of the window shape and the component shape is set. Assuming that the number of elements in the window shape is T and the number of elements in the component shape is U, a window-shaped element loop is defined in ST52, and a component-shaped element loop is defined in ST53 in the loop. Then, in step ST54, a center matching process of the elements is performed. FIG. 12 shows the content of the center matching process of this element. That is, as shown in FIG. 12A, the component-shaped element b1 is rotated counterclockwise around the origin of the figure until the component-shaped element b1 is parallel to the window-shaped element a1. Next, as shown in FIG. 2B, the coordinates of the center Oa of the element a1 and the center Ob of the element b1 are obtained.
Match the coordinates of. After performing such a process in ST54, the process proceeds to an interference check process in ST55. This interference check process is shown in FIG. As a result of the interference check process, if there is interference as shown in FIG. 13B, the process returns to ST29 to perform a loop return, and performs the center matching process for the next element of the component shape (ST54). If there is no interference as shown in FIG. 13 (A), in ST57, in a direction parallel to the mutually joined elements,
For example, a distance L between the component shape and the window shape is calculated for each element of the window shape located on the left side from the component shape. As shown in FIG. 13A, linear elements a1, a2, a3 are shown as window-shaped elements, and their contacts as1, a
s2 is shown. Also, regarding the part shape, b1
A polygon consisting of linear elements of .about.b6 is shown, and their contact points bs1, bs2, bs3, bs4, bs5, and bs6 are shown. In this state, the distance from each of the window-shaped contacts as1 and as2 located on the contact s1 side to the linear elements b2 and b3 of the component and the respective contacts bs1, bs2. All distances L ₁ , L ₂ ,.
· L _n is a value calculated by the ST57.

[0039] For example, between endpoints i.e. contacts bs1 contact as1 and linear element b2 corresponds to the distance L _1. Also,
To linear element from contact bs2 a2, length obtained by subtracting the straight line parallel to the line elements a1 corresponds to the distance L _2. In this manner, each of the contact points bs1 to bs of the component shape with respect to the linear elements a2 and a3 on the window-shaped contact point as1 side.
Linear element b on the left of each of the distance from 6 and the part shape
All the distances from the window-shaped contacts as1 and as2 with respect to 2 to b3 are obtained. In ST58, the shortest one of these distances Lmin is selected. As a result, the amount of parallel movement of the component shape within the window shape toward the contact as1 is determined. In the example shown in FIG. 13 (B), for the element b2, when the center matching processing is performed for the element b1 and the element a1, there is interference between the elements in the interference check processing ST55. The process returns to the loop, and the processing from ST54 onward for the next linear element b3 is performed. When the shortest distance Lmin is acquired in ST58, in ST61, the component shape is shifted leftward (a predetermined reference direction) using the shortest distance Lmin as a movement amount, and the arrangement is completed. FIG. 14 shows that the part shape is the shortest distance Lm.
The state when shifting by in is shown.

In FIG. 4, after finishing the above-described arrangement processing (2) on the window in ST11, the window shape is updated in ST12. This updating process is the same as the updating process performed in ST6. When all the component shape loops defined in ST10 have been completed, it is determined in ST14 whether or not the component shapes have been arranged by the arrangement process (2) on the window. If so, the process returns to ST9, i is incremented, and the loop processing from ST4 onward for the next window shape is performed. If the arrangement by the arrangement processing (2) on the window has not been completed, ST62
Proceed to. In this case, it means that neither the placement process (1) to the window nor the placement process (2) to the window could be performed.
At 62, a window shape simplification process is performed. This simplification process
As shown in FIG. 15, when small irregularities or the like are present in the shape data, it refers to a process of simplifying the irregularities into simple elements such as straight lines or circular arcs. That is, the window shape is simplified to a shape in which the number of elements is reduced so that the length of each element is increased. Note that ST1 and S1 in FIG.
When the window shape and the component shape are sorted in T2, the shape is slightly simplified, but the degree of simplification in ST62 is further increased. Subsequently, in ST63, as a result of the simplification, it is determined whether or not the area of the window shape is larger than the area of any of the component shapes. if,
If the area of the window shape is larger than the area of any of the component shapes, the loop of ST4 is tried again. This simplification process makes it possible to easily place components in the same window even when components cannot be placed in the window placement processes (1) and (2). If the area of the window shape is not larger than the area of any of the component shapes, embedding is impossible, so the process returns to ST64 before simplifying the window shape and returns to the original shape. In this case, since it is impossible to arrange the component shape with respect to the currently specified window shape, the process proceeds to the next window shape.

With the above operation, it is tested whether or not each of a large number of component shapes can be arranged for all window shapes, and the components are sequentially arranged from those which can be arranged. In this way, the components are efficiently arranged in the window, and the remaining material portion Z is extremely reduced as compared with the related art. Then, only the remaining components excluding the components embedded in the window need to be placed on one plate material 1 on which the members are to be placed, and the members can be placed in a very short time.

[0042]

According to the present invention, when the component shapes are sequentially arranged in the window shape, the window shapes are sorted in ascending order, the component shapes are sorted in ascending order, and then the arrangement is sorted. Since the arrangement is performed in order, it is possible to most efficiently arrange the component shapes with respect to the window shapes. In addition, at the time of the arrangement, the arrangement in which the height of the component shape is the lowest is selected, for example, as the one in which the tangent angle of the component shape is minimized.
More part shapes can be arranged for one window shape, and the remaining material can be extremely reduced.
The arrangement can be easily selected.

In the placement test of the component shape on the window shape, it is determined whether or not the component shape is correctly arranged based on whether or not each element of each shape intersects. Easy.

Further, when the component shape is arranged in the window shape, the window shape obtained by removing the component shape is updated as a new window shape without omitting the shape. Further, since a test is performed to determine whether or not the component shapes can be arranged, more component shapes can be arranged as compared with the related art.

In the above method, when not all the component shapes can be arranged in one window shape, the center of each element of the component shape is aligned with the window shape, and the component shape is further adjusted. Since the elements are shifted so that they do not interfere with each other in the direction of one end point of the element, even if the window shape or the component shape has a special shape, the component shape arrangement Becomes possible.
Also, after the center alignment, interference check of each element is performed, and if there is interference, the arrangement state of the component shape at that time is not selected without performing the shift operation, and the component shape at the time of no interference is selected. Since the shift operation is performed only in the arrangement state, the processing time can be shortened.

Also, when the layout is performed in the sorted order, if the area of the window shape is smaller than the area of the component shape, the layout of the component shape cannot of course be performed. Since the placement test is immediately performed for the next-ordered component shape without performing the placement test, the processing can be speeded up without unnecessary work.

When there is a window shape in which all the sorted component shapes cannot be arranged, the window shape is simplified so that each element becomes longer, and the simplified window shape area is reduced. If the part shape is larger than any of the part shapes, the placement processing is re-tested for that part shape. The irregularities are removed by the simplification processing, and the arrangement becomes possible.

[Brief description of the drawings]

FIG. 1 is a view showing a method of arranging components 2 on a plate 1 by an arrangement method of member shapes according to the present invention.

FIG. 2 is a diagram illustrating a method of sorting a window shape and a component shape by a member shape arrangement method according to the present invention.

FIG. 3 is a diagram showing the result of the sorting arranged on a memory.

FIG. 4

FIG. 8 is a flowchart illustrating an operation of a computer that implements the method for arranging member shapes according to the present invention.

9A to 9D are views showing the contents of window shape and component shape direction vector matching processing.

FIGS. 10A to 10C are diagrams showing contents of interference check processing.

FIGS. 11A to 11C are diagrams illustrating the operation of a window shape update process.

FIGS. 12A and 12B are diagrams illustrating an operation of a center matching process of elements (A) and (B).

13A and 13B are diagrams showing the contents of a distance L calculation process in a window arrangement process (2).

FIG. 14 is a diagram for explaining an operation when the component shape is moved by the shortest distance Lmin.

FIG. 15 is a diagram showing an example of simplifying a window shape.

FIG. 16 is a diagram showing an example of a component having a window.

──────────────────────────────────────────────────続 き Continued on the front page (58) Fields investigated (Int. Cl. ⁷ , DB name) G06F 17/50 B23D 36/00 501 B26D 5/00 JICST file (JOIS)

Claims (5)

(57) [Claims] 1. Arranged in the shape of a window provided on a part to be arranged
The part shape corresponding to the outer shape of the part to be
When arranging sequentially by calculation, reduce the window shape data
And sort the component shape data in ascending order.
The window shape data in sorted order
Source shape data in the first loop
The second loop processing to be processed is arranged in
Window shape to be processed in loop process 2
Geometric operation placement processing of the part shape to be processed
Steps to determine if processing is possible and, if possible, calculations
Performing a placement process;
In the law, the part to be processed in the window shape to be processed
Steps of the above-described arithmetic arrangement processing for geometrically arithmetically arranging product shapes.
Window, for each shape linear element
One end point of the shape element and one end point of the part shape element
All elements that are placed together
For the combination, within the window shape being processed
Part where the height of the component shape with the element as the base is the lowest
A method of arranging member shapes, comprising a step of selecting an article shape arrangement . 2. A part shape according to claim 1, wherein the part shape is represented by a window shape.
Each element of each shape intersects when arranged
Determining whether or not any of the elements
If it is determined that the
To select the layout state of the part shape at that time.
And a method of arranging the member shapes. 3. The method for arranging member shapes according to claim 2, wherein
And all the sorted parts shapes cannot be placed
When there is a window shape, one of the requirements for the window shape and the part shape
The elements together and their centers
Performing the center matching process and the center matching
After processing, the part shape is moved along the window-shaped element.
In the direction of one end point, any element of the part shape is
Shift to move to a position that touches any element of the shape
And performing a step of calculating and arranging the part shape by performing
A method for arranging member shapes. 4. The method for arranging member shapes according to claim 3, wherein
After performing the center matching process,
Determining whether the elements intersect;
If any of the elements intersect, the
And select the placement state of the embedded shape at that time.
Steps not selected and all elements do not intersect
The shift operation is performed only when
And a step of performing the following . 5. The method for arranging member shapes according to claim 4, wherein
Before the shift operation, the arrangement after the center matching processing is performed.
In the direction parallel to the mated elements
The distance between each element and each end point between the window shape and the part shape.
A step of performing the shift operation.
The distance between the part and the shortest distance
A method of arranging member shapes that performs a shape shifting operation .