JP4146296B2 - Wire rod packing calculation method, apparatus and program thereof - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a calculation method, an apparatus thereof, and a program thereof for bundling and packing a plurality of wire rods as small as possible to obtain an outer diameter thereof.
[0002]
[Prior art]
A wire-like structure called a wire harness that is configured by bundling a plurality of wires such as electric wires and electrically connecting electronic devices, electronic components, and the like is arranged in a vehicle or indoor. In recent years, such wire harnesses are required to be as compact as possible without deteriorating electrical characteristics from the viewpoint of improving space efficiency. Along with this, it is necessary to calculate the outer diameter of the wire harness more accurately at the design stage, but conventionally, the calculation was only performed by experience and the calculation method shown below, An effective calculation method has not been proposed.
[0003]
Below, the problem by the calculation method of the outer diameter of the conventional wire harness is shown using FIG. FIG. 8A shows a wire harness composed of relatively few wires, and FIG. 8B shows a wire harness composed of relatively many wires.
[0004]
In the conventional calculation method, as shown in FIG._iWhen these are given, these wires a_iAnd these wire rods a_iThe wire harness 10 composed of_iThe diameter L of the wire harness 10 composed of
πL²/ 4 = KΣ (πl_i ²/ 4).
Where l_iIs wire a_iAnd K represents a clearance coefficient. The clearance coefficient K is difficult to obtain so as to be adapted to the number and arrangement of various wire rods. Therefore, the clearance coefficient K is always applied to all cases regardless of the number and arrangement of wire rods constituting the wire harness 10. A constant value is used.
[0005]
However, as shown in FIGS. 8 (a) and 8 (b), a wire rod a that is constituted by a wire harness having an equivalent diameter L as well._i, A '_iIt is clear that the areas of the gaps 11 and 11 'differ depending on the number and arrangement of the gaps. Nevertheless, when the diameter L is always obtained using the constant clearance coefficient K as described above, the value becomes inaccurate and is not practical.
[0006]
[Non-Patent Document 1]
A. Okabe, B. Boots, K.M. Sugihara and S. N. Choi (A. Okabe, B. Boots, K. Sugihara and SN Choi), "Spatial Tessellations-Concepts and Applications of Voronoi Diagrams 2 (Spatial Tessellations-Conceptsandsand Applications and Apps. John Wiley and Sons, John Wiley and Sons, Chichester, 2000
[Non-Patent Document 2]
D. S. Kim and K. "Dr. S. Kim and K. Sugihara", "Voronoi Diagram of A Circle Set, From Voronoi Diagram of A Point Set, I" (Volonoi diagram of acilia set, Volonoi diagram in 18) Topology Computer-Aided Geometric Design, 2001, pp. 541-562
[Non-Patent Document 3]
D. S. Kim and K. "Dr. S. Kim and K. Sugihara", "Voronoi Diagram of A Circle Set, From Voronoi Diagram of Appointment Set, II" (Volonoi diagram of acilia set, Volonoi diagram in 18) Geometry. Computer Aided Geometric Design (2001), pp. 10-49. 563-585
[0007]
[Problems to be solved by the invention]
As described above, there is no practical method for obtaining the outer diameter of a wire harness composed of an arbitrary number of wires, and it goes without saying that wires are bundled and packed in as small a circular shape as possible. There was no effective calculation method for obtaining the outer diameter of the harness.
[0008]
Therefore, in view of the present situation described above, the present invention provides an effective calculation method, apparatus, and program for obtaining an outer diameter by bundling and packing an arbitrary number of a plurality of wires in the smallest possible circular shape. It is an issue.
[0009]
[Means for Solving the Problems]
The wire packing calculation method according to claim 1, which has been made to solve the above-mentioned problem, uses a computer to bundle a plurality of wires in a circular shape as small as possible so as not to overlap each other, and obtains the outer diameter thereof. Comprising a plurality of circles arranged so as not to overlap each other on a plane, assuming that the cross-sectional shapes of the plurality of wire rods are a plurality of circles having a diameter corresponding to each outer shape. An inclusion circle assumption step that assumes an inclusion circle; and a target circle definition step that defines a target circle that has the same center as the inclusion circle and is slightly smaller than the inclusion circle, and at least one of the plurality of circles protrudes. A circle protruding from the target circle is an insertion trial circle, and the plurality of circles other than the insertion trial circle are moved as far as possible within the target circle without overlapping each other. A search step for searching for possible positions; and an insertion step for inserting the insertion trial circle into a space in the target circle that can be obtained by changing the arrangement of the plurality of circles based on a search result obtained by the search step; When all the insertion trial circles are inserted into the target circle, a new target circle that is slightly smaller than the current one and has the insertion trial circle is determined, and then the search step is performed. Including a first search control step that returns, and gradually reducing the inclusion circle by repeatedly executing the target circle definition step, the search step, the insertion step, and the first search control step. It is characterized by.
[0010]
According to the first aspect of the present invention, by using the computer to repeatedly execute the target circle definition step, the search step, the insertion step, and the first search control step, the inclusion circle of the plurality of wire rods is gradually reduced. I will do it. Thereby, the outer diameter of the circle surrounding the plurality of wires is efficiently acquired.
[0011]
The wire packing calculation method according to claim 2, which is made to solve the above problem, is the wire packing calculation method according to claim 1, wherein, in the search step, one of the insertion trial circle and the plurality of circles. A circle Voronoi diagram is created with the circle group excluding the target circle and the target circle, and whether the center of the one circle that touches both side circles forming each boundary side in the circle Voronoi diagram is on the boundary side. It is characterized by searching for a position where these circles can move within the target circle by checking whether or not the plurality of circles other than the insertion trial circle are not.
[0012]
According to the second aspect of the invention, by using the circle Voronoi diagram, the movement candidate position search for the insertion trial circle is greatly simplified.
[0013]
The wire packing calculation method according to claim 3, which was made to solve the above-described problem, is the wire packing calculation method according to claim 1 or 2, wherein the target circle definition step, the search step, the insertion step, and When it is repeatedly executed together with the first search control step and the insertion trial circle cannot be inserted, it is an intermediate size between the inclusion circle and the current target circle, and A second search control step of returning to the search step after determining another new target circle having an insertion trial circle is further included.
[0014]
According to the third aspect of the present invention, when the insertion trial circle cannot be inserted, the target circle having an intermediate size between the inclusion circle and the current target circle is determined, and then the search is performed. By further including the 2nd search control process returned to a process, the outer diameter of the circle | round | yen surrounding a some wire rod is acquired more efficiently.
[0015]
The wire packing calculation device according to claim 4, which has been made to solve the above problem, is a device for calculating the outer diameter by bundling a plurality of wires in a circular shape as small as possible so as not to overlap each other. Including an assumed inclusion circle including the plurality of circles arranged so as not to overlap each other on a plane, assuming that the cross-sectional shape of the plurality of wire rods is a plurality of circles having a diameter corresponding to each outer shape. A circle assumption means, a target circle definition means for defining a target circle having the same center as the inclusion circle and being slightly smaller than the inclusion circle and protruding from at least one of the plurality of circles; and protruding from the target circle A search for searching for a position where the plurality of circles other than the insertion trial circle can move as far as possible within the target circle without overlapping each other. An insertion means for inserting the insertion trial circle into a space in the target circle that can be obtained by changing the arrangement of the plurality of circles based on a search result by the search means; and all of the insertion trial circles Is inserted into the target circle, the first search is made to perform a search by the search means after defining a new target circle that is slightly smaller than the current and has the insertion trial circle It includes control means, input means for inputting initial information regarding the plurality of wires, and output means for outputting at least the outer diameter of the inclusion circle.
[0016]
According to the fourth aspect of the invention, the initial information regarding the plurality of wires is input by the input unit, and the target circle definition unit, the search unit, the insertion unit, and the first search control unit gradually enter the plurality of wires. The inclusion circle is made smaller, and the output means outputs the outer diameter of the inclusion circle. Thereby, the outer diameter of the circle surrounding the plurality of wires is efficiently acquired.
[0017]
The wire packing calculation device according to claim 5, which is made to solve the above-described problem, is the wire packing calculation device according to claim 4, wherein the output unit 5 includes position information of each of the inclusion circle and the plurality of circles. Is also output.
[0018]
According to the fifth aspect of the present invention, since the position information of each of the inclusion circle and the plurality of circles is also output, the outer diameter of the circle surrounding them including the arrangement of the plurality of wire rods is efficiently obtained. .
[0019]
The wire packing calculation device according to claim 6, which is made to solve the above problem, is the wire packing calculation device according to claim 4 or 5, wherein the search means includes the insertion trial circle and the plurality of circles. A circle Voronoi diagram is created with the circle group excluding one of the target circle and the target circle, and the center of the one circle that touches both side circles forming each boundary side in the circle Voronoi diagram is the boundary side. A second search means for searching for a position where these circles are movable within the target circle by examining the plurality of circles other than the insertion trial circle as to whether or not they are above; It is characterized by including.
[0020]
According to the sixth aspect of the present invention, by using the circle Voronoi diagram in the second search means, the movement candidate position search for the insertion trial circle is greatly simplified.
[0021]
The wire packing calculation device according to claim 7, which is made to solve the above problem, is the wire packing calculation device according to claim 4, claim 5, or claim 6, wherein the insertion trial circle is not inserted. If possible, determine another new target circle having an intermediate size between the inclusion circle and the current target circle and having the insertion trial circle. It further includes second search control means for performing search by means.
[0022]
According to the seventh aspect of the present invention, when it is impossible to insert the insertion trial circle by the second search control means, the target circle having an intermediate size between the inclusion circle and the current target circle Then, the outer diameter of the circle surrounding the plurality of wire rods can be acquired more efficiently by performing the search again by the search means.
[0023]
The wire packing calculation program according to claim 8, which has been made to solve the above-described problem, is arranged to pack a plurality of wires into a circle as small as possible so as not to overlap each other, and to calculate the outer diameter of the computer. An inclusion circle that assumes an inclusion circle that includes the plurality of circles arranged so as not to overlap each other on a plane, assuming that the cross-sectional shape of the plurality of wires is a plurality of circles having a diameter corresponding to each outer shape. Assuming means, a target circle defining means for defining a target circle that has the same center as the inclusion circle and is slightly smaller than the inclusion circle, and at least one of the plurality of circles protrudes, a circle protruding from the target circle And a position where the plurality of circles other than the insertion trial circle can move as far as possible within the target circle without overlapping each other. Search means, insertion means for inserting the insertion trial circle into a space in the target circle, which can be obtained by changing the arrangement of the plurality of circles based on a search result by the search means, and all of the insertion trial circles A first search control that, when inserted into the target circle, defines a new target circle that is slightly smaller than the current one and has the insertion trial circle, and then performs a search by the search means. And an input means for inputting initial information regarding the plurality of wire rods, and an output means for outputting at least the outer diameter of the inclusion circle. It should be noted that the gist of the inventions of claims 5 to 7 can be added to the invention of claim 8 as well.
[0024]
According to the invention described in claim 8, by causing the computer to function as the target circle definition means, the search means, the insertion means, the first search control means, the input means, and the output means, the inclusion circle of a plurality of wire rods gradually. Is made smaller and the outer diameter of the inclusion circle is output.
[0025]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, embodiments of the present invention will be described with reference to the drawings.
First, the hardware configuration for realizing the main wire packing calculation method will be described with reference to FIG. FIG. 1 is a block diagram showing an example of a hardware configuration for realizing the calculation method and apparatus of the present invention.
[0026]
As shown in FIG. 1, the hardware configuration is realized by a known personal computer or general-purpose computer. The computer includes an input device 1, an I / O (input / output interface circuit) 2, a CPU (Central Processing Unit) 3, a memory 4, an output device 5, and a read / write device 6. The input device 1, the memory 4, the output device 5, and the read / write device 6 are electrically connected to the CPU 3 via I / O 2 or the like.
[0027]
The input device 1 is, for example, a keyboard or a mouse device that is used to input input data in a process described later. The CPU 3 includes a control unit 31 for controlling the input device 1, the output device 5, and the like, and a calculation unit 32 that performs processing related to the calculation method described later according to a program stored in the memory 4.
[0028]
The memory 4 includes a program memory 41 for storing a program corresponding to each process related to the calculation method described later, and a calculation memory 42 to which work areas for various processes performed by the CPU 3 are allocated. The output device 5 is, for example, a monitor display or a printing device that outputs a result of processing performed by the CPU 3.
[0029]
The read / write device 6 is a wire packing calculation program 7a according to the present invention stored in a recording medium 7 such as a CDROM (for example, a program of processing procedures as shown in FIGS. 2, 4, 5, and 6 described later). Is a device for reading and transferring it to the program memory 41. The read / write device 6 also has a function of writing the calculation result in the recording medium 7. The computer may include a communication interface such as a modem board or a LAN card (not shown).
[0030]
The CPU 3 installs the wire material packing calculation program 7 a read by the read / write device 6 in the program memory 41 of the memory 4. Then, after the power is turned on, this program 7a is launched, and this computer functions as a wire rod packing calculation device. The wire packing calculation program 7a can be installed in another personal computer or general-purpose computer having the above-described configuration, and after installation, the computer functions as a wire packing calculation device.
[0031]
The wire rod packing calculation program 7a stored in the recording medium 7 corresponds to claim 8. The wire packing calculation program 7a may be provided to this computer not only via the recording medium 7 such as a CDROM, but also via a communication line such as the Internet, a dedicated line, or a LAN.
[0032]
Next, a processing procedure according to an embodiment of the calculation method of the present invention will be described with reference to FIGS. First, the basic processing procedure of this calculation method will be described with reference to FIG. FIG. 2 is a flowchart showing a basic processing procedure according to an embodiment of the calculation method of the present invention.
[0033]
In this calculation method, the cross-sectional shape of a plurality of wires constituting the wire harness is regarded as a plurality of circles having a diameter corresponding to each outer shape, and when the n cylinders having these circles in the cross section are bundled, This results in the problem of examining the size of the surrounding circle. Actually, an effective calculation method for acquiring the outer diameter by bundling a plurality of wire rods in as small a circular shape as possible by using the above-mentioned computer is considered.
[0034]
In the basic processing shown in FIG. 2, the input information includes n circles c corresponding to the outer shapes of the cross-sectional shapes of a plurality of wires such as electric wires constituting the wire harness.₁, C₂, ..., c_nRadius r₁, R₂... r_nA number p smaller than 1 and sufficiently close to 1, for example, p = 0.95, and an end reference value ε that is a sufficiently small positive number, for example, the end reference value ε = min ((r₁, R₂... r_n) / 100).
[0035]
The output information includes n circles c₁, C₂, ..., c_nCan be packed so as not to overlap each other, and the radius R of the smallest possible circle, and the circle C and circle c at this time₁, C₂, ..., c_nPosition information is output.
[0036]
For this reason, in step S1 shown in FIG.₁, C₂, ..., c_nAre arranged on a plane so as not to overlap each other, and a great circle surrounding them, that is, an inclusion circle C is found.
[0037]
Next, in step S2, step S3, and step S4, a circle having the same center as that of the inclusion circle C and having a radius that is p times the inclusion circle C, that is, a target circle D is determined. That is, the loop composed of N in step S2, step S3 and step S4 has the same center as the inclusion circle C and is slightly smaller than the inclusion circle C, and includes at least a plurality of circles c.₁, C₂, ..., c_nA target circle D is defined such that one of the circles protrudes from the inclusion circle D. In the following process, the circle c₁, C₂, ..., c_nThe arrangement is changed so that is within the target circle D.
[0038]
Next, in step S5, search insertion processing is performed. That is, here, any one circle c protruding from the target circle D_iTo circle c in descending order of distance_iTake out the other circles and move them as far as possible if they can be placed farther away, and leave them in the current position if you cannot do so. And this one circle c in the space created by such movement_iTry to move, ie, insert. In addition, about the process of this step S3, description is added later using FIGS.
[0039]
Next, in step S6, the circle c in step S5 above._iIs determined to be successful or not, if successful, the process returns to step S3 (Y in step S6); otherwise, the process proceeds to step S7 (N in step S6). When returning to step S3, it is determined whether or not there is another protruding circle, and if there is, the search insertion process of step S5 is performed again on this protruding circle, and if not, the process proceeds to step S4 to The same processing is performed.
[0040]
On the other hand, in step S7, a circle having an intermediate size between the inclusion circle C and the target circle D that has not been successfully inserted is newly set as the target circle D. Next, in step S8, it is determined whether or not the difference between the radii of the inclusion circle and the target circle D used in the processing of step S7 is equal to or smaller than the end reference value ε. If it is larger, the process returns to step S3 and the same processing as described above is repeated (N in step S8).
[0041]
In step S9, the radius of the inclusion circle C is output to the output device 5 as the final radius R of the wire harness. In addition, the inclusion circle C and each circle c at this time₁, C₂, ..., c_nIs also output to the output device 5. These outputs may be on a monitor display or may be printed on paper. The p and the end reference value ε may be slightly changed as appropriate.
[0042]
The behavior of each circle according to the above processing procedure is shown using FIG. 3 is a diagram showing the behavior according to the processing procedure of FIG. 2, in particular, FIG. 3 (a) shows an initial state, FIG. 3 (b) shows an insertion trial circle protruding from the target circle, and FIG. FIG. 3C shows a state where the insertion trial circle of FIG. 3B is inserted into the target circle, and FIG. 3D shows the final result.
[0043]
In FIG. 3 (a), given n circles c_iAre shown, and an enclosing circle C surrounding them is shown. FIG. 3B shows a state in the middle of the processing, which is one of the target circle D slightly smaller than the currently obtained inclusion circle C and a circle that protrudes from the target circle D. Insertion trial circle c_nIt is shown.
[0044]
In FIG. 3C, the insertion trial circle c shown in FIG._nOn the other hand, the state after the search insertion process of step S5 shown in FIG. 2 is performed is shown. In FIG. 3C, circle m_i(Circle group surrounding rough oblique lines) is an insertion trial circle c in the search insertion process._nThe moving circle group which moved to insert is shown. As can be seen from this figure, the other protruding circle is also the insertion trial circle c._nThe target circle D may be entered during the insertion process. FIG. 3D shows the result of the insertion process performed on all protruding circles.
[0045]
In this way, by repeatedly calculating the multiple wires that make up the wire harness as far as possible from the wires protruding from the inclusion circle, and inserting the wires protruding into the resulting space The outer diameter of the wire harness surrounding the plurality of wires is efficiently acquired.
[0046]
Next, the search insertion process in step S5 of FIG. 2 will be described with reference to FIG. FIG. 4 is a flowchart showing the search insertion process in FIG.
[0047]
In the search insertion process shown in FIG. 4, n circles c are used as input information._iRadius r_iAnd their centers (x_i, Y_i), I = 1, 2,..., N, and the target circle D is given. Where n circles c_iDo not overlap each other and the last circle c_nIs projected from the target circle D. There may be other protruding circles.
[0048]
Further, as output information, the last circle c is obtained without causing the circle already in the target circle D to protrude from the target circle D._nCan be inserted into the target circle D, the center positions of n circles that realize it as a success result are output, and if not, a message indicating that is output as a failure result.
[0049]
First, in step S51 of the search insertion process, n circles c_iTo the last circle c_nSort in ascending order. This order is more specifically n circles c_iEach center and the last circle c_nBased on the distance to the center of And here, for the sake of simplification, the c₁, C₂, ..., c_nAnd Hereinafter, this last circle is referred to as an insertion trial circle.
[0050]
Next, the process shown in step S52 to step S54a (or step S54b) is performed for i = 1, 2,..., N−1. In step S52, search processing is performed. That is, the circle c_iHowever, the movement candidate position that can move without overlapping with other circles in the target circle D is searched. Specifically, in this search process, the first search process shown in FIG. 5 or the second search process shown in FIG. 6 is performed. In the first search process, the circle c_iDoes not overlap with other circles in the target circle D, but the current circle c_iFrom the position of the insertion trial circle c_nSearch for a movement candidate position that is far from the position. In the second search process shown in FIG. 6, the concept of the circle Voronoi diagram is used, and the circle c_iIs searched for a movement candidate position that can move within the target circle D without overlapping with other circles. These will be described later.
[0051]
In step S53, step S54a, and step S54b, if there is a movement candidate position in the search process, an insertion trial circle c is included therein._nCircle c to the furthest position from_i(Y in step S53, step S54a), and if there is no movement candidate position, the circle c_iIs left at the current position (N in step S53, step S54b). After such processing is performed for i = 1, 2,..., N−1, the process proceeds to step S55. In addition, the said step S52-step S54 respond | corresponds to the search process of a claim.
[0052]
Next, in step S55, an insertion trial circle c for the space in the target circle D created by the loop processing consisting of the above steps S52 to S54a (or step S54b)._nTry to insert.
[0053]
Then, in step S56, step S57a, and step S57b, if the insertion is successful by the above insertion trial, the insertion trial circle c_n(Y in step S56, step S57a), and if it cannot be inserted, a message indicating that is output (N in step S56, step S57b). When the above is successful, the center positions of n circles that realize it are output. Then, when a series of processes including these steps S51 to S57a (or step S57b) is completed, the process returns to the subsequent process shown in FIG.
[0054]
Further, two examples of the search process will be described with reference to FIGS. 5 and 6. First, the first search process will be described with reference to FIG. FIG. 5 is a flowchart showing the first search process.
[0055]
In the first search process of FIG. 5, n circles c_iWhen there is space to move, the above insertion trial circle c_nIn the state moved farthest from the circle c_iNote that is supposed to touch two circles. However, one of the two circles in contact with each other may be the target circle D. So here, given n circles c_iAnd the set formed by the entire target circle D is S = {c₁, C₂, ..., c_n, D}. And circle c_iAll two circles c except_j, C_kFor εS, the processing shown in the following steps S521 to S529 is performed.
[0056]
First, in step S521, the radius r_iCircle of c_iIs the circle c_jAnd circle c_kFind a position that touches both. However, yen c_jOr circle c_kIf it is a circle other than the target circle D, it touches from the outside, and if it is the target circle D, touches from the inside. There are only two such positions, and the centers in that case are (x ′_i, Y '_i), (X ″_i, Y ″_i).
[0057]
Next, in step S522, when moving to one of the two positions, the circle c_iIs an insertion trial circle C rather than the current position_nIt is judged whether it is far from. That is, one center (x ′_i, Y '_i) Insertion trial circle C_nDistance X ′ to the center of the circle and the circle c of the current position_iFrom the center of the insertion trial circle C_nIf the distance X ′ is greater than the distance X, the process proceeds to step S523 (Y in step S522), otherwise proceeds to step S526 described later (N in step S522).
[0058]
In step S523, the circle c_i, Circle c_j, Circle c_kAnd for all circles other than the target circle D, the radius r_iCircle of c_iTo the center (x ′_i, Y '_i), Whether or not they overlap is determined, and the overlap is determined in step S524. If it is determined that none of the circles overlaps, the process proceeds to step S525 (N in step S524). In step S525, the center (x ′_i, Y '_i) To circle c_iOtherwise, the process proceeds to step S526 (Y in step S524).
[0059]
Further, the one center (x ′_i, Y '_i) The other center (x ″)_i, Y ″_iIn the same manner as in steps S522 to S525, the following processes in steps S526 to S529 are performed. In step S526, when moving to the other position of the two, the circle c_iIs an insertion trial circle C rather than the current position_nIt is judged whether it is far from. That is, the other center (x ″_i, Y ″_i) Insertion trial circle C_nX ″ to the center of the circle and the circle c at the current position_iFrom the center of the insertion trial circle C_nIf the distance X ″ is greater than the distance X, the process proceeds to step S527 (Y in step S526), otherwise proceeds directly to the next (N in step S526).
[0060]
In step S528, the circle c_i, Circle c_j, Circle c_kAnd for all circles other than the target circle D, the radius r_iCircle of c_iThe center (x ″_i, Y ″_i), It is checked whether or not they overlap, and the overlap is determined in step S528. If it is determined that no circle overlaps, the process proceeds to step S529 (N in step S528). In step S529, the center (x ″)_i, Y ″_i) To circle c_iOtherwise, the process proceeds directly to the next (Y in step S528). Such processing is represented by a circle c._iAll two circles c except_j, C_kIf it is performed, the process returns to the subsequent process shown in FIG.
[0061]
By using such a first search process, calculation of the outer diameter of the wire harness, which has been conventionally performed by the method and experience shown in FIG. 8, is improved and can be performed more accurately. Therefore, it helps the design of the wire harness. On the other hand, when the first search process is used, there is a problem that the amount of calculation becomes enormous. That is, in the first search process shown in FIG._i, Circle c_j, Circle c_kSince the above operation is performed on the set of, the calculation time is O (n^Three) In the search insertion process of FIG. 4 described above, since this is performed for all i = 1, 2,..., N, the calculation time is O (n^Four) Furthermore, in the processing of FIG. 2, since this is incorporated and repeated processing is performed, the total calculation amount becomes enormous. This is improved in the second search process shown in FIG.
[0062]
FIG. 6 is a flowchart showing the second search process. FIG. 7A is a diagram illustrating an example of a set of circles, and FIGS. 7B and 7C are respectively a circle Voronoi diagram and a Laguerre circle Voronoi diagram for the circle set in FIG. 7A. is there.
[0063]
First, the basic concept of the second search process will be described. In this second search process, using the concept of a well-known Voronoi diagram, an insertion trial circle c_iThe search for the movement candidate position is made efficient. That is, in the first search process, this circle c_iIn order to find the movement candidate position of_j, C_kHowever, if the concept of the Voronoi diagram is used, the candidates can be limited.
[0064]
Given a finite number of circles that do not overlap each other on the plane, the plane can be divided according to which circle is closest to it. This divided figure is called a circular Voronoi diagram, which is also shown in Non-Patent Document 1 above.
[0065]
For example, a circular Voronoi diagram for the circle group shown in FIG. 7A is as shown in FIG. 7B. A boundary side e called Voronoi side in FIG._jThe top point is two circles c_k, C_lThe other circles are more distant from each other at equal distances. Therefore, two circles c_k, C_lA circle that touches and does not overlap another circle is the boundary edge e of the circle Voronoi diagram_jIt will have a center on top. Therefore, circle c_iIs the boundary side e of the circle Voronoi diagram._jTwo circles c_k, C_lYou only need to search for this pair. Boundary edge e of a circle Voronoi diagram of n circles_jSince the number of is a book proportional to n, the circle to be searched c_k, C_lThe first search process in FIG. 5 is O (n²In this case, O (n).
[0066]
In addition, two circles c_k, C_lCircle c in contact with_iIn the first search process of FIG._iAll circles except_j, C_kIn this case, it is no longer necessary. That is, the circle c_iMove candidate position is the boundary side e_jIt is enough to check whether it is above. Because the boundary side e_jIf it is above, it does not overlap with other circles, and the boundary edge e_jThis is because, if it is not above, overlapping with other circles is derived from the nature of the circle Voronoi diagram. Therefore, the inspection time of O (n) can be set to O (1).
[0067]
The procedure of the second search process based on such a concept is as shown in FIG. In step S521 ′ of FIG. 6, first, the circle set S- {c_i}, That is, circle c_iMake a circle Voronoi diagram for all circles except. Here, this circle set S- {c_i} Is composed of n circles, and the number of boundary sides is also proportional to n.
[0068]
And each boundary side e_j, (J = 1, 2,..., N), the following steps S522 ′ to S525 ′ are performed.
[0069]
In step S522 ′, the boundary side e_jCircle c on both sides of_k, C_lRadius r_iCircle c '_imake. Here, however, the circle c_kOr circle c_lIf it is a circle other than the target circle D, it touches from the outside, and if it is the target circle D, touches from the inside. There are at most two such circles.
[0070]
In step S523 ′, the radius r that touches as described above._iCircle c '_iIs determined to be present (Y in step S523 ′), and in step S524 ′, the center is the boundary side e._jIf it is determined that it is above (Y in step S524 ′), the process proceeds to step S525 ′ and this circle c ′._iTo circle c_iIs added to the movement candidate position. Otherwise, proceed directly to the next (N in step S523 ′, N in step S524 ′). Such processing is performed for all boundary edges e._jIf it is performed, the process returns to the subsequent process shown in FIG.
[0071]
As is clear from the above description, by using the concept of the Voronoi diagram, the circle c_iIt can be seen that the search for the movement candidate position is greatly simplified. It is shown in the said nonpatent literature 1 that the circular Voronoi figure of n circle | round | yen can be made with the calculation time of O (nlogn). Therefore, the process of step S521 ′ can be executed in O (nlogn) time. On the other hand, since the boundary side of the circle Voronoi diagram of n circles has only the number proportional to n, the processing from step S522 ′ to step S524 ′ can be executed in O (n) time. From the above, the calculation time of the second search process shown in FIG. 6 is O (nlogn). For reference, in the first search process shown in FIG.^Three), The efficiency is greatly improved. Incidentally, when the second search process of FIG. 6 is incorporated into the search insertion process of FIG. 4, the process of FIG. 6 is executed O (n) times in the search insertion process of FIG. The calculation time of the search insertion process of 4 is O (n²logn).
[0072]
In addition, the simple calculation method of the said circular Voronoi diagram makes the Laguerre Voronoi diagram of the said nonpatent literature 1, and then performs this by the side flip operation of the said nonpatent literature 2 and the said nonpatent literature 3. This is a method of changing to a circular Voronoi diagram (see FIG. 7C).
[0073]
Thus, according to the present embodiment, using a computer, the plurality of wires constituting the wire harness are rearranged as far as possible from the wires protruding from the inclusion circle, and the wires protruding into the space created thereby By repeatedly calculating the operation of inserting the wire rod, the outer diameter of the wire harness surrounding the plurality of wires can be efficiently obtained. In particular, by adopting the concept of a circular Voronoi diagram, the outer diameter of the wire harness can be acquired very easily and in a short time.
[0074]
In addition, in the said embodiment, in order to obtain | require the outer diameter of a wire harness, although a radius is output, it cannot be overemphasized that this may be a diameter. Moreover, you may make it output not only the radius of a wire harness as mentioned above but the information which shows arrangement | positioning of each wire. Further, the values of p and ε are not limited to the values shown in the above embodiment, and can be appropriately changed within the scope of the gist of the present invention.
[0075]
【The invention's effect】
As described above, according to the invention described in claim 1, by using the computer to repeatedly execute the target circle definition step, the search step, the insertion step, and the first search control step, Increasing the inclusion circle gradually. Therefore, the outer diameter of the circle surrounding the plurality of wires can be acquired efficiently.
[0076]
According to the second aspect of the invention, by using the circle Voronoi diagram, the movement candidate position search for the insertion trial circle is greatly simplified. Therefore, the outer diameter of the circle surrounding the plurality of wires can be acquired in a short time.
[0077]
According to the third aspect of the present invention, when the insertion trial circle cannot be inserted, the target circle having an intermediate size between the inclusion circle and the current target circle is determined, and then the search is performed. Since the 2nd search control process returned to a process is further included, the outer diameter of the circle surrounding a plurality of wire rods can be acquired more efficiently.
[0078]
According to the fourth aspect of the invention, the initial information regarding the plurality of wires is input by the input unit, and the target circle definition unit, the search unit, the insertion unit, and the first search control unit gradually enter the plurality of wires. The inclusion circle is made smaller, and the output means outputs the outer diameter of the inclusion circle. Therefore, the outer diameter of the circle surrounding the plurality of wires can be acquired efficiently.
[0079]
According to the fifth aspect of the present invention, since the position information of each of the inclusion circle and the plurality of circles is also output, the outer diameter of the circle surrounding them including the arrangement of the plurality of wire rods can be acquired efficiently.
[0080]
According to the sixth aspect of the present invention, by using the circle Voronoi diagram in the second search means, the movement candidate position search for the insertion trial circle is greatly simplified. Therefore, the outer diameter of the circle surrounding the plurality of wires can be acquired in a short time.
[0081]
According to the seventh aspect of the present invention, when it is impossible to insert the insertion trial circle by the second search control means, the target circle having an intermediate size between the inclusion circle and the current target circle Since the search by the search means is performed again, the outer diameter of the circle surrounding the plurality of wires can be acquired more efficiently.
[0082]
According to the invention described in claim 8, by causing the computer to function as the target circle definition means, the search means, the insertion means, the first search control means, the input means, and the output means, the inclusion circle of a plurality of wire rods gradually. Is made smaller and the outer diameter of the inclusion circle is output. Therefore, the outer diameter of the circle surrounding the plurality of wires can be acquired efficiently.
[Brief description of the drawings]
FIG. 1 is a block diagram showing an example of a hardware configuration for realizing a calculation method and apparatus according to the present invention.
FIG. 2 is a flowchart showing a basic processing procedure according to an embodiment of the calculation method of the present invention.
3 (a) shows an initial state, FIG. 3 (b) shows an insertion trial circle protruding from the target circle, and FIG. 3 (c) shows an insertion trial circle of FIG. 3 (b). FIG. 3 (d) is a diagram showing a final result, showing a state in which the target circle is inserted.
FIG. 4 is a flowchart showing search insertion processing in FIG. 2;
FIG. 5 is a flowchart showing a first search process.
FIG. 6 is a flowchart showing a second search process.
7A is a diagram showing an example of a circle set, and FIGS. 7B and 7C are a circle Voronoi diagram and a Laguerre for the circle set in FIG. 7A, respectively. It is a circle Voronoi diagram.
FIG. 8A shows a wire harness composed of relatively few wires, and FIG. 8B is a diagram showing a wire harness composed of relatively many wires.
[Explanation of symbols]
1 Input device
2 I / O interface circuit
3 CPU
4 memory
5 Output device
C Inclusion circle
D target circle
c_n  Insertion trial circle
m_n  Moving circle
e_j  Border

Claims (8)

A calculation method for acquiring the outer diameter by bundling and packing a plurality of wires in a circle as small as possible so as not to overlap each other using a computer,
Assuming an inclusion circle including the plurality of circles arranged so as not to overlap each other on a plane, assuming that the cross-sectional shapes of the plurality of wires are a plurality of circles having a diameter corresponding to each outer shape. Process,
A target circle defining step that defines a target circle that has the same center as the inclusion circle and is slightly smaller than the inclusion circle and at least one of the plurality of circles protrudes;
A search step for searching for a position where the circle protruding from the target circle is an insertion trial circle, and the plurality of circles other than the insertion trial circle can move as far as possible within the target circle without overlapping each other; ,
An insertion step of inserting the insertion trial circle into a space in the target circle that can be arranged by changing the plurality of circles based on a search result by the search step;
When all the insertion trial circles are inserted into the target circle, a new target circle that is slightly smaller than the current one and has the insertion trial circle is determined, and then the search step is performed. A first search control step to return,
By repeatedly executing the target circle definition step, the search step, the insertion step and the first search control step, the inclusion circle is gradually reduced.
A wire packing calculation method characterized by the above. In the wire rod packing calculation method according to claim 1,
In the search step,
A circle Voronoi diagram is created with a circle group excluding one of the insertion trial circle and the plurality of circles, and the target circle, and is in contact with both side circles forming each boundary side in the circle Voronoi diagram By investigating whether or not the center of one circle is on the boundary side with respect to the plurality of circles other than the insertion trial circle, these circles can move within the target circle. Searching for a position,
A wire packing calculation method characterized by the above. In the wire rod packing calculation method according to claim 1 or claim 2,
It is repeatedly executed together with the target circle definition step, the search step, the insertion step and the first search control step,
When the insertion trial circle cannot be inserted, the other new one having an intermediate size between the inclusion circle and the current target circle and having the insertion trial circle A second search control step for returning to the search step after setting a target circle;
A wire rod packing calculation method, further comprising: A device for calculating the outer diameter by bundling a plurality of wires in a circle as small as possible so as not to overlap each other,
Assuming an inclusion circle including the plurality of circles arranged so as not to overlap each other on a plane, assuming that the cross-sectional shapes of the plurality of wires are a plurality of circles having a diameter corresponding to each outer shape. Means,
A target circle defining means for defining a target circle that has the same center as the inclusion circle and is slightly smaller than the inclusion circle and at least one of the plurality of circles protrudes;
Search means for searching for a position where the circle protruding from the target circle is an insertion trial circle, and the plurality of circles other than the insertion trial circle can move as far as possible within the target circle without overlapping each other; ,
An insertion means for inserting the insertion trial circle into a space in the target circle that can be arranged by changing the arrangement of the plurality of circles based on a search result by the search means;
When all the insertion trial circles are inserted into the target circle, the search means determines the new target circle that is slightly smaller than the current one and has the insertion trial circle. First search control means for performing a search;
Input means for inputting initial information regarding the plurality of wires;
Output means for outputting at least the outer diameter of the inclusion circle;
A wire-packing calculation device comprising: In the wire rod packing calculation device according to claim 4,
The output means includes
Output position information of each of the inclusion circle and the plurality of circles,
An apparatus for calculating a wire material packing. In the wire rod packing calculation apparatus according to claim 4 or 5,
The search means includes
A circle Voronoi diagram is created with a circle group excluding one of the insertion trial circle and the plurality of circles, and the target circle, and is in contact with both side circles forming each boundary side in the circle Voronoi diagram By investigating whether or not the center of one circle is on the boundary side with respect to the plurality of circles other than the insertion trial circle, these circles can move within the target circle. A second search means for searching for a position;
A packing calculation apparatus comprising: In the wire rod packing calculation device according to claim 4, claim 5, or claim 6,
When the insertion trial circle cannot be inserted, the other new one having an intermediate size between the inclusion circle and the current target circle and having the insertion trial circle Second search control means for performing a search by the search means after setting a target circle;
The wire material packing calculation device further comprising: In order to calculate the outer diameter by bundling and packing a plurality of wires in a circle as small as possible so as not to overlap each other,
Assuming an inclusion circle including the plurality of circles arranged so as not to overlap each other on a plane, assuming that the cross-sectional shapes of the plurality of wires are a plurality of circles having a diameter corresponding to each outer shape. means,
A target circle defining means for defining a target circle having the same center as the inclusion circle and slightly smaller than the inclusion circle and at least one of the plurality of circles protrudes;
A search means for setting a circle protruding from the target circle as an insertion trial circle, and searching for a position where the plurality of circles other than the insertion trial circle can move as far as possible within the target circle without overlapping each other,
An insertion means for inserting the insertion trial circle into a space in the target circle that can be arranged by changing the arrangement of the plurality of circles based on a search result by the search means;
When all the insertion trial circles are inserted into the target circle, the search means determines the new target circle that is slightly smaller than the current one and has the insertion trial circle. First search control means for performing a search;
Input means for inputting initial information regarding the plurality of wires,
At least an output means for outputting the outer diameter of the inclusion circle,
A wire material packing calculation program.

Images