JP6529025B2 - Deployment drawing creation device, deployment drawing data creation method, and program - Google Patents

Description

  The present invention relates to a development drawing creation apparatus, a drawing development data creation method, and a program.

  Patent Document 1 discloses a method of creating a development for reproducing a three-dimensional structure. Manual folding and bonding is required to reproduce three-dimensional structures based on the developed views generated by such techniques.

JP, 2014-203366, A

  There is a need to have the machine perform folding and bonding in order to reproduce a three-dimensional structure based on the exploded view. However, depending on the developed view, it may be necessary to simultaneously fold a plurality of fold lines, such as a split inside or fold over. Machines that allow such complex operations are expensive and require complex controls. In addition, even if the bending operation is facilitated by dividing the development into a plurality of parts, there is a problem in that more complicated operations are required due to the increase in the number of bonding points and the number of developments. .

  An object of the present invention is to provide a development drawing creation device, a development drawing data creation method, and a program for making a development drawing capable of reproducing a three-dimensional structure without bending a plurality of fold lines simultaneously.

According to the first aspect of the present invention, the development drawing apparatus is provided with an outline indicating the outline of a surface element group in which a plurality of surface elements constituting the surface of the three-dimensional structure are connected, and an adjacent surface element Connected to the expanded view including the expanded line including the broken line between the lines and the expanded view acquiring unit for acquiring the information indicating the pair of outlines to be joined and the inclusion point which is the vertex of the surface element and is not connected to the outline the developed view by two fold lines, and converts a cutting unit that divides the developed view by converting a pair of contour lines, a pair of the contour lines included in two of the developed view in one fold line to And a joint for joining the

  According to a second aspect of the present invention, in the development drawing creation device according to the first aspect, the cutting unit connects a fold line connecting the internal point and an end point connected to the outline to a pair of outlines. Convert.

According to the third aspect of the present invention, in the development drawing preparing device according to the first or second aspect, the joint portion joins the development drawing so that the overlapping portion does not occur in the surface element.

According to the fourth aspect of the present invention, the development drawing creation device according to any one of the first to third aspects can not join the development drawing so that the overlapping portion does not occur in the surface element. The development section is divided by converting the broken line connecting the two inclusion points and the broken line connecting the inclusion point and the outline into a pair of outlines.

According to a fifth aspect of the present invention, in the development drawing device according to the fourth aspect , when the plurality of included points are connected via the plurality of broken lines, the cutting unit is the plurality of included points. The minimum number of continuous broken lines connected to each other and the broken lines connecting the inclusion point and the outline are respectively converted into a pair of outlines.

According to a sixth aspect of the present invention, the development drawing creation device according to any one of the first to fifth aspects generates a connection graph, wherein the surface element is a node and the connection line is a link. The cutting unit further converts a broken line corresponding to a link forming the closed path into a pair of outlines when the closed path exists in the connection graph.

According to the seventh aspect of the present invention, in the method of creating development view data, the development view creation device is an outline showing a contour of a surface element group in which a plurality of surface elements constituting the surface of the three-dimensional structure are connected. Acquiring a developed view including a broken line between the adjacent face elements, and information indicating a pair of outlines to be joined, and the developed view creating device is a vertex of the face element; The step of dividing the developed view by converting the two broken lines connected to the inclusion point, which is a point not connected to the outline, into a pair of outlines, and the developed view creating device is included in the two expanded views Bonding the developed view by converting the pair of contours to one broken line .

According to an eighth aspect of the present invention, a program includes: a computer, an outline indicating an outline of a surface element group in which a plurality of surface elements constituting a surface of a three-dimensional structure are connected; A development drawing acquisition unit for acquiring information indicating a pair of outlines to be joined and a development drawing including a dividing line between the divisions, connecting to an inclusion point which is a vertex of the surface element and is not connected to the outline two fold lines, cuts dividing the developed view by converting a pair of contours, joining the developed view by converting the two said of the contour lines included in the developed view to-one fold line Function as a joint .

  According to at least one of the above aspects, the development drawing device can generate development drawing data capable of reproducing a three-dimensional structure without bending a plurality of fold lines simultaneously.

It is a schematic block diagram which shows the structure of the expanded drawing production apparatus which concerns on one Embodiment. It is a figure showing the 1st example of development drawing data. It is a figure which shows the 1st example of a connection graph. It is a flow chart which shows a creation method of development drawing data concerning one embodiment. It is a figure which shows the 2nd example of a developed view. It is a figure which shows the 2nd example of a connection graph. It is a figure which shows the 3rd example of a connection graph. It is a figure which shows the 3rd example of a developed view. It is a figure which shows the example of the expanded drawing output by the expanded drawing production apparatus which concerns on one Embodiment. It is a schematic block diagram showing composition of a computer concerning at least one embodiment.

Hereinafter, embodiments will be described in detail with reference to the drawings.
FIG. 1 is a schematic block diagram showing the configuration of a development drawing creating apparatus according to an embodiment.
The development drawing creation apparatus 1 includes a development drawing acquisition unit 101, a development drawing storage unit 102, a graph generation unit 103, a graph storage unit 104, a graph processing unit 105, a cutting unit 106, a joining unit 107, and an output unit 108.

The development view acquisition unit 101 acquires development view data for reproducing a three-dimensional structure. The development view acquisition unit 101 acquires, for example, development view data generated based on the technology described in Patent Document 1. In addition, the acquisition method of development drawing data is not specifically limited.
FIG. 2 is a diagram showing a first example of the development view data.
The development view data 2 includes a development view 21 and junction correspondence information 22. The development view 21 is a drawing in which all surface elements 211 of the three-dimensional structure are represented on a two-dimensional plane. The surface element refers to one mesh when the surface of the three-dimensional structure is divided into meshes. The shape of the mesh includes, but is not particularly limited to, a triangle, a tetragon, a pentagon, a hexagon and the like. The developed view 21 has a surface element 211, a fold line 212, a contour line 213, and an edge surface 214. The broken line 212 is a line which separates the adjacent surface elements 211 in the developed view 21. The fold line 212 forms a ridge of a three-dimensional structure by being bent along the line. The broken line 212 may be a line for dividing an n-gon (n is an integer of 4 or more) plane into a triangular area in the triangular polygon model. Such a fold line 212 is not bent, and therefore does not form a ridge of a three-dimensional structure. The fold line 212 may be either a fold line for mountain fold or a fold line for valley fold, and can be appropriately selected according to the shape of the three-dimensional structure to be reproduced. The outline 213 is a line indicating the outline of the surface element group in which the surface elements 211 are connected. The contour line 213 forms a ridge line of the three-dimensional structure by joining with the corresponding other contour line 213. That is, the surface element 211 is an area surrounded by the broken line 212 or the outline 213. The margin surface 214 is a surface provided adjacent to the surface element 211 via the outline 213. An adhesive surface 214 is provided to apply an adhesive for bonding the corresponding contours 213 together.
In the developed view 21 shown in FIG. 2, four surface elements 211 (a1) to (a4), three broken lines 212 (a1) to (a3), six outlines 213 (a1) to (a6), and 3 There are two adhesive surfaces 214 (a1) to (a3). The reference numerals in parentheses attached to the surface element 211, the broken line 212, the contour line 213 and the edge surface 214 are identifiers for identifying each element. The surface element 211 (a1) is a surface surrounded by the broken line 212 (a1), the outline 213 (a1) and the outline 213 (a2). The surface element 211 (a2) is a surface surrounded by the fold line 212 (a1), the fold line 212 (a2), and the fold line 212 (a3). The surface element 211 (a3) is a surface surrounded by the broken line 212 (a2), the outline 213 (a3) and the outline 213 (a4). The surface element 211 (a4) is a surface surrounded by the broken line 212 (a3), the outline 213 (a5) and the outline 213 (a6). The margin surface 214 (a1) is provided adjacent to the surface element 211 (a1) via the outline 213 (a1). The margin surface 214 (a2) is provided adjacent to the surface element 211 (a3) via the outline 213 (a4). The margin surface 214 (a3) is provided adjacent to the surface element 211 (a4) via the outline 213 (a5).
The junction correspondence information 22 is information associated with a pair of outlines 213 that need to be joined in order to reproduce a three-dimensional structure. The pair of contour lines 213 forms one ridge.
The bonding correspondence information 22 shown in FIG. 2 includes a pair of the outline 213 (a1) and the outline 213 (a3), a pair of the outline 213 (a2) and the outline 213 (a5), and an outline 213 (a4) It is the information which associated the pair of outline 213 (a6).
The development view storage unit 102 stores the development view data 2 acquired by the development view acquisition unit 101.

The graph generation unit 103 generates a connection graph based on the development view data 2 acquired by the development view acquisition unit 101.
FIG. 3 is a diagram showing a first example of the connection graph. The connection graph 30 shown in FIG. 3 corresponds to the development view data 2 shown in FIG.
The connection graph 30 is an undirected graph having a node 301 corresponding to the surface element 211 and a link 302 corresponding to the broken line 212.
The connection graph 30 illustrated in FIG. 3 includes four nodes 301 (a1) to (a4) and three links 302 (a1) to (a3). The symbols in parentheses attached to the node 301 and the link 302 are identifiers for identifying each element. The node 301 (a1) is a node corresponding to the surface element 211 (a1). The node 301 (a2) is a node corresponding to the surface element 211 (a2). The node 301 (a3) is a node corresponding to the surface element 211 (a3). The node 301 (a4) is a node corresponding to the surface element 211 (a4). The link 302 (a1) is a link corresponding to the broken line 212 (a1), and connects the node 301 (a1) and the node 301 (a2). The link 302 (a2) is a link corresponding to the broken line 212 (a2), and connects the node 301 (a2) and the node 301 (a3). The link 302 (a3) is a link corresponding to the broken line 212 (a3), and connects the node 301 (a2) and the node 301 (a4).

The graph storage unit 104 stores the connection graph 30 generated by the graph generation unit 103.
The graph processing unit 105 performs processing of converting the connection graph 30 stored in the graph storage unit 104 into a tree structure.
The cutting unit 106 converts the broken line 212 connected to the inclusion point included in the developed view 21 stored in the developed view storage unit 102 into a pair of outlines 213. Thereby, one developed view 21 can be divided into a plurality of developed views 21. The inclusion point is a point which is a vertex of the surface element 211 and is not connected to the outline 213.
The joint unit 107 converts the pair of outlines 213 indicated by the joint correspondence information 22 stored in the developed view storage unit 102 into fold lines 212. Thereby, a plurality of developed views 21 can be joined to one developed view 21.
The output unit 108 outputs the developed view data 2 stored in the developed view storage unit 102. For example, when the output unit 108 outputs the development data 2 to the printing machine, the development data 2 can be printed on a predetermined sheet. Further, for example, the sheet can be cut based on the development view data 2 by the output unit 108 outputting the development view data 2 to a cutting device such as a laser cutter. Examples of sheets include foldable sheets such as paper, metal foils, plastic sheets and the like.

Next, the operation of the development drawing creating apparatus 1 according to the present embodiment will be described.
FIG. 4 is a flowchart showing a method of creating development view data according to an embodiment.
The development drawing acquisition unit 101 of the development drawing creation device 1 acquires the development drawing data 2 by the input from the user or the external device (step S1). The development drawing acquisition unit 101 records the acquired development drawing data 2 in the development drawing storage unit 102 (step S2).
Next, based on the development view data 2 acquired by the development view acquisition unit 101, the graph generation unit 103 generates a connection graph 30 with the surface element 211 as the node 301 and the broken line 212 as the link 302 (step S3). . The graph generation unit 103 records the generated connection graph 30 in the graph storage unit 104 (step S4).

  Next, the graph processing unit 105 determines whether or not a closed circuit exists in the connection graph 30 stored by the graph storage unit 104 (step S5). The closed path is a path where the node 301 of the start point and the node 301 of the end point coincide when the node 301 is traced back via the link 302. Since the link 302 of the connection graph 30 corresponds to the broken line 212, the presence of a closed path in the connection graph 30 is equivalent to the presence of the inclusion point in the developed view 21.

FIG. 5 is a view showing a second example of the development view.
The developed view 21 shown in FIG. 5 includes six surface elements 211 (b1) to (b6) and six broken lines 212 (b1) to (b6). A broken line 212 (b1) is provided between the surface element 211 (b1) and the surface element 211 (b2). A broken line 212 (b2) is provided between the surface element 211 (b2) and the surface element 211 (b3). A broken line 212 (b3) is provided between the surface element 211 (b3) and the surface element 211 (b4). A broken line 212 (b4) is provided between the surface element 211 (b4) and the surface element 211 (b5). A broken line 212 (b5) is provided between the surface element 211 (b5) and the surface element 211 (b6). A broken line 212 (b6) is provided between the surface element 211 (b6) and the surface element 211 (b1).
In such a developed view 21, the broken lines 212 (b1) to (b6) have a common end point P. As shown in FIG. 5, the end point P is an included point not in contact with the contour line 213.

FIG. 6 is a diagram showing a second example of the connection graph.
By the conversion of the development diagram 21 shown in FIG. 5, the connection graph 30 shown in FIG. 6 is generated. The connection graph 30 illustrated in FIG. 6 includes six nodes 301 (b1) to (b6) and six links 302 (b1) to (b6). The link 302 (b1) connects the node 301 (b1) and the node 301 (b2). The link 302 (b2) connects the node 301 (b2) and the node 301 (b3). The link 302 (b3) connects the node 301 (b3) and the node 301 (b4). The link 302 (b4) connects the node 301 (b4) and the node 301 (b5). The link 302 (b5) connects the node 301 (b5) and the node 301 (b6). The link 302 (b6) connects the node 301 (b6) and the node 301 (b1). That is, the connection graph 30 shown in FIG. 6 has a closed path consisting of the links 302 (b1) to (b6). The closed path corresponds to the end point P shown in FIG.

When a closed circuit exists in the connection graph 30 (step S5: YES), the graph processing unit 105 selects one arbitrary node 301 that forms a closed circuit, and forms the closed circuit among links 302 connected to the node 301. Cut what is to be cut (step S6). Thus, the connection graph 30 stored by the graph storage unit 104 is divided into two connection graphs 30. In addition, although the junction part 107 which concerns on this embodiment selects the arbitrary nodes 301, it is not restricted to this. For example, in another embodiment, the nodes 301 may be selected according to a predetermined priority. As an example of the priority, the shorter the length of the path extending from the node 301 to the outside of the closed path (height of the tree in the tree structure), the higher the priority and the area of the surface element 211 corresponding to the node 301 become smaller. There is a high priority. The higher the priority, the lower the probability that overlapping parts will occur in the bonding process of the development view 21 described later. The overlapping portion means that when the developed view 21 is placed on a plane and the developed view 21 is observed from the direction perpendicular to the plane, a part of the two or more surface elements 211 or one of the two or more marginal faces 214. It is a portion where the part or the surface element 211 overlaps with a part of the edge surface 214.
When there is a closed loop group having the common link 302, the graph processing unit 105 selects one node 301 corresponding to the top of the outline of the closed loop group, and the graph processing unit 105 selects one of the links 302 connected to the node 301. Cut what forms the outline of the closed loop group. A node 301 not corresponding to a vertex of the contour of the closed loop group corresponds to a surface element 211 having all the vertices as inclusion points. Since such a surface element 211 does not have the outline 213, when the surface element 211 is divided, the development view 21 can not be joined in the joining process of the development view 21 described later.

FIG. 7 is a diagram showing a third example of the connection graph.
Here, an example of a closed circuit group having a common link 302 will be described. The connection graph 30 illustrated in FIG. 7 includes ten nodes 301 (c1) to (c10) and twelve links 302 (c1) to (c12). The connection graph 30 shown in FIG. 7 is a closed path consisting of the link 302 (c1), the link 302 (c2), the link 302 (c3), the link 302 (c10) and the link 302 (c11), the link 302 (c4), and the link A closed circuit consisting of 302 (c5), link 302 (c6), link 302 (c11) and link 302 (c12), link 302 (c7), link 302 (c8), link 302 (c9), link 302 (c10) And a closed circuit consisting of the link 302 (c12). These closed circuits constitute a closed circuit group having a common link 302.

FIG. 8 is a diagram showing a third example of the development view.
The connection graph 30 shown in FIG. 7 corresponds to the developed view 21 shown in FIG. In the developed view 21 shown in FIG. 8, ten plane elements 211 (c1) to (c10), thirteen broken lines 212 (c1) to (c13), and eight outlines 213 (c1) to ( c8) are included. Here, the broken lines 212 (c10) to (c12) corresponding to the links 302 (c10) to (c12) that do not form the outline of the closed path group are all broken lines 212 that connect two inclusion points. Here, as shown in FIG. 8, in the surface element 211 (c10) corresponding to the node 301 (c10) which does not correspond to the vertex of the contour of the closed loop group, all vertices P1 to P3 are inclusion points. Even if the developed view 21 is divided by cutting the surface element 211, it can not be connected to the outline 213.

  Next, the cutting unit 106 converts the broken line 212 corresponding to the link 302 cut by the graph processing unit 105 into a pair of outlines 213 (step S7). That is, the cutting unit 106 divides the developed view 21 stored in the developed view storage unit 102 into two developed views 21 and converts the broken line 212 into junction correspondence information 22 stored in the developed view storage unit 102. Add a pair of The broken line 212 corresponding to the link 302 cut by the graph processing unit 105 is a broken line 212 connecting the inner point and the end point connected to the outline 213.

Next, junction section 107 refers to junction correspondence information 22 stored in development view storage section 102, and is a pair of outlines 213 which are divided into two development views 21 respectively, The one not converted is identified (step S8). Next, the junction part 107 determines whether an overlapping part arises in the surface element 211, when the pair of the specified outline 213 is converted into the fold line 212 (step S9). That is, the joint portion 107 examines the conversion of the specified contour line 213 into the broken line 212 of the pair. When the overlapping part does not occur in the surface element 211 (step S9: NO), the joint unit 107 converts the pair of the specified outline 213 into the broken line 212, and updates the development view data 2 stored in the development view storage unit 102. (Step S10). That is, the junction 107 joins the two developed views 21 divided by the cutting unit 106 to one developed view 21 and converts the junction correspondence information 22 stored in the developed view storage unit 102 into a broken line 212. Delete 213 pairs. At this time, the joint portion 107 deletes the end face 214 adjacent to the outline 213 converted to the broken line 212 and adds the end face 214 adjacent to one of the pair of outlines 213 converted by the cutting portion 106.
Next, the graph processing unit 105 connects the two nodes 301 corresponding to the two surface elements 211 divided by the broken line 212 converted by the joint unit 107 by the new link 302, and the graph storage unit 104 stores them. The connection graph 30 is updated (step S11). That is, the graph processing unit 105 adds the link 302 corresponding to the broken line 212 converted by the joint unit 107 to the connection graph 30. Then, the development view creating device 1 returns to step S5, and determines the presence or absence of a closed circuit in the updated connection graph 30.

  On the other hand, when an overlap is generated in the plane element 211 by converting the specified pair of contour lines 213 into the fold line 212 (step S9: YES), the joint portion 107 is divided into two divided development views 21 respectively. It is determined whether there is a pair of existing outlines 213 whose conversion to the broken line 212 has not been examined (step S12). If there is a pair of outlines 213 not considering conversion to the broken line 212 (step S12: YES), the process returns to step S8, and the conversion to the broken line 212 is examined for the pair of outlines 213. That is, the joint portion 107 joins the developed view 21 so that the overlapping portion does not occur in the surface element 211. On the other hand, when all pairs of contour lines 213 have been considered to be converted to the broken line 212 (step S12: NO), the graph processing unit 105 cancels the disconnection of the link 302 in step S6 (step S13). That is, the graph processing unit 105 connects the two nodes 301 whose link 302 is disconnected in step S6 again by the link 302.

Next, the graph processing unit 105 determines whether or not there is another node 301 whose disconnection has not yet been considered among the nodes 301 that form a closed loop (step S14). If there is another node 301 not considering the disconnection of the link 302 (step 14: YES), the graph processing unit 105 returns to step S6 to consider the disconnection of the link 302 connected to the node 301.
On the other hand, when disconnection of the link 302 is considered for all the nodes 301 constituting a closed path (step S14: NO), the graph processing unit 105 determines whether the closed path is a closed path group having the common link 302 or not. Is determined (step S15). When the closed circuit is not a closed circuit group having the common link 302 (step S15: NO), the graph processing unit 105 disconnects the links 302 connected to an arbitrary node 301 forming the closed circuit that constitutes the closed circuit. (Step S16). Thus, the graph processing unit 105 divides one connection graph 30 into two connection graphs 30.

  On the other hand, if the closed circuit is a closed circuit group having the common link 302 (step S15: YES), the graph processing unit 105 sets each closed circuit constituting the closed circuit group as a node and sets the link 302 common to the closed circuits as a link. A closed loop graph is created (step S17). That is, the nodes of the closed loop graph correspond to the included points of the development view 21, and the links of the closed loop graph correspond to the broken line 212 connecting the included points. Next, the graph processing unit 105 searches for the smallest path (link combination) that can trace the maximum number of nodes in the closed loop graph (step S18). When there are a plurality of minimum paths which can trace the maximum number of nodes of the closed loop graph, the graph processing unit 105 selects an arbitrary path. In another embodiment, the graph processing unit 105 gives each link of the closed loop graph a weight corresponding to the length of the broken line 212 corresponding to the link, and searches for a path with the smallest sum of weights. Also good.

Next, the graph processing unit 105 includes, among the links 302 of the connection graph 30, the link 302 corresponding to the searched route, the link 302 connected to the start point of the route, and the link 302 connected to the start point of the route. Are disconnected (step S19), and the connection graph 30 stored by the graph storage unit 104 is updated. Thus, the graph processing unit 105 can divide the connection graph 30 so as to eliminate as many closed circuits as possible.
For example, the closed loop graph generated on the basis of the connection graph 30 shown in FIG. 7 and the developed view 21 shown in FIG. 8 has the inclusion points P1 to P3 as nodes and links 302 (c10) and P1 connecting P1 and P3. It is a graph which makes a link 302 (c11) which connects P2, and a link 302 (c12) which connects P2 and P3 a link. As a path capable of tracing the maximum number of nodes of the closed loop graph, there is a path following a link corresponding to the link 302 (c11) and a link corresponding to the link 302 (c12). In this case, in step S19, the graph processing unit 105 links link 302 (c11) and link 302 (c12) corresponding to the route, link 302 (c3) connected to the route start point, and link connected to the route end point And 302 (c7). Thus, the graph processing unit 105 can eliminate the closed circuit from the connection graph 30 illustrated in FIG. 7.

  When the connection graph 30 is divided in step S16 or step S19, the cutting unit 106 converts the broken line 212 corresponding to the link 302 cut by the graph processing unit 105 into a pair of outlines 213 (step S20), The development drawing data 2 stored in the drawing storage unit 102 is updated. Thus, the cutting unit 106 can divide one developed view 21 into two developed views 21. At this time, the number of included points in the divided development view 21 is the same as the number of closed circuits in the divided connection graph 30. In addition, since the connection graph 30 is divided so as to reduce the number of closed circuits as much as possible, the process of step S20 is equivalent to dividing the development view 21 so as to reduce the number of included points as much as possible. When the development view creating device 1 divides the development view 21 and the connection graph 30, the process returns to step S5, and determines the presence or absence of a closed circuit with respect to each connection graph 30.

  When there is no closed path in the connection graph 30 stored by the graph storage unit 104 (step S5: NO), that is, when the connection graph 30 has a tree structure, the output unit 108 stores the expansion map stored by the expansion view storage unit 102. The diagram data 2 is output (step S21), and the process ends. Thereby, the development drawing device 1 can output the development drawing 21 without the inclusion point, that is, the development drawing 21 in which the end points of all the broken lines 212 are in contact with the outline 213.

Here, the reason why the three-dimensional structure can be reproduced without bending the plurality of broken lines 212 at the same time will be described by the developed view 21 outputted by the present embodiment.
In FIG. 5, an example of a developed view 21 having an included point P is given. When creating a three-dimensional structure according to the developed view 21 shown in FIG. 5, when bending the broken line 212 (b5), it is necessary to simultaneously bend the broken lines 212 (b1) to (b6) around the inclusion point P. This is because the surface element 211 having the inclusion point P at the vertex receives deformation from a plurality of routines. For example, when the surface element 211 (b1) is bent along the fold line 212 (b1), the surface element 211 (b2) is deformed. The deformation affects the surface element 211 (b3) through the broken line 212 (b2). Similarly, the deformation affects the surface element 211 (b4), the surface element 211 (b5), and the surface element 211 (b6). On the other hand, when the surface element 211 (b1) is bent along the fold line 212 (b6), the surface element 211 (b6) is deformed. Thus, the surface element 211 (b6) receives deformation from two routines. Further, in the developed view 21 shown in FIG. 5, when one fold line 212 is folded, when one end of the sheet is folded, the portion without the fold line 212 may also be folded. For example, when one end of the sheet is folded along the fold line 212 (b4), even the surface element 211 (b1) without the fold line 212 is also folded.

FIG. 9 is a diagram showing an example of a development view output by the development view creation device according to one embodiment.
There is no inclusion point in the developed view 21 shown in FIG. That is, both ends of all the broken lines 212 are connected to the outline 213. Therefore, since all surface elements 211 receive deformation from only one routine, when creating a three-dimensional structure according to the developed view 21 shown in FIG. 9, all fold lines 212 should be bent from one end of the sheet to the other Can.

Therefore, a three-dimensional structure can be created by simple control of a machine tool having two arms by using the developed view 21 created by the creation method according to the present embodiment. Specifically, a three-dimensional structure can be created by the following procedure.
First, the first arm of the machine tool presses the sheet cut along the outline 213 of the developed view 21 along the fold line 212. Next, the second arm of the machine tool bends the sheet pressed by the first arm along the fold line 212. At this time, since both ends of the broken line 212 are connected to the outline 213, the second arm bends the sheet along the broken line 212 by sliding along the broken line 212 from one end of the sheet to the other end. Can. Thereafter, the machine tool repeatedly executes the above operation for all the broken lines 212. Thus, the machine tool can create a three-dimensional structure by simple control. The structure of the machine tool is not limited to one having two arms.

As mentioned above, although one embodiment was described in detail with reference to drawings, a concrete configuration is not restricted to the above-mentioned thing, It is possible to do various design changes etc.
For example, the development view 21 according to the above-described embodiment includes, but is not limited to, the flank surface 214. For example, in another embodiment, if the sheets have a sufficient thickness and the adhesive can be applied to the cut surface, and if an adhesive means having an adhesive surface such as a tape is used, the sheets are joined to match the cut surfaces. The developed surface 21 may not include the adhesive surface 214. In this case, the development drawing device 1 may not deform the development drawing 21 according to the procedure of steps S7 to S20. That is, the development drawing device 1 can reproduce a three-dimensional structure without bending the plurality of bending lines 212 at the same time simply by converting the broken lines 212 connected to the inclusion points into the pair of outlines 213. 21 can be created. That is, the procedure of steps S7 to S20 according to the present embodiment is performed to obtain a margin for providing the margin surface 214.
Note that the development drawing creation device 1 according to the other embodiment outputs the development drawing data corresponding to a plurality of development drawings 21 without causing the bonding unit 107 to function (without performing steps S10 and S11). It is good. In this case, although the number of developed views 21 is not minimized, the developed view creating apparatus 1 can create the developed view 21 capable of reproducing a three-dimensional structure without bending a plurality of broken lines 212 simultaneously. it can.

FIG. 10 is a schematic block diagram showing the configuration of a computer according to at least one embodiment.
The computer 900 includes a CPU 901, a main storage 902, an auxiliary storage 903, and an interface 904.
The above-described development drawing creation apparatus 1 is mounted on the computer 900. The operation of each processing unit described above is stored in the auxiliary storage device 903 in the form of a program. The CPU 901 reads a program from the auxiliary storage device 903 and develops the program in the main storage device 902, and executes the above processing according to the program. Further, the CPU 901 secures the storage area corresponding to each storage unit described above in the main storage device 902 according to the program.

  In at least one embodiment, the auxiliary storage device 903 is an example of a non-temporary tangible medium. Other examples of non-transitory tangible media include magnetic disks connected via an interface 904, magneto-optical disks, CD-ROMs, DVD-ROMs, semiconductor memories, and the like. Further, when this program is distributed to the computer 900 through a communication line, the computer 900 that has received the distribution may deploy the program in the main storage unit 902 and execute the above processing.

  Further, the program may be for realizing a part of the functions described above. Furthermore, the program may be a so-called difference file (difference program) that realizes the above-described function in combination with other programs already stored in the auxiliary storage device 903.

1 development view creation device 101 development view acquisition unit 102 development view storage unit 103 graph generation unit 104 graph storage unit 105 graph processing unit 106 cutting unit 107 connection unit 108 output unit 2 development view data 21 development view 22 connection correspondence information 211 surface element 212 broken line 213 outline 214 attached surface 30 connection graph 301 node 302 link

Claims (8)

A development view including an outline indicating the outline of a surface element group in which a plurality of surface elements constituting the surface of a three-dimensional structure are connected, and a broken line dividing the adjacent surface elements, and A development acquisition unit for acquiring information indicating pairs;
A cutting unit configured to divide the developed view by converting two broken lines connected to inclusion points that are vertices of the surface element and are not connected to the outline, into a pair of outlines ;
An exploded view creating apparatus comprising: a joint portion joining the developed view by converting the pair of outlines included in the two developed views into one broken line . The development drawing creation device according to claim 1, wherein the cutting unit converts a broken line connecting an inclusion point and an end point connected to an outline into a pair of outlines. The joining portion joins the developed view so that an overlapping portion does not occur in the surface element
The development drawing creation apparatus of Claim 1 or Claim 2 . When the developed view can not be joined so as not to cause an overlapping portion in the surface element, the cutting portion connects a broken line connecting two inclusion points and a broken line connecting the inclusion point and the outline; Divide the developed view by converting each into a pair of outlines
The development drawing creation device according to any one of claims 1 to 3 . When a plurality of included points are connected via a plurality of broken lines, the cutting unit connects a minimum number of continuous broken lines connected to the plurality of included points, the contained point, and the outline. Convert the broken line into a pair of outlines
The development drawing creation device according to claim 4 . The system further includes a connection graph generation unit that generates a connection graph in which the surface element is a node and the broken line is a link;
The cutting unit, if there is closed in the connection graph, the polyline corresponding to the link constituting the closed circuit, from claim 1 for converting the pair of contour lines according to any one of claims 5 Deployment drawing device. A development drawing including a contour line indicating a contour of a surface element group in which a plurality of surface elements constituting the surface of the three-dimensional structure are connected, and a broken line dividing the adjacent surface elements; Obtaining information indicating a pair of outlines to be joined;
The development drawing device divides the development drawing by converting two broken lines connected to inclusion points that are vertices of the surface element and are not connected to the outline, into a pair of outlines; ,
And a step of joining the developed views by converting the pair of outlines included in the two developed views into one broken line . Computer,
A development view including an outline indicating the outline of a surface element group in which a plurality of surface elements constituting the surface of a three-dimensional structure are connected, and a broken line dividing the adjacent surface elements, and Deployment view acquisition unit that acquires information indicating pairs,
A cutting unit configured to divide the developed view by converting two broken lines connected to inclusion points that are vertices of the surface element and are not connected to the outline, into a pair of outlines ;
A program for functioning as a junction that joins the developed views by converting the pair of outlines included in the two developed views into one broken line .

Images