EP3565909B1 - A method for modifying the cutting path for cutting parts from a soft material - Google Patents

A method for modifying the cutting path for cutting parts from a soft material Download PDF

Info

Publication number
EP3565909B1
EP3565909B1 EP17822000.0A EP17822000A EP3565909B1 EP 3565909 B1 EP3565909 B1 EP 3565909B1 EP 17822000 A EP17822000 A EP 17822000A EP 3565909 B1 EP3565909 B1 EP 3565909B1
Authority
EP
European Patent Office
Prior art keywords
cutting
segments
path
parts
common
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
EP17822000.0A
Other languages
German (de)
French (fr)
Other versions
EP3565909A1 (en
Inventor
Sylvain GUILBERT
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Lectra SA
Original Assignee
Lectra SA
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Lectra SA filed Critical Lectra SA
Publication of EP3565909A1 publication Critical patent/EP3565909A1/en
Application granted granted Critical
Publication of EP3565909B1 publication Critical patent/EP3565909B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B26—HAND CUTTING TOOLS; CUTTING; SEVERING
    • B26D—CUTTING; DETAILS COMMON TO MACHINES FOR PERFORATING, PUNCHING, CUTTING-OUT, STAMPING-OUT OR SEVERING
    • B26D5/00—Arrangements for operating and controlling machines or devices for cutting, cutting-out, stamping-out, punching, perforating, or severing by means other than cutting
    • B26D5/005—Computer numerical control means
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B26—HAND CUTTING TOOLS; CUTTING; SEVERING
    • B26F—PERFORATING; PUNCHING; CUTTING-OUT; STAMPING-OUT; SEVERING BY MEANS OTHER THAN CUTTING
    • B26F1/00—Perforating; Punching; Cutting-out; Stamping-out; Apparatus therefor
    • B26F1/38—Cutting-out; Stamping-out
    • B26F1/3806—Cutting-out; Stamping-out wherein relative movements of tool head and work during cutting have a component tangential to the work surface
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B26—HAND CUTTING TOOLS; CUTTING; SEVERING
    • B26F—PERFORATING; PUNCHING; CUTTING-OUT; STAMPING-OUT; SEVERING BY MEANS OTHER THAN CUTTING
    • B26F1/00—Perforating; Punching; Cutting-out; Stamping-out; Apparatus therefor
    • B26F1/38—Cutting-out; Stamping-out
    • B26F1/3806—Cutting-out; Stamping-out wherein relative movements of tool head and work during cutting have a component tangential to the work surface
    • B26F1/3813—Cutting-out; Stamping-out wherein relative movements of tool head and work during cutting have a component tangential to the work surface wherein the tool head is moved in a plane parallel to the work in a coordinate system fixed with respect to the work
    • C—CHEMISTRY; METALLURGY
    • C14—SKINS; HIDES; PELTS; LEATHER
    • C14B—MECHANICAL TREATMENT OR PROCESSING OF SKINS, HIDES OR LEATHER IN GENERAL; PELT-SHEARING MACHINES; INTESTINE-SPLITTING MACHINES
    • C14B5/00—Clicking, perforating, or cutting leather
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B26—HAND CUTTING TOOLS; CUTTING; SEVERING
    • B26D—CUTTING; DETAILS COMMON TO MACHINES FOR PERFORATING, PUNCHING, CUTTING-OUT, STAMPING-OUT OR SEVERING
    • B26D5/00—Arrangements for operating and controlling machines or devices for cutting, cutting-out, stamping-out, punching, perforating, or severing by means other than cutting
    • B26D2005/002—Performing a pattern matching operation
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B26—HAND CUTTING TOOLS; CUTTING; SEVERING
    • B26D—CUTTING; DETAILS COMMON TO MACHINES FOR PERFORATING, PUNCHING, CUTTING-OUT, STAMPING-OUT OR SEVERING
    • B26D7/00—Details of apparatus for cutting, cutting-out, stamping-out, punching, perforating, or severing by means other than cutting
    • B26D7/01—Means for holding or positioning work
    • B26D7/018—Holding the work by suction
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B26—HAND CUTTING TOOLS; CUTTING; SEVERING
    • B26D—CUTTING; DETAILS COMMON TO MACHINES FOR PERFORATING, PUNCHING, CUTTING-OUT, STAMPING-OUT OR SEVERING
    • B26D7/00—Details of apparatus for cutting, cutting-out, stamping-out, punching, perforating, or severing by means other than cutting
    • B26D7/18—Means for removing cut-out material or waste
    • B26D7/1818—Means for removing cut-out material or waste by pushing out
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B26—HAND CUTTING TOOLS; CUTTING; SEVERING
    • B26D—CUTTING; DETAILS COMMON TO MACHINES FOR PERFORATING, PUNCHING, CUTTING-OUT, STAMPING-OUT OR SEVERING
    • B26D7/00—Details of apparatus for cutting, cutting-out, stamping-out, punching, perforating, or severing by means other than cutting
    • B26D7/18—Means for removing cut-out material or waste
    • B26D7/1845—Means for removing cut-out material or waste by non mechanical means
    • B26D7/1854—Means for removing cut-out material or waste by non mechanical means by air under pressure
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B26—HAND CUTTING TOOLS; CUTTING; SEVERING
    • B26F—PERFORATING; PUNCHING; CUTTING-OUT; STAMPING-OUT; SEVERING BY MEANS OTHER THAN CUTTING
    • B26F1/00—Perforating; Punching; Cutting-out; Stamping-out; Apparatus therefor
    • B26F1/38—Cutting-out; Stamping-out
    • B26F2001/388—Cutting-out; Stamping-out controlling the blade orientation along the cutting path
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10T—TECHNICAL SUBJECTS COVERED BY FORMER US CLASSIFICATION
    • Y10T83/00—Cutting
    • Y10T83/141—With means to monitor and control operation [e.g., self-regulating means]
    • Y10T83/148—Including means to correct the sensed operation
    • Y10T83/155—Optimizing product from unique workpiece

Definitions

  • the present invention relates to the general field of cutting parts from a flexible material.
  • a particular but non-limiting field of application of the invention is that of cutting parts in a coupon of flexible non-textile material such as leather, in particular in the clothing industry, furniture or saddlery. automobile.
  • the process of cutting parts from a coupon of flexible material takes place as follows.
  • the skin to be cut is first prepared, that is to say that an operator locates any defects on the skin and identifies them directly on it by means of marks.
  • the skin with its marks is then scanned.
  • the operator optimizes the placement of the different parts to be cut from the skin. This placement is converted into a part cutting program.
  • the skin is then positioned on the cutting table to be cut there generally by means of a blade fitted to the cutting tool and moving in the skin according to cutting trajectories defined by the pre-established program for cutting the parts.
  • the cutting of parts with such a process can however pose certain problems, in particular when two parts to be cut from the skin are too close to each other (typically less than 1mm from each other).
  • the blade of the cutting tool which cuts the second part risks being “attracted” by the cutting of the first part due to the proximity to the latter.
  • the second part may have cutting defects which adversely affect the quality of the part obtained.
  • the main object of the present invention is therefore to alleviate such drawbacks by proposing to transform the cutting paths of two neighboring pieces to be cut.
  • the document GB-A-2 138 595 discloses a method for automatically modifying the cutting path of parts intended to be cut from a flexible material by automatically moving a cutting tool along predetermined cutting paths.
  • the cutting paths associated with each part are defined by a succession of cutting segments forming a polygon.
  • the invention is remarkable in that it provides a method for automatically modifying the cutting paths of two pieces that are too close to each other by creating two perfectly superimposed cutting paths for the two cutting segments in proximity to each other.
  • the method according to the invention makes it possible to slightly modify the cutting trajectories of the two parts in order to superimpose them at the level of the cutting segments in proximity to one another. Thus, any defect in the cutting of these parts due to their close proximity can be avoided.
  • the method according to the invention is in the form of an algorithm, the automatic implementation of which is simple and rapid.
  • this algorithm for modifying the cutting path can be integrated during the step of preparing the cutting program for all the parts of the placement to be cut in a skin so as to allow the operator to be able to keep a check on the result obtained.
  • the step of identifying two cutting segments can comprise, successively for each piece to be cut, the expansion by a predetermined value of the polygon formed by the cutting segments of said piece to obtain a first expanded polygon, the identification of 'an intersection between the first expanded polygon and a polygon formed by the cut segments of another part, expanding the predetermined value of the polygon formed by the cut segments of the other part to obtain a second expanded polygon, l '' identification of an intersection between the second expanded polygon and the polygon formed by the cut segments of said part, and the reunification of the intersections to obtain two cut segments belonging to two different parts to be cut and for which a maximum distance condition between these cutting segments is observed.
  • the step of verifying that the previously identified cut segments are located opposite each other may include the reciprocal orthogonal projection of the cut segments on top of each other, the projection of each segment of cutting on the other cutting segment in a direction orthogonal to the projected cutting segment, and the union of the projections thus produced to obtain two portions of cutting segments located one opposite the other.
  • the step of verifying the absence of other cutting segments between the two cutting segments can successively comprise the calculation of the intersections between the two parts, the construction of a geometric quadrilateral formed by the two cutting segments. , the intersection between the previously constructed quadrilateral and the two pieces to be cut, and the subtraction from the previously constructed quadrilateral of the overlaps between the two pieces to be cut.
  • the method may further comprise, when subtracting the overlaps results in an empty set, indicating that no cutting path is present between the two cutting segments.
  • the step of calculating a common cutting path for the two cutting segments can include the projection of each cutting segment on the other cutting segment while keeping the same length ratio for each segment, and creating a common cut path by interconnecting points at equal distances from the ends of the projections of the cut segments.
  • the step of connecting the common cutting path to the cutting path of the two pieces to be cut advantageously comprises the application of the following connections taken successively until a functional connection is obtained: connection by extending the path of common cut, straight connection of the common cutting path, connection with shortening of the common cutting path, rectilinear connection with shortening of the common cutting path, connection by extending the common cutting path with another common cutting path, rectilinear connection of the common cutting path with another common cutting path.
  • connection is meant here a connection for which the algorithm defined for the connection in question makes it possible to obtain a non-zero result.
  • the method preferably further comprises a check that the applied connections do not generate a deviation of the cutting paths of the two pieces to be cut greater than a predetermined angle.
  • the invention also relates to the use of the method as defined above for the automatic modification of the cutting path of pieces intended to be cut from a leather skin.
  • the invention also relates to a computer program comprising instructions for executing the steps of the method for automatically modifying the cutting path of parts as defined above.
  • the invention also relates to an information medium readable by a computer and comprising instructions of a computer program as mentioned above.
  • the information medium can be any entity or device capable of storing the program.
  • the medium may include a storage means, such as a ROM, for example a CD ROM or a microelectronic circuit ROM, or else a magnetic recording means, for example a floppy disk or a disk. hard.
  • the information medium can be a transmissible medium such as an electrical or optical signal, which can be conveyed via an electrical or optical cable, by radio or by other means.
  • the program according to the invention can in particular be downloaded from an Internet type network.
  • the information medium can be an integrated circuit in which the program is incorporated, the circuit being adapted to execute or to be used in the execution of the method in question.
  • the figure 1 represents an example of placement P of several pieces p-1, p-2, p-3, ... etc. intended to be cut from a skin.
  • this placement P is a digital file which includes a digital representation of the skin with its possible defects and a digital representation of the outline of each part to be cut from the skin.
  • the parts that is to say their digital representation
  • the parts are positioned on the skin (that is to say its digital representation) according to an optimized placement taking into account in particular any defects of the skin and so as to minimize loss of material.
  • This placement P is carried out by means of appropriate software equipping a computer workstation, either automatically or via an operator.
  • the placement P is then converted into a workpiece cutting program, that is, instructions for moving a cutting head in the skin positioned on a cutting table along predetermined cutting paths.
  • the cutting paths associated with each piece to be cut are defined by a succession of rectilinear cutting segments connected to one another to form a polygon encompassing the geometric contour of the piece.
  • the optimized placement P can give rise to the positioning of two parts very close to each other: this is particularly the case for parts p-2 and p-3 illustrated on the figure 1 . Indeed, as shown in more detail on figure 2 , these parts p-2, p-3 each have a side, respectively c-2 and c-3, for which the cutting paths are very close to each other.
  • cutting paths very close to one another is meant paths which are less than 1 mm apart from each other.
  • the blade of the cutting tool which cuts the second part may be "attracted" by the cutting of the first part due to the proximity of the latter.
  • the second part has cutting defects which adversely affect the quality of the cut part.
  • the method according to the invention provides for automatically modifying the cutting paths of the two parts p-2 and p-3 by modifying the cutting segments corresponding to the respective sides c-2, c-3 of these pieces to create two perfectly overlapping cutting paths for these two cutting segments.
  • the cutting tool will pass twice between the two parts p-2, p-3 but on exactly the same path.
  • the first step of the method according to the invention consists in automatically identifying in the placement P all the pairs of cutting segments belonging to two different pieces to be cut in the material and for which a maximum distance condition between these cutting segments is respected.
  • This first step is accomplished by expanding each piece of the placement to the maximum distance and intersecting with the other pieces in the placement to determine which ones meet the maximum distance condition.
  • FIG 3 illustrates an example of implementation of this first step for two parts pi and pj of the placement (diagram (A)). For reasons of clarity, these parts have been shown here with a circular outline. Of course, the dilation principle described below is suitable for parts with a polygonal outline.
  • one of the two parts (the part p-i on the example of diagram (B)) is expanded by a predetermined value d corresponding to the maximum distance (for example 1mm).
  • this expansion corresponds to an expansion of the polygon formed by the part cutting segments p-i and makes it possible to obtain a first expanded part p'-i.
  • the second part (the part p-j on the example of diagram (D)) is in turn expanded by the predetermined value d so as to obtain a second expanded part p'-j.
  • the last sub-step provides for bringing together the two intersections si, sj thus identified so as to obtain two cutting segments belonging to two different parts pi, pj to be cut and for which the condition of maximum distance d between these cutting segments is respected.
  • This first step of the method consisting in identifying two cutting segments for which a condition of maximum distance between these cutting segments is respected is carried out for all the parts p of the placement P.
  • the second step of the method according to the invention consists in automatically checking that the two previously identified cutting segments are indeed located one opposite the other.
  • the algorithm developed during the first step of the method identifies in the placement two parts pi, pj for which two respective cutting segments, ci and cj, are spaced from each other by a distance less than the predetermined maximum distance.
  • these two cutting segments ci, cj are not located opposite each other, so that a common cutting path cannot be established for these cutting segments.
  • the algorithm of the first step of the method identifies two parts pk, pl for which two respective cutting segments, ck and cl, are spaced from each other by a distance less than the distance maximum predetermined while one of these cutting segments (here the segment ck) is longer than the other.
  • the step of establishing a common cutting path for these two cutting segments may pose a problem.
  • the second step of the method according to the invention provides for adding a constraint to the pairs of previously identified cutting segments to ensure the possibility of establishing a common cutting trajectory.
  • FIG. 5A An example is shown on figure 5A with two cutting segments ci, cj for which it has been previously verified that the maximum distance condition has been respected.
  • the two ends c-i-1, c-i-2 of the cutting segment c-i are projected orthogonally on the line which bears the cutting segment c-j. These projections intersect the straight line which carries the section segment cj at a point A for the end ci-1, and at a point B for the other end ci-2, these points of intersection possibly being on the segment of cut cj (case of point A) or outside this cut segments (case of point B).
  • the two ends cj-1, cj-2 of the cutting segment cj are projected orthogonally on the line which bears the cutting segment ci. These projections cross the line which carries the section segment ci at a point C (here located outside the section segment ci) for the end cj-1, and at a point D (here located on the section segment ci) for the other end cj-2.
  • a second sub-step consists in carrying out the projection of each section of section on the other section of section (or rather on the line which bears this other section of section) in a direction orthogonal to the projected section of section.
  • the two ends ci-1, ci-2 of the cutting segment ci are projected onto the straight line which bears the cutting segment cj in a direction orthogonal to the cutting segment ci. These projections cross the straight line which carries the segment of section cj at a point E (for the end ci-1) and at a point F (for the end ci-2).
  • the two ends c-j-1, c-j-2 of the cutting segment c-j are projected onto the line which carries the cutting segment c-i in a direction orthogonal to the cutting segment c-j. These projections intersect the line which carries the section segment c-i at a point G (for the end c-j-1) and at a point H (for the end c-j-2).
  • the last sub-step then consists in making the union of the projections thus carried out and in eliminating the parts which are outside the cutting segments so as to obtain two portions of cutting segments located one opposite the other. .
  • this union gives the two cut segment portions delimited, for the cutting segment ci, by the points ci-1 and H, and for the cutting segment cj, by the points A and cj-2. It is considered that these two portions of the section segment are located opposite each other.
  • the third step of the method according to the invention consists in verifying the absence of other cutting segments between the two previously identified cutting segments. This step ensures that the cut segments that have been identified are on the correct side of the parts (that is, no part of the parts is between the two cut segments).
  • This third step is carried out by calculating the intersections between the two pieces to be cut. To this end, we check whether the area between the two identified cutting segments intersects a part, and, if so, we check whether we are in an overlapping area between the parts to know if the pair of cutting segments is valid. Of course, in the case where the area between the two cutting segments does not intersect any other part or the parts overlap at this location, the pair of cutting segments is valid and the next step in the process is continued.
  • the two pieces to be cut p-i, p-j overlap at the level of their respective cutting segments c-i, c-j (this overlap being of very small dimensions less than 0.1 mm).
  • the first sub-step consists in carrying out a calculation of the intersections I1, I2 between the two parts (here two in number - cf. figure 6A ).
  • a quadrilateral Q1 formed by the pair of cutting segments ci, cj (cf. figure 6B ).
  • a third sub-step one carries out an intersection of this quadrilateral Q1 with the two parts pi, pj (this intersection gives as result the polygon T1 - cf. figure 6C ).
  • the method according to the invention provides for concatenating the cutting segments which are adjacent to each other to form cutting trajectories (composed of several adjacent cutting segments), then, during a fourth step, of calculating common cutting paths for all the cutting segments.
  • the cutting path 1 is here formed of three interconnected cutting segments, namely the segments 10 to 12, while the cutting path 2 is formed of two cutting segments 20, 21.
  • the cutting segments 10 to 12 are delimited by points A, B, C and D.
  • the cutting segments 20, 21 are delimited by points E, F and G.
  • the cutting segment 10 is projected onto the cutting path 2 with the projection of point A at E and the projection of point B at B '(with the length of the segment [AB] divided by that of the path 1 which is equal to the length of the segment [EB '] divided by that of the trajectory 2).
  • segment 12 is projected onto cutting path 2 with the projection of point D in G and that of point C in C '(with the length of segment [CD] divided by that of path 1 which is equal to the length of the segment [C'G] divided by that of the trajectory 2).
  • the cut segment 20 of the cut path 2 is projected onto the cut path 1 with the projection of point E at A and the projection of point F at F '(the length of the segment [EF] divided by that of trajectory 2 is equal to the length of segment [AF '] divided by that of trajectory 1).
  • the cutting segment 21 is also projected on the cutting path 1 with the projection of the point F in F 'and the projection of the point G in D (the length of the segment [FG] divided by that of the path 2 is equal to the length of the segment [F'D] divided by that of the trajectory 1).
  • this step provides for creating a common cutting path 30 from the points situated at equal distances from the ends. of these segments (namely point I for segment [AE], point J for segment [BB '], point K for segment [FF'], point L for segment [CC '] and point M for segment [DG]).
  • the last step of the method according to the invention consists in connecting the common cutting path to the cutting path of the two pieces to be cut so as to obtain modified cutting paths for the two pieces to be cut.
  • the outline 32 of the part to which the cutting path is connected is formed of a plurality of cutting segments. If we consider the point P1 as being the end point of the contour 32 having served for the calculation of the common cutting path 30, the contour 32 is here formed of the cutting segments [P1P2], [P2P3], [P3P4 ], etc.
  • the algorithm for implementing this step of connection by extension provides for traveling, from point P1, each section of the contour 32 to the one for which the cumulative curvilinear distance does not exceed twice the maximum distance d defined in the first step of the process according to the invention.
  • cumulative curvilinear distance is meant the distance along the curve between point P1 and the section segment considered, ie the sum of the lengths of the section segments [P1P2], [P2P3], etc. up to the cut segment considered.
  • the step of connection by extension successively implements the following sub-steps.
  • the parallelism between the segment and the common cutting path is checked. If the segment is parallel to the common cutting path, we move on to the next segment.
  • the point of intersection between the segment considered and the common cutting path is considered. If this point of intersection is beyond the end of the segment furthest from the common cutting path, you move on to the next segment.
  • I1, I2, I3 be the respective intersections between the segments [P1P2], [P2P3], [P3P4] and the common cutting path 20.
  • points I1 and I3 fully comply with the aforementioned condition (which does not is not the case with point I2).
  • the third sub-step provides for comparing the distance between the previously determined point of intersection and the end point Pe of the common cutting path with a threshold predetermined corresponding to the maximum distance d defined in the first step of the method according to the invention.
  • this distance between the point of intersection and the end point Pe is greater than the maximum distance d, we move on to the next segment. On the other hand, as soon as we obtain a segment for which the distance between the point of intersection and the end point Pe is less than or equal to the maximum distance d, we keep this point of intersection as the point of connection between the common cut path and the contour of the part.
  • connection by extension cannot be applied.
  • the point of intersection I1 between the segment [P1P2] and the common cutting path is located at a distance greater than the maximum distance d from the end Pe of the common cutting path 30.
  • the distance between the point of intersection I3 between the segment [P2P3] and the common cutting path and the point Pe is here less than the distance d , so that this point I3 is kept and defined as being the point of connection between the cutting path joint and the outline of the room.
  • the common cutting path 30 with the end point Pe of the latter, as well as the contour 32 of the part to which the cutting path is connected, the latter consisting of segments [P1P2], [P2P3], etc. (P1 being the end point of the contour having been used for the calculation of the common cutting path 30).
  • the algorithm for implementing this rectilinear connection step provides for traversing, from point P1, each section of the contour to the one for which the cumulative curvilinear distance does not exceed two times the maximum distance d defined in the first step of the process.
  • the rectilinear connection step successively implements the following sub-steps.
  • all the points I of the segment considered are calculated which make it possible to have a deviation between the segment [PeI] and the segment considered which is less than the angle ⁇ . For that, one calculates the single point such that this angle is equal to ⁇ in absolute value.
  • the points which fulfill the aforementioned condition are the points of the segment considered which are situated beyond this point in the direction of the contour.
  • connection it is possible to apply a rectilinear connection with shortening of the common cutting path.
  • This type of blend is more particularly applicable when a common cutting path ends at a very acute angle to the contour of a part.
  • the two aforementioned types of connection cannot be used.
  • the algorithm for blending with shortening is the same as for straight blending, but instead of starting from the end of the common cutting path (point Pe), the end of the acute angle is taken as the fixed point formed by the contour of the part and each section of the contour is traversed as previously described.
  • connection When two common cutting paths are parallel (or quasi-parallel) to each other, the aforementioned type of connection does not apply and we can instead apply a rectilinear connection of the common cutting path with another common cutting path .
  • this type of connection we take as a fixed point the end of a common cutting path and we traverse the segments of the other common cutting path (we choose the fixed point on the common cut path closest to the pieces to avoid cutting the corner of a piece).
  • connection is applied by extending the common cutting path, then if necessary the connection straight line of the common cutting path, then if necessary the connection with shortening of the common cutting path, then if necessary the straight connection with shortening of the common cutting path, then if necessary the connection by extending the common cutting path with another common cutting path, and finally if necessary the rectilinear connection of the common cutting path with another common cutting path.

Landscapes

  • Engineering & Computer Science (AREA)
  • Mechanical Engineering (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Forests & Forestry (AREA)
  • General Engineering & Computer Science (AREA)
  • Chemical & Material Sciences (AREA)
  • Organic Chemistry (AREA)
  • Control Of Cutting Processes (AREA)
  • Treatment And Processing Of Natural Fur Or Leather (AREA)
  • Numerical Control (AREA)

Description

Arrière-plan de l'inventionBackground of the invention

La présente invention se rapporte au domaine général de la découpe de pièces dans un matériau souple.The present invention relates to the general field of cutting parts from a flexible material.

Un domaine particulier mais non limitatif d'application de l'invention est celui de la découpe de pièces dans un coupon de matière souple non textile comme le cuir, en particulier dans l'industrie de la confection, de l'ameublement ou de la sellerie automobile.A particular but non-limiting field of application of the invention is that of cutting parts in a coupon of flexible non-textile material such as leather, in particular in the clothing industry, furniture or saddlery. automobile.

De façon connue en soi, le processus de découpe de pièces dans un coupon de matière souple, telle qu'une peau par exemple, se déroule de la manière suivante. La peau à découper est d'abord préparée, c'est-à-dire qu'un opérateur repère sur la peau d'éventuels défauts et les identifie directement sur celle-ci au moyen de marques. La peau avec ses marques est ensuite numérisée. A partir de la représentation numérique de la peau et au moyen d'un logiciel approprié, l'opérateur effectue un placement optimisé des différentes pièces devant être découpées dans la peau. Ce placement est converti en un programme de découpe des pièces. La peau est alors positionnée sur la table de coupe pour y être découpée généralement au moyen d'une lame équipant l'outil de coupe et se déplaçant dans la peau selon des trajectoires de coupe définies par le programme préétabli de découpe des pièces.In a manner known per se, the process of cutting parts from a coupon of flexible material, such as a skin for example, takes place as follows. The skin to be cut is first prepared, that is to say that an operator locates any defects on the skin and identifies them directly on it by means of marks. The skin with its marks is then scanned. Using the digital representation of the skin and using appropriate software, the operator optimizes the placement of the different parts to be cut from the skin. This placement is converted into a part cutting program. The skin is then positioned on the cutting table to be cut there generally by means of a blade fitted to the cutting tool and moving in the skin according to cutting trajectories defined by the pre-established program for cutting the parts.

La découpe des pièces avec un tel processus peut cependant poser certains problèmes, notamment lorsque deux pièces à découper dans la peau sont trop proches l'une de l'autre (typiquement moins de 1mm l'une de l'autre). En effet, dans cette situation, à l'issue de la découpe de la première pièce, la lame de l'outil de coupe qui découpe la seconde pièce risque d'être « attirée » par la découpe de la première pièce du fait de la proximité de cette dernière. Il en résulte que la seconde pièce peut présenter des défauts de découpe qui nuisent à la qualité de la pièce obtenue.The cutting of parts with such a process can however pose certain problems, in particular when two parts to be cut from the skin are too close to each other (typically less than 1mm from each other). In fact, in this situation, after cutting the first part, the blade of the cutting tool which cuts the second part risks being “attracted” by the cutting of the first part due to the proximity to the latter. As a result, the second part may have cutting defects which adversely affect the quality of the part obtained.

Objet et résumé de l'inventionPurpose and summary of the invention

La présente invention a donc pour but principal de pallier de tels inconvénients en proposant de transformer les trajectoires de coupe de deux pièces voisines à découper.The main object of the present invention is therefore to alleviate such drawbacks by proposing to transform the cutting paths of two neighboring pieces to be cut.

Le document GB-A-2 138 595 divulgue un procédé de modification automatique de la trajectoire de coupe de pièces destinées à être découpées dans un matériau souple par déplacement automatique d'un outil de découpe suivant des trajectoires de coupe prédéterminées. Les trajectoires de coupe associés à chaque pièce sont définies par une succession de segments de coupe formant un polygone.The document GB-A-2 138 595 discloses a method for automatically modifying the cutting path of parts intended to be cut from a flexible material by automatically moving a cutting tool along predetermined cutting paths. The cutting paths associated with each part are defined by a succession of cutting segments forming a polygon.

Conformément à l'invention, ce but est atteint grâce à un procédé de modification automatique de la trajectoire de coupe de pièces destinées à être découpées dans un matériau souple par déplacement automatique d'un outil de coupe suivant des trajectoires de coupe prédéterminées, les trajectoires de coupe associées à chaque pièce étant définies par une succession de segments de coupe formant un polygone, le procédé comprenant successivement :

  • une étape d'identification de deux segments de coupe appartenant à deux pièces différentes à découper dans le matériau et pour lesquels une condition de distance maximale entre ces segments de coupe est respectée ;
  • une étape de vérification que les deux segments de coupe préalablement identifiés sont situés l'un en face de l'autre par projection orthogonale réciproque des segments de coupe l'un sur l'autre ;
  • une étape de vérification de l'absence d'autres segments de coupe entre les deux segments de coupe préalablement identifiés par un calcul d'intersections entre les deux pièces à découper ;
  • une étape de calcul d'une trajectoire de coupe commune pour les deux segments de coupe préalablement identifiés ; et
  • une étape de raccordement de la trajectoire de coupe commune à la trajectoire de coupe des deux pièces à découper de façon à obtenir des trajectoires de coupe modifiées pour les deux pièces à découper.
According to the invention, this object is achieved by means of a method for automatically modifying the cutting path of parts intended to be cut from a flexible material by automatic displacement of a cutting tool along predetermined cutting paths, the paths cutting associated with each part being defined by a succession of cutting segments forming a polygon, the method comprising successively:
  • a step of identifying two cutting segments belonging to two different pieces to be cut from the material and for which a condition of maximum distance between these cutting segments is met;
  • a step of verifying that the two previously identified cutting segments are located opposite each other by reciprocal orthogonal projection of the cutting segments on one another;
  • a step of verifying the absence of other cutting segments between the two cutting segments previously identified by a calculation of intersections between the two pieces to be cut;
  • a step of calculating a common cutting path for the two previously identified cutting segments; and
  • a step of connecting the common cutting path to the cutting path of the two pieces to be cut so as to obtain modified cutting paths for the two pieces to be cut.

L'invention est remarquable en ce qu'elle propose un procédé permettant de modifier de façon automatique les trajectoires de coupe de deux pièces trop proches l'une de l'autre en créant deux trajectoires de coupe parfaitement superposées pour les deux segments de coupe en proximité l'un de l'autre. En d'autres termes, le procédé selon l'invention permet de légèrement modifier les trajectoires de coupe des deux pièces pour les superposer au niveau des segments de coupe en proximité l'un de l'autre. Ainsi, tout défaut de coupe de ces pièces du fait de leur grande proximité peut être évité.The invention is remarkable in that it provides a method for automatically modifying the cutting paths of two pieces that are too close to each other by creating two perfectly superimposed cutting paths for the two cutting segments in proximity to each other. In other words, the method according to the invention makes it possible to slightly modify the cutting trajectories of the two parts in order to superimpose them at the level of the cutting segments in proximity to one another. Thus, any defect in the cutting of these parts due to their close proximity can be avoided.

De plus, le procédé selon l'invention se présente sous la forme d'un algorithme dont la mise en œuvre automatique est simple et rapide. Notamment, cet algorithme de modification de la trajectoire de coupe peut être intégré au cours de l'étape de préparation du programme de découpe de l'ensemble des pièces du placement à découper dans une peau de sorte à permettre à l'opérateur de pouvoir conserver un contrôle sur le résultat obtenu.In addition, the method according to the invention is in the form of an algorithm, the automatic implementation of which is simple and rapid. In particular, this algorithm for modifying the cutting path can be integrated during the step of preparing the cutting program for all the parts of the placement to be cut in a skin so as to allow the operator to be able to keep a check on the result obtained.

L'étape d'identification de deux segments de coupe peut comprendre, successivement pour chaque pièce à découper, la dilatation d'une valeur prédéterminée du polygone formé par les segments de coupe de ladite pièce pour obtenir un premier polygone dilaté, l'identification d'une intersection entre le premier polygone dilaté et un polygone formé par les segments de coupe d'une autre pièce, la dilatation de la valeur prédéterminée du polygone formé par les segments de coupe de l'autre pièce pour obtenir un second polygone dilaté, l'identification d'une intersection entre le second polygone dilaté et le polygone formé par les segments de coupe de ladite pièce, et la réunification des intersections pour obtenir deux segments de coupe appartenant à deux pièces différentes à découper et pour lesquels une condition de distance maximale entre ces segments de coupe est respectée.The step of identifying two cutting segments can comprise, successively for each piece to be cut, the expansion by a predetermined value of the polygon formed by the cutting segments of said piece to obtain a first expanded polygon, the identification of 'an intersection between the first expanded polygon and a polygon formed by the cut segments of another part, expanding the predetermined value of the polygon formed by the cut segments of the other part to obtain a second expanded polygon, l '' identification of an intersection between the second expanded polygon and the polygon formed by the cut segments of said part, and the reunification of the intersections to obtain two cut segments belonging to two different parts to be cut and for which a maximum distance condition between these cutting segments is observed.

De plus, l'étape de vérification que les segments de coupe préalablement identifiés sont situés l'un en face de l'autre peut comprendre la projection orthogonale réciproque des segments de coupe l'un sur l'autre, la projection de chaque segment de coupe sur l'autre segment de coupe selon une direction orthogonale au segment de coupe projeté, et l'union des projections ainsi réalisées pour obtenir deux portions de segments de coupe situées l'une en face de l'autre.In addition, the step of verifying that the previously identified cut segments are located opposite each other may include the reciprocal orthogonal projection of the cut segments on top of each other, the projection of each segment of cutting on the other cutting segment in a direction orthogonal to the projected cutting segment, and the union of the projections thus produced to obtain two portions of cutting segments located one opposite the other.

De même, l'étape de vérification de l'absence d'autres segments de coupe entre les deux segments de coupe peut comprendre successivement le calcul des intersections entre les deux pièces, la construction d'un quadrilatère géométrique formé par les deux segments de coupe, l'intersection entre le quadrilatère précédemment construit et les deux pièces à découper, et la soustraction au quadrilatère précédemment construit des chevauchements entre les deux pièces à découper.Likewise, the step of verifying the absence of other cutting segments between the two cutting segments can successively comprise the calculation of the intersections between the two parts, the construction of a geometric quadrilateral formed by the two cutting segments. , the intersection between the previously constructed quadrilateral and the two pieces to be cut, and the subtraction from the previously constructed quadrilateral of the overlaps between the two pieces to be cut.

Dans ce cas, le procédé peut comprendre en outre, lorsque la soustraction des chevauchements donne un ensemble vide, l'indication selon laquelle aucune trajectoire de coupe n'est présente entre les deux segments de coupe.In this case, the method may further comprise, when subtracting the overlaps results in an empty set, indicating that no cutting path is present between the two cutting segments.

Quant à l'étape de calcul d'une trajectoire de coupe commune pour les deux segments de coupe, elle peut comprendre la projection de chaque segment de coupe sur l'autre segment de coupe en conservant le même ratio de longueur pour chaque segment, et la création d'une trajectoire de coupe commune en reliant entre eux des points situés à égales distances des extrémités des projections des segments de coupe.As for the step of calculating a common cutting path for the two cutting segments, it can include the projection of each cutting segment on the other cutting segment while keeping the same length ratio for each segment, and creating a common cut path by interconnecting points at equal distances from the ends of the projections of the cut segments.

L'étape de raccordement de la trajectoire de coupe commune à la trajectoire de coupe des deux pièces à découper comprend avantageusement l'application des raccordements suivants pris successivement jusqu'à l'obtention d'un raccordement fonctionnel : raccordement par prolongation de la trajectoire de coupe commune, raccordement rectiligne de la trajectoire de coupe commune, raccordement avec raccourcissement de la trajectoire de coupe commune, raccordement rectiligne avec raccourcissement de la trajectoire de coupe commune, raccordement par prolongation de la trajectoire de coupe commune avec une autre trajectoire de coupe commune, raccordement rectiligne de la trajectoire de coupe commune avec une autre trajectoire de coupe commune.The step of connecting the common cutting path to the cutting path of the two pieces to be cut advantageously comprises the application of the following connections taken successively until a functional connection is obtained: connection by extending the path of common cut, straight connection of the common cutting path, connection with shortening of the common cutting path, rectilinear connection with shortening of the common cutting path, connection by extending the common cutting path with another common cutting path, rectilinear connection of the common cutting path with another common cutting path.

Par raccordement fonctionnel, on entend ici un raccordement pour lequel l'algorithme défini pour le raccordement en question permet d'obtenir un résultat non nul.By functional connection is meant here a connection for which the algorithm defined for the connection in question makes it possible to obtain a non-zero result.

Dans ce cas, le procédé comprend en outre de préférence une vérification que les raccordements appliqués n'engendrent pas de déviation des trajectoires de coupe des deux pièces à découper supérieure à un angle prédéterminé.In this case, the method preferably further comprises a check that the applied connections do not generate a deviation of the cutting paths of the two pieces to be cut greater than a predetermined angle.

L'invention concerne également l'utilisation du procédé tel que défini précédemment pour la modification automatique de la trajectoire de coupe de pièces destinées à être découpées dans une peau en cuir.The invention also relates to the use of the method as defined above for the automatic modification of the cutting path of pieces intended to be cut from a leather skin.

L'invention concerne encore un programme d'ordinateur comportant des instructions pour l'exécution des étapes du procédé de modification automatique de la trajectoire de coupe de pièces tel que défini précédemment.The invention also relates to a computer program comprising instructions for executing the steps of the method for automatically modifying the cutting path of parts as defined above.

L'invention vise aussi un support d'informations lisible par un ordinateur et comportant des instructions d'un programme d'ordinateur tel que mentionné ci-dessus. Le support d'informations peut être n'importe quelle entité ou dispositif capable de stocker le programme. Par exemple, le support peut comporter un moyen de stockage, tel qu'une ROM, par exemple un CD ROM ou une ROM de circuit microélectronique, ou encore un moyen d'enregistrement magnétique, par exemple une disquette (floppy disc) ou un disque dur.The invention also relates to an information medium readable by a computer and comprising instructions of a computer program as mentioned above. The information medium can be any entity or device capable of storing the program. For example, the medium may include a storage means, such as a ROM, for example a CD ROM or a microelectronic circuit ROM, or else a magnetic recording means, for example a floppy disk or a disk. hard.

D'autre part, le support d'informations peut être un support transmissible tel qu'un signal électrique ou optique, qui peut être acheminé via un câble électrique ou optique, par radio ou par d'autres moyens. Le programme selon l'invention peut être en particulier téléchargé sur un réseau de type Internet. Alternativement, le support d'informations peut être un circuit intégré dans lequel le programme est incorporé, le circuit étant adapté pour exécuter ou pour être utilisé dans l'exécution du procédé en question.On the other hand, the information medium can be a transmissible medium such as an electrical or optical signal, which can be conveyed via an electrical or optical cable, by radio or by other means. The program according to the invention can in particular be downloaded from an Internet type network. Alternatively, the information medium can be an integrated circuit in which the program is incorporated, the circuit being adapted to execute or to be used in the execution of the method in question.

Brève description des dessinsBrief description of the drawings

D'autres caractéristiques et avantages de la présente invention ressortiront de la description faite ci-dessous, en référence aux dessins annexés qui en illustrent un exemple de réalisation dépourvu de tout caractère limitatif. Sur les figures :

  • la figure 1 est une vue schématique montrant un exemple de placement de pièces à découper dans un matériau souple auquel s'applique le procédé selon l'invention ;
  • la figure 2 est une loupe de la figure 1 montrant deux pièces du placement pour lesquelles des segments de coupe sont très proches l'un de l'autre ;
  • la figure 3 est une vue schématique montrant un exemple de mise en œuvre de l'étape d'identification de deux segments de coupe pour lesquels une condition de distance maximale est respectée ;
  • les figures 4A et 4B montrent des exemples de pièces dont des segments de coupe respectent la condition de distance maximale précitée ;
  • les figures 5A à 5C illustrent de façon schématique un exemple de mise en œuvre de l'étape de vérification que les deux segments de coupe préalablement identifiés sont situés l'un en face de l'autre ;
  • les figures 6A à 6D montrent de façon schématique un exemple de mise en œuvre de l'étape de vérification de l'absence d'autres segments de coupe entre deux segments de coupe ;
  • les figures 7A à 7C montrent de façon schématique un exemple de mise en œuvre de l'étape de calcul d'une trajectoire de coupe commune pour deux segments de coupe ;
  • la figure 8 montre un exemple de mise en œuvre d'un raccordement d'une trajectoire de coupe commune par prolongation ; et
  • la figure 9 montre un exemple de mise en œuvre d'un raccordement rectiligne d'une trajectoire de coupe commune.
Other characteristics and advantages of the present invention will emerge from the description given below, with reference to the appended drawings which illustrate an exemplary embodiment thereof without any limiting nature. In the figures:
  • the figure 1 is a schematic view showing an example of the placement of pieces to be cut in a flexible material to which the method according to the invention applies;
  • the figure 2 is a magnifying glass of the figure 1 showing two parts of the placement for which cut segments are very close to each other;
  • the figure 3 is a schematic view showing an exemplary implementation of the step of identifying two cutting segments for which a maximum distance condition is met;
  • the figures 4A and 4B show examples of parts whose cutting segments meet the aforementioned maximum distance condition;
  • the figures 5A to 5C schematically illustrate an example of implementation of the step of verifying that the two previously identified cutting segments are located one opposite the other;
  • the figures 6A to 6D schematically show an example of the implementation of the step of verifying the absence of other cutting segments between two cutting segments;
  • the figures 7A to 7C schematically show an example of implementation of the step of calculating a common cutting path for two cutting segments;
  • the figure 8 shows an example of implementation of a connection of a common cutting path by extension; and
  • the figure 9 shows an example of implementation of a rectilinear connection of a common cutting path.

Description détaillée de l'inventionDetailed description of the invention

Dans la description qui suit, il est envisagé la découpe de pièces dans des peaux pour la réalisation d'articles en cuir. L'invention est toutefois applicable à la découpe de pièces dans un matériau souple autre que le cuir.In the following description, it is envisaged the cutting of parts in skins for the production of leather articles. The invention is however applicable to the cutting of parts in a flexible material other than leather.

La figure 1 représente un exemple de placement P de plusieurs pièces p-1, p-2, p-3,... etc. destinées à être découpées dans une peau. Typiquement, ce placement P est un fichier numérique qui comprend une représentation numérique de la peau avec ses éventuels défauts et une représentation numérique du contour de chaque pièce devant être découpée dans la peau. Les pièces (c'est-à-dire leur représentation numérique) sont positionnées sur la peau (c'est-à-dire sa représentation numérique) selon un placement optimisé tenant notamment compte des éventuels défauts de la peau et de façon à minimiser les pertes de matière.The figure 1 represents an example of placement P of several pieces p-1, p-2, p-3, ... etc. intended to be cut from a skin. Typically, this placement P is a digital file which includes a digital representation of the skin with its possible defects and a digital representation of the outline of each part to be cut from the skin. The parts (that is to say their digital representation) are positioned on the skin (that is to say its digital representation) according to an optimized placement taking into account in particular any defects of the skin and so as to minimize loss of material.

Ce placement P est réalisé au moyen d'un logiciel approprié équipant une station de travail informatique, soit de façon automatique, soit par l'intermédiaire d'un opérateur. Le placement P est ensuite converti en programme de découpe des pièces, c'est-à-dire en instructions de déplacement d'une tête de coupe dans la peau positionnée sur une table de coupe selon des trajectoires de coupe prédéterminées.This placement P is carried out by means of appropriate software equipping a computer workstation, either automatically or via an operator. The placement P is then converted into a workpiece cutting program, that is, instructions for moving a cutting head in the skin positioned on a cutting table along predetermined cutting paths.

Les trajectoires de coupe associées à chaque pièce à découper sont définies par une succession de segments rectilignes de coupe reliés les uns aux autre pour former un polygone englobant le contour géométrique de la pièce.The cutting paths associated with each piece to be cut are defined by a succession of rectilinear cutting segments connected to one another to form a polygon encompassing the geometric contour of the piece.

Le placement P optimisé peut donner lieu à des positionnements de deux pièces très proches l'une de l'autre : cela est notamment le cas pour les pièces p-2 et p-3 illustrées sur la figure 1. En effet, comme représenté plus en détail sur la figure 2, ces pièces p-2, p-3 présentent chacune un côté, respectivement c-2 et c-3, pour lequel les trajectoires de coupe sont très proches l'une de l'autre. A titre d'exemple, on entend par trajectoires de coupe très proches l'une de l'autre, des trajectoires qui sont distantes l'une de l'autre de moins de 1mm.The optimized placement P can give rise to the positioning of two parts very close to each other: this is particularly the case for parts p-2 and p-3 illustrated on the figure 1 . Indeed, as shown in more detail on figure 2 , these parts p-2, p-3 each have a side, respectively c-2 and c-3, for which the cutting paths are very close to each other. By way of example, by cutting paths very close to one another is meant paths which are less than 1 mm apart from each other.

Dans cette situation, à l'issue de la découpe de la première pièce (par exemple la pièce p-2), la lame de l'outil de coupe qui découpe la seconde pièce (par exemple la pièce p-3) risque d'être « attirée » par la découpe de la première pièce du fait de la proximité de cette dernière. Il en résulte que la seconde pièce présente des défauts de découpe qui nuisent à la qualité de la pièce découpée.In this situation, after cutting the first part (for example the part p-2), the blade of the cutting tool which cuts the second part (for example the part p-3) may be "attracted" by the cutting of the first part due to the proximity of the latter. As a result, the second part has cutting defects which adversely affect the quality of the cut part.

Pour éviter ce problème, le procédé selon l'invention prévoit de modifier de façon automatique les trajectoires de coupe des deux pièces p-2 et p-3 en modifiant les segments de coupe correspondant aux côtés c-2, c-3 respectifs de ces pièces de façon à créer deux trajectoires de coupe parfaitement superposées pour ces deux segments de coupe. Ainsi, l'outil de coupe passera deux fois entre les deux pièces p-2, p-3 mais exactement sur la même trajectoire.To avoid this problem, the method according to the invention provides for automatically modifying the cutting paths of the two parts p-2 and p-3 by modifying the cutting segments corresponding to the respective sides c-2, c-3 of these pieces to create two perfectly overlapping cutting paths for these two cutting segments. Thus, the cutting tool will pass twice between the two parts p-2, p-3 but on exactly the same path.

La première étape du procédé selon l'invention consiste à identifier de façon automatique dans le placement P toutes les paires de segments de coupe appartenant à deux pièces différentes à découper dans le matériau et pour lesquels une condition de distance maximale entre ces segments de coupe est respectée.The first step of the method according to the invention consists in automatically identifying in the placement P all the pairs of cutting segments belonging to two different pieces to be cut in the material and for which a maximum distance condition between these cutting segments is respected.

Cette première étape est réalisée en dilatant chaque pièce du placement de la distance maximale et d'effectuer l'intersection avec les autres pièces du placement pour déterminer lesquelles vérifient la condition de distance maximale.This first step is accomplished by expanding each piece of the placement to the maximum distance and intersecting with the other pieces in the placement to determine which ones meet the maximum distance condition.

La figure 3 illustre un exemple de mise en œuvre de cette première étape pour deux pièces p-i et p-j du placement (schéma (A)). Pour des raisons de clarté, ces pièces ont été représentées ici avec un contour circulaire. Bien entendu, le principe de dilation décrit ci-après s'adapte à des pièces au contour polygonal.The figure 3 illustrates an example of implementation of this first step for two parts pi and pj of the placement (diagram (A)). For reasons of clarity, these parts have been shown here with a circular outline. Of course, the dilation principle described below is suitable for parts with a polygonal outline.

Dans une première sous-étape, l'une des deux pièces (la pièce p-i sur l'exemple du schéma (B)) est dilatée d'une valeur prédéterminée d correspondant à la distance maximale (par exemple 1mm). En pratique, cette dilatation correspond à une expansion du polygone formé par les segments de coupe de pièce p-i et permet d'obtenir une première pièce dilatée p'-i.In a first sub-step, one of the two parts (the part p-i on the example of diagram (B)) is expanded by a predetermined value d corresponding to the maximum distance (for example 1mm). In practice, this expansion corresponds to an expansion of the polygon formed by the part cutting segments p-i and makes it possible to obtain a first expanded part p'-i.

Dans une deuxième sous-étape (schéma (C) de la figure 3), on identifie l'intersection géométrique entre la première pièce dilatée p'-i et la seconde pièce p-j (plus précisément les segments de coupe associés à cette seconde pièce). Ici, cette intersection est représentée par l'arc de cercle s-j.In a second sub-step (diagram (C) of the figure 3 ), we identify the geometric intersection between the first expanded part p'-i and the second part pj (more precisely the cutting segments associated with this second part). Here, this intersection is represented by the arc of a circle sj.

Dans une troisième sous-étape, la seconde pièce (la pièce p-j sur l'exemple du schéma (D)) est à son tour dilatée de la valeur prédéterminée d de façon à obtenir une seconde pièce dilatée p'-j.In a third sub-step, the second part (the part p-j on the example of diagram (D)) is in turn expanded by the predetermined value d so as to obtain a second expanded part p'-j.

L'intersection géométrique entre la seconde pièce dilatée p'-j et la première pièce p-i est alors identifiée. Sur l'exemple de la figure 3, cette intersection donne un arc de cercle s-i.The geometric intersection between the second expanded part p'-j and the first part pi is then identified. On the example of figure 3 , this intersection gives an arc of a circle if.

Enfin, la dernière sous-étape prévoit de réunir les deux intersections s-i, s-j ainsi identifiées de façon à obtenir deux segments de coupe appartenant à deux pièces p-i, p-j différentes à découper et pour lesquels la condition de distance maximale d entre ces segments de coupe est respectée.Finally, the last sub-step provides for bringing together the two intersections si, sj thus identified so as to obtain two cutting segments belonging to two different parts pi, pj to be cut and for which the condition of maximum distance d between these cutting segments is respected.

Cette première étape du procédé consistant à identifier deux segments de coupe pour lesquels une condition de distance maximale entre ces segments de coupe est respectée est réalisée pour l'ensemble des pièces p du placement P.This first step of the method consisting in identifying two cutting segments for which a condition of maximum distance between these cutting segments is respected is carried out for all the parts p of the placement P.

La deuxième étape du procédé selon l'invention consiste à vérifier de façon automatique que les deux segments de coupe préalablement identifiés sont bien situés l'un en face de l'autre.The second step of the method according to the invention consists in automatically checking that the two previously identified cutting segments are indeed located one opposite the other.

En effet, comme illustré sur la figure 4A, il est possible que l'algorithme développé au cours de la première étape du procédé identifie dans le placement deux pièces p-i, p-j pour lesquelles deux segments de coupe respectifs, c-i et c-j, sont espacés l'un de l'autre d'une distance inférieure à la distance maximale prédéterminée. Or, comme bien visible sur cette figure 4A, ces deux segments de coupe c-i, c-j ne sont pas situés l'un en face de l'autre, de sorte qu'on ne peut pas établir une trajectoire de coupe commune pour ces segments de coupe.Indeed, as illustrated on figure 4A , it is possible that the algorithm developed during the first step of the method identifies in the placement two parts pi, pj for which two respective cutting segments, ci and cj, are spaced from each other by a distance less than the predetermined maximum distance. However, as clearly visible on this figure 4A , these two cutting segments ci, cj are not located opposite each other, so that a common cutting path cannot be established for these cutting segments.

De même, comme illustré sur la figure 4B, il est également possible que l'algorithme de la première étape du procédé identifie deux pièces p-k, p-l pour lesquelles deux segments de coupe respectifs, c-k et c-l, sont espacés l'un de l'autre d'une distance inférieure à la distance maximale prédéterminée alors que l'un de ces segments de coupe (ici le segment c-k) est plus long que l'autre. Dans cette situation, l'étape d'établissement d'une trajectoire de coupe commune pour ces deux segments de coupe risque de poser un problème.Likewise, as illustrated on figure 4B , it is also possible that the algorithm of the first step of the method identifies two parts pk, pl for which two respective cutting segments, ck and cl, are spaced from each other by a distance less than the distance maximum predetermined while one of these cutting segments (here the segment ck) is longer than the other. In this situation, the step of establishing a common cutting path for these two cutting segments may pose a problem.

Pour éviter ces écueils, la deuxième étape du procédé selon l'invention prévoit de rajouter une contrainte aux paires de segments de coupe préalablement identifiées pour s'assurer de la possibilité d'établir une trajectoire de coupe commune.To avoid these pitfalls, the second step of the method according to the invention provides for adding a constraint to the pairs of previously identified cutting segments to ensure the possibility of establishing a common cutting trajectory.

A cet effet, cette deuxième étape comprend, pour chaque paire de segments de coupe identifiée, une première sous-étape consistant à réaliser une projection de chaque segment de coupe sur l'autre segment de coupe (ou plutôt sur la droite qui porte cet autre segment de coupe) selon une direction orthogonale au segment de coupe d'arrivée.To this end, this second step comprises, for each pair of identified cutting segments, a first sub-step consisting in carrying out a projection of each cutting segment on the other cutting segment (or rather on the line which bears this other cutting segment) in a direction orthogonal to the arrival cutting segment.

Un exemple est illustré sur la figure 5A avec deux segments de coupe c-i, c-j pour lesquels il a été préalablement vérifié que la condition de distance maximale a été respectée.An example is shown on figure 5A with two cutting segments ci, cj for which it has been previously verified that the maximum distance condition has been respected.

Les deux extrémités c-i-1, c-i-2 du segment de coupe c-i sont projetées orthogonalement sur la droite qui porte le segment de coupe c-j. Ces projections croisent la droite qui porte le segment de coupe c-j en un point A pour l'extrémité c-i-1, et en un point B pour l'autre extrémité c-i-2, ces points d'intersection pouvant se situer sur le segment de coupe c-j (cas du point A) ou dehors de ce segments de coupe (cas du point B).The two ends c-i-1, c-i-2 of the cutting segment c-i are projected orthogonally on the line which bears the cutting segment c-j. These projections intersect the straight line which carries the section segment cj at a point A for the end ci-1, and at a point B for the other end ci-2, these points of intersection possibly being on the segment of cut cj (case of point A) or outside this cut segments (case of point B).

De même, les deux extrémités c-j-1, c-j-2 du segment de coupe c-j sont projetées orthogonalement sur la droite qui porte le segment de coupe c-i. Ces projections croisent la droite qui porte le segment de coupe c-i en un point C (ici situé en dehors du segment de coupe c-i) pour l'extrémité c-j-1, et en un point D (ici situé sur le segment de coupe c-i) pour l'autre extrémité c-j-2.Likewise, the two ends cj-1, cj-2 of the cutting segment cj are projected orthogonally on the line which bears the cutting segment ci. These projections cross the line which carries the section segment ci at a point C (here located outside the section segment ci) for the end cj-1, and at a point D (here located on the section segment ci) for the other end cj-2.

Une deuxième sous-étape consiste à effectuer la projection de chaque segment de coupe sur l'autre segment de coupe (ou plutôt sur la droite qui porte cet autre segment de coupe) selon une direction orthogonale au segment de coupe projeté.A second sub-step consists in carrying out the projection of each section of section on the other section of section (or rather on the line which bears this other section of section) in a direction orthogonal to the projected section of section.

Ainsi, sur l'exemple illustré par la figure 5B, les deux extrémités c-i-1, c-i-2 du segment de coupe c-i sont projetées sur la droite qui porte le segment de coupe c-j selon une direction orthogonale au segment de coupe c-i. Ces projections croisent la droite qui porte le segment de coupe c-j en un point E (pour l'extrémité c-i-1) et en un point F (pour l'extrémité c-i-2).Thus, on the example illustrated by figure 5B , the two ends ci-1, ci-2 of the cutting segment ci are projected onto the straight line which bears the cutting segment cj in a direction orthogonal to the cutting segment ci. These projections cross the straight line which carries the segment of section cj at a point E (for the end ci-1) and at a point F (for the end ci-2).

De même, les deux extrémités c-j-1, c-j-2 du segment de coupe c-j sont projetées sur la droite qui porte le segment de coupe c-i selon une direction orthogonale au segment de coupe c-j. Ces projections croisent la droite qui porte le segment de coupe c-i en un point G (pour l'extrémité c-j-1) et en un point H (pour l'extrémité c-j-2).Likewise, the two ends c-j-1, c-j-2 of the cutting segment c-j are projected onto the line which carries the cutting segment c-i in a direction orthogonal to the cutting segment c-j. These projections intersect the line which carries the section segment c-i at a point G (for the end c-j-1) and at a point H (for the end c-j-2).

La dernière sous-étape consiste alors à réaliser l'union des projections ainsi effectuées et à supprimer les parties qui se trouvent en dehors des segments de coupe de façon à obtenir deux portions de segments de coupe situées l'une en face de l'autre.The last sub-step then consists in making the union of the projections thus carried out and in eliminating the parts which are outside the cutting segments so as to obtain two portions of cutting segments located one opposite the other. .

Dans l'exemple illustré par la figure 5C, cette union donne les deux portions de segment de coupe délimitées, pour le segment de coupe c-i, par les points c-i-1 et H, et pour le segment de coupe c-j, par les points A et c-j-2. On considère que ces deux portions de segment de coupe sont situées l'un en face de l'autre.In the example illustrated by figure 5C , this union gives the two cut segment portions delimited, for the cutting segment ci, by the points ci-1 and H, and for the cutting segment cj, by the points A and cj-2. It is considered that these two portions of the section segment are located opposite each other.

La troisième étape du procédé selon l'invention consiste à vérifier l'absence d'autres segments de coupe entre les deux segments de coupe préalablement identifiés. Cette étape permet de s'assurer que les segments de coupe qui ont été identifiés sont bien situés du bon côté des pièces (c'est-à-dire qu'aucune partie des pièces ne se trouve entre les deux segments de coupe).The third step of the method according to the invention consists in verifying the absence of other cutting segments between the two previously identified cutting segments. This step ensures that the cut segments that have been identified are on the correct side of the parts (that is, no part of the parts is between the two cut segments).

Cette troisième étape s'effectue par un calcul d'intersections entre les deux pièces à découper. A cet effet, on vérifie si la zone entre les deux segments de coupe identifiés intersecte une pièce, et, dans l'affirmative, on vérifie si on est dans une zone de chevauchement entre les pièces pour savoir si la paire de segments de coupe est valide. Bien entendu, dans le cas où la zone entre les deux segments de coupe n'intersecte aucune autre pièce ou que les pièces se chevauchent à cet endroit, la paire de segments de coupe est valide et on passe à l'étape suivante du procédé.This third step is carried out by calculating the intersections between the two pieces to be cut. To this end, we check whether the area between the two identified cutting segments intersects a part, and, if so, we check whether we are in an overlapping area between the parts to know if the pair of cutting segments is valid. Of course, in the case where the area between the two cutting segments does not intersect any other part or the parts overlap at this location, the pair of cutting segments is valid and the next step in the process is continued.

Un exemple de mise en œuvre de cette troisième étape pour deux pièces p-i, p-j est décrit ci-après en liaison avec les figures 6A à 6D.An example of the implementation of this third step for two parts pi, pj is described below in conjunction with the figures 6A to 6D .

Dans cet exemple, on considère que les deux pièces à découper p-i, p-j se chevauchent au niveau de leurs segments de coupe respectifs c-i, c-j (ce chevauchement étant de très faibles dimensions inférieures à 0,1mm).In this example, it is considered that the two pieces to be cut p-i, p-j overlap at the level of their respective cutting segments c-i, c-j (this overlap being of very small dimensions less than 0.1 mm).

La première sous-étape consiste à effectuer un calcul des intersections I1, I2 entre les deux pièces (ici au nombre de deux - cf. figure 6A). Dans une deuxième sous-étape, on construit un quadrilatère Q1 formé par la paire de segments de coupe c-i, c-j (cf. figure 6B). Dans une troisième sous-étape, on effectue une intersection de ce quadrilatère Q1 avec les deux pièces p-i, p-j (cette intersection donne comme résultat le polygone T1 - cf. figure 6C).The first sub-step consists in carrying out a calculation of the intersections I1, I2 between the two parts (here two in number - cf. figure 6A ). In a second sub-step, we construct a quadrilateral Q1 formed by the pair of cutting segments ci, cj (cf. figure 6B ). In a third sub-step, one carries out an intersection of this quadrilateral Q1 with the two parts pi, pj (this intersection gives as result the polygon T1 - cf. figure 6C ).

Enfin, dans une quatrième et dernière sous-étape, on effectue une soustraction entre le polygone T1 et les intersections I1 et I2 (figure 6D). Si le résultat de cette soustraction donne un ensemble vide (comme sur l'exemple de la figure 6D), on en déduit qu'aucune trajectoire de coupe n'est présente entre les deux segments de coupe c-i, c-j et cette paire de segments de coupe est déclarée valide au regard de ce critère.Finally, in a fourth and last sub-step, one carries out a subtraction between the polygon T1 and the intersections I1 and I2 ( figure 6D ). If the result of this subtraction gives an empty set (as in the example of figure 6D ), it is deduced from this that no cutting path is present between the two cutting segments ci, cj and this pair of cutting segments is declared valid with regard to this criterion.

Une fois les segments de coupe identifiés et validés, le procédé selon l'invention prévoit de concaténer les segments de coupe qui sont adjacents entre eux pour former des trajectoires de coupe (composées de plusieurs segments de coupe adjacents), puis, au cours d'une quatrième étape, de calculer des trajectoires de coupe communes pour l'ensemble des segments de coupe.Once the cutting segments have been identified and validated, the method according to the invention provides for concatenating the cutting segments which are adjacent to each other to form cutting trajectories (composed of several adjacent cutting segments), then, during a fourth step, of calculating common cutting paths for all the cutting segments.

Un exemple de mise en œuvre de cette étape est détaillé ci-après en liaison avec les figures 7A à 7C. Sur ces figures, sont représentées deux trajectoires de coupe 1, 2 (formées chacune de plusieurs segments de coupe adjacents et concaténés) qui ont été identifiées et validées selon les étapes du procédé précédemment décrites. Bien entendu, le même procédé est utilisé lorsque la trajectoire de coupe n'est formée que d'un seul segment de coupe.An example of the implementation of this step is detailed below in connection with the figures 7A to 7C . In these figures are shown two cutting paths 1, 2 (each formed of several adjacent and concatenated cutting segments) which have been identified and validated according to the steps of the method described above. Of course, the same method is used when the cutting path is formed by only one cutting segment.

Plus précisément, la trajectoire de coupe 1 est ici formée de trois segments de coupe reliés entre eux, à savoir les segments 10 à 12, tandis que la trajectoire de coupe 2 est formée de deux segments de coupe 20, 21. Les segments de coupe 10 à 12 sont délimités par les points A, B, C et D. De même, les segments de coupe 20, 21 sont délimités par les points E, F et G.More precisely, the cutting path 1 is here formed of three interconnected cutting segments, namely the segments 10 to 12, while the cutting path 2 is formed of two cutting segments 20, 21. The cutting segments 10 to 12 are delimited by points A, B, C and D. Likewise, the cutting segments 20, 21 are delimited by points E, F and G.

Chaque trajectoire de coupe 1, 2 est projetée sur l'autre trajectoire de coupe en conservant le même ratio de longueur pour chacun des segments de coupe 10-12, 20, 21 (voir la figure 7B).Each cutting path 1, 2 is projected onto the other cutting path keeping the same length ratio for each of the cutting segments 10-12, 20, 21 (see figure 7B ).

Ainsi, le segment de coupe 10 est projeté sur la trajectoire de coupe 2 avec la projection du point A en E et la projection du point B en B' (avec la longueur du segment [AB] divisée par celle de la trajectoire 1 qui est égale à la longueur du segment [EB'] divisée par celle de la trajectoire 2). De même, le segment 12 est projeté sur la trajectoire de coupe 2 avec la projection du point D en G et celle du point C en C' (avec la longueur du segment [CD] divisée par celle de la trajectoire 1 qui est égale à la longueur du segment [C'G] divisée par celle de la trajectoire 2).Thus, the cutting segment 10 is projected onto the cutting path 2 with the projection of point A at E and the projection of point B at B '(with the length of the segment [AB] divided by that of the path 1 which is equal to the length of the segment [EB '] divided by that of the trajectory 2). Likewise, segment 12 is projected onto cutting path 2 with the projection of point D in G and that of point C in C '(with the length of segment [CD] divided by that of path 1 which is equal to the length of the segment [C'G] divided by that of the trajectory 2).

De plus, le segment de coupe 20 de la trajectoire de coupe 2 est projeté sur la trajectoire de coupe 1 avec la projection du point E en A et la projection du point F en F' (la longueur du segment [EF] divisée par celle de la trajectoire 2 est égale à la longueur du segment [AF'] divisée par celle de la trajectoire 1). Enfin, le segment de coupe 21 est aussi projeté sur la trajectoire de coupe 1 avec la projection du point F en F' et la projection du point G en D (la longueur du segment [FG] divisée par celle de la trajectoire 2 est égale à la longueur du segment [F'D] divisée par celle de la trajectoire 1).In addition, the cut segment 20 of the cut path 2 is projected onto the cut path 1 with the projection of point E at A and the projection of point F at F '(the length of the segment [EF] divided by that of trajectory 2 is equal to the length of segment [AF '] divided by that of trajectory 1). Finally, the cutting segment 21 is also projected on the cutting path 1 with the projection of the point F in F 'and the projection of the point G in D (the length of the segment [FG] divided by that of the path 2 is equal to the length of the segment [F'D] divided by that of the trajectory 1).

A partir des segments [AE], [BB'], [FF'], [CC'] et [DG] ainsi créés, cette étape prévoit de créer une trajectoire de coupe commune 30 à partir des points situés à égales distances des extrémités de ces segments (à savoir le point I pour le segment [AE], le point J pour le segment [BB'], le point K pour le segment [FF'], le point L pour le segment [CC'] et le point M pour le segment [DG]).From the segments [AE], [BB '], [FF'], [CC '] and [DG] thus created, this step provides for creating a common cutting path 30 from the points situated at equal distances from the ends. of these segments (namely point I for segment [AE], point J for segment [BB '], point K for segment [FF'], point L for segment [CC '] and point M for segment [DG]).

La dernière étape du procédé selon l'invention consiste en un raccordement de la trajectoire de coupe commune à la trajectoire de coupe des deux pièces à découper de façon à obtenir des trajectoires de coupe modifiées pour les deux pièces à découper.The last step of the method according to the invention consists in connecting the common cutting path to the cutting path of the two pieces to be cut so as to obtain modified cutting paths for the two pieces to be cut.

Cette étape de raccordement est réalisée pour essayer de conserver au maximum la forme des contours des pièces à découper. En fonction de la situation rencontrée, différents types de raccordement sont possibles, dont le raccordement par prolongation pour lequel un exemple de mise en œuvre est représenté sur la figure 8 et le raccordement rectiligne pour lequel un exemple de mise en œuvre est illustré sur la figure 9.This connecting step is carried out to try to keep as much as possible the shape of the contours of the parts to be cut. Depending on the situation encountered, different types of connection are possible, including connection by extension for which an example of implementation is shown on the figure 8 and the rectilinear connection for which an example of implementation is illustrated on the figure 9 .

Dans l'exemple d'un raccordement par prolongation de la figure 8, on a représenté la trajectoire de coupe commune 30 avec le point d'extrémité Pe de celle-ci, ainsi que le contour 32 de la pièce sur lequel la trajectoire de coupe est raccordée.In the example of a connection by extending the figure 8 , there is shown the common cutting path 30 with the end point Pe of the latter, as well as the contour 32 of the part to which the cutting path is connected.

Le contour 32 de la pièce sur lequel la trajectoire de coupe est raccordée est formé d'une pluralité de segments de coupe. Si l'on considère le point P1 comme étant le point d'extrémité du contour 32 ayant servi au calcul de la trajectoire de coupe commune 30, le contour 32 est ici formé des segments de coupe [P1P2], [P2P3], [P3P4], etc.The outline 32 of the part to which the cutting path is connected is formed of a plurality of cutting segments. If we consider the point P1 as being the end point of the contour 32 having served for the calculation of the common cutting path 30, the contour 32 is here formed of the cutting segments [P1P2], [P2P3], [P3P4 ], etc.

L'algorithme de mise en œuvre de cette étape de raccordement par prolongation prévoit de parcourir, à partir du point P1, chaque segment de coupe du contour 32 jusqu'à celui pour lequel la distance curviligne cumulée ne dépasse pas deux fois la distance maximale d définie à la première étape du procédé selon l'invention. Par « distance curviligne cumulée », on entend la distance suivant la courbe entre le point P1 et le segment de coupe considéré, c'est-à-dire la somme des longueurs des segments de coupe [P1P2], [P2P3], etc. jusqu'au segment de coupe considéré.The algorithm for implementing this step of connection by extension provides for traveling, from point P1, each section of the contour 32 to the one for which the cumulative curvilinear distance does not exceed twice the maximum distance d defined in the first step of the process according to the invention. By “cumulative curvilinear distance” is meant the distance along the curve between point P1 and the section segment considered, ie the sum of the lengths of the section segments [P1P2], [P2P3], etc. up to the cut segment considered.

Pour chacun de ces segments [P1P2], [P2P3], [P3P4], etc., l'étape de raccordement par prolongation met en œuvre successivement les sous-étapes suivantes.For each of these segments [P1P2], [P2P3], [P3P4], etc., the step of connection by extension successively implements the following sub-steps.

Au cours d'une première sous-étape, on vérifie le parallélisme entre le segment et la trajectoire de coupe commune. Si le segment est parallèle à la trajectoire de coupe commune, on passe au segment suivant.During a first sub-step, the parallelism between the segment and the common cutting path is checked. If the segment is parallel to the common cutting path, we move on to the next segment.

Au cours d'une deuxième sous-étape, on considère le point d'intersection entre le segment considéré et la trajectoire de coupe commune (ou leur prolongement respectif). Si ce point d'intersection est au-delà de l'extrémité du segment la plus éloigné de la trajectoire de coupe commune, on passe au segment suivant.During a second sub-step, the point of intersection between the segment considered and the common cutting path (or their respective extension) is considered. If this point of intersection is beyond the end of the segment furthest from the common cutting path, you move on to the next segment.

Sur l'exemple de la figure 8, soit I1, I2, I3 les intersections respectives entre les segments [P1P2], [P2P3], [P3P4] et la trajectoire de coupe commune 20. Ici, seuls les points I1 et I3 respectent bien la condition précitée (ce qui n'est pas le cas du point I2).On the example of figure 8 , let I1, I2, I3 be the respective intersections between the segments [P1P2], [P2P3], [P3P4] and the common cutting path 20. Here, only the points I1 and I3 fully comply with the aforementioned condition (which does not is not the case with point I2).

Pour le premier segment retenu à l'issue de la sous-étape précédente, la troisième sous-étape prévoit de comparer la distance entre le point d'intersection précédemment déterminé et le point d'extrémité Pe de la trajectoire de coupe commune avec un seuil prédéterminé correspondant à la distance maximale d définie à la première étape du procédé selon l'invention.For the first segment retained at the end of the previous sub-step, the third sub-step provides for comparing the distance between the previously determined point of intersection and the end point Pe of the common cutting path with a threshold predetermined corresponding to the maximum distance d defined in the first step of the method according to the invention.

Si cette distance entre le point d'intersection et le point d'extrémité Pe est supérieure à la distance maximale d, on passe au segment suivant. En revanche, dès que l'on obtient un segment pour lequel la distance entre le point d'intersection et le point d'extrémité Pe est inférieure ou égale à la distance maximale d, on conserve ce point d'intersection comme le point de raccordement entre la trajectoire de coupe commune et le contour de la pièce.If this distance between the point of intersection and the end point Pe is greater than the maximum distance d, we move on to the next segment. On the other hand, as soon as we obtain a segment for which the distance between the point of intersection and the end point Pe is less than or equal to the maximum distance d, we keep this point of intersection as the point of connection between the common cut path and the contour of the part.

De plus, si après avoir parcouru tous les segments du contour sans trouver de point d'intersection remplissant la condition précitée, le raccordement par prolongation ne peut pas être appliqué.Moreover, if after having traversed all the segments of the contour without finding an intersection point fulfilling the aforementioned condition, the connection by extension cannot be applied.

Dans l'exemple représenté sur la figure 8, le point d'intersection I1 entre le segment [P1P2] et la trajectoire de coupe commune est situé à une distance supérieure à la distance maximale d de l'extrémité Pe de la trajectoire de coupe commune 30. En revanche, la distance entre le point d'intersection I3 entre le segment [P2P3] et la trajectoire de coupe commune et le point Pe est ici inférieure à la distance d, de sorte que ce point I3 est conservé et défini comme étant le point de raccordement entre la trajectoire de coupe commune et le contour de la pièce.In the example shown on figure 8 , the point of intersection I1 between the segment [P1P2] and the common cutting path is located at a distance greater than the maximum distance d from the end Pe of the common cutting path 30. On the other hand, the distance between the point of intersection I3 between the segment [P2P3] and the common cutting path and the point Pe is here less than the distance d , so that this point I3 is kept and defined as being the point of connection between the cutting path joint and the outline of the room.

En liaison avec la figure 9, on décrira maintenant un exemple d'un autre type de raccordement, à savoir un raccordement rectiligne de la trajectoire de coupe commune.In conjunction with the figure 9 , we will now describe an example of another type of connection, namely a rectilinear connection of the common cutting path.

Sur cette figure, on a représenté la trajectoire de coupe commune 30 avec le point d'extrémité Pe de celle-ci, ainsi que le contour 32 de la pièce sur lequel la trajectoire de coupe est raccordée, ce dernier étant constitué des segments [P1P2], [P2P3], etc. (P1 étant le point d'extrémité du contour ayant servi au calcul de la trajectoire de coupe commune 30).In this figure, there is shown the common cutting path 30 with the end point Pe of the latter, as well as the contour 32 of the part to which the cutting path is connected, the latter consisting of segments [P1P2], [P2P3], etc. (P1 being the end point of the contour having been used for the calculation of the common cutting path 30).

Comme pour le raccordement par prolongation, l'algorithme de mise en œuvre de cette étape de raccordement rectiligne prévoit de parcourir, à partir du point P1, chaque segment de coupe du contour jusqu'à celui pour lequel la distance curviligne cumulée ne dépasse pas deux fois la distance maximale d définie à la première étape du procédé.As for the connection by extension, the algorithm for implementing this rectilinear connection step provides for traversing, from point P1, each section of the contour to the one for which the cumulative curvilinear distance does not exceed two times the maximum distance d defined in the first step of the process.

De plus, cet algorithme propose de vérifier que les raccordements appliqués n'engendrent pas de déviation des trajectoires de coupe des deux pièces à découper supérieure à un angle α prédéterminé (typiquement 20°).In addition, this algorithm proposes to check that the connections applied do not generate a deviation of the cutting paths of the two pieces to be cut greater than a predetermined angle α (typically 20 °).

Pour chacun de ces segments [P1P2], [P2P3], etc., l'étape de raccordement rectiligne met en œuvre successivement les sous-étapes suivantes.For each of these segments [P1P2], [P2P3], etc., the rectilinear connection step successively implements the following sub-steps.

Au cours d'une première sous-étape, on calcule l'ensemble des points I du segment considéré qui permettent d'avoir une déviation entre la trajectoire de coupe commune et le segment [PeI] qui soit inférieure à l'angle α. Pour cela, on calcule les deux droites Δ qui passent par le point Pe et qui forment respectivement un angle +α et -α avec la trajectoire de coupe commune 30 (seule une seule droite Δ vérifiant cette condition est représentée sur la figure 9). Les points qui remplissent la condition précitée sont les points du segment considéré qui se situent entre les deux droites Δ.During a first sub-step, all of the points I of the segment considered are calculated which make it possible to have a deviation between the common cutting path and the segment [PeI] which is less than the angle α. For this, we calculate the two straight lines Δ which pass through the point Pe and which respectively form an angle + α and -α with the common cutting path 30 (only a single straight line Δ satisfying this condition is shown on the figure 9 ). The points which fulfill the aforementioned condition are the points of the segment considered which lie between the two lines Δ.

Au cours d'une deuxième sous-étape, on calcule l'ensemble des points I du segment considéré qui permettent d'avoir une déviation entre le segment [PeI] et le segment considéré qui soit inférieure à l'angle α. Pour cela, on calcule l'unique point tel que cet angle soit égal à α en valeur absolue. Les points qui remplissent la condition précitée sont les points du segment considéré qui se situent au-delà de ce point dans le sens du contour.During a second sub-step, all the points I of the segment considered are calculated which make it possible to have a deviation between the segment [PeI] and the segment considered which is less than the angle α. For that, one calculates the single point such that this angle is equal to α in absolute value. The points which fulfill the aforementioned condition are the points of the segment considered which are situated beyond this point in the direction of the contour.

Enfin, au cours d'une troisième sous-étape, on réalise l'intersection des deux ensembles obtenus aux précédentes sous-étapes pour trouver l'ensemble des points qui remplissent les deux conditions en même temps. N'importe quel point appartenant à cet ensemble pouvant constituer le point de raccordement entre la trajectoire de coupe commune et le contour de la pièce, on choisit alors le premier point dans le sens du contour.Finally, during a third sub-step, the intersection of the two sets obtained in the previous sub-steps is carried out to find the set of points which meet the two conditions at the same time. Any point belonging to this set can constitute the point of connection between the cutting path common and the contour of the part, we then choose the first point in the direction of the contour.

Si après avoir parcouru tous les segments du contour sans trouver de point d'intersection remplissant la condition précitée, le raccordement rectiligne ne peut pas être appliqué.If after having traversed all the segments of the contour without finding an intersection point fulfilling the above condition, the rectilinear connection cannot be applied.

D'autres types de raccordement que ceux détaillés précédemment peuvent être envisagés. Par exemple, on pourra appliquer un raccordement rectiligne avec raccourcissement de la trajectoire de coupe commune. Ce type de raccordement s'applique plus particulièrement lorsqu'une trajectoire de coupe commune se termine sur un angle très aigu du contour d'une pièce. Dans ce cas, les deux types de raccordement précités ne sont pas utilisables. L'algorithme du raccordement avec raccourcissement est le même que celui du raccordement rectiligne, mais à la place de partir de l'extrémité de la trajectoire de coupe commune (point Pe), on prend comme point fixe l'extrémité de l'angle aigu formé par le contour de la pièce et on parcourt chaque segment de coupe du contour comme précédemment décrit.Other types of connection than those detailed previously can be envisaged. For example, it is possible to apply a rectilinear connection with shortening of the common cutting path. This type of blend is more particularly applicable when a common cutting path ends at a very acute angle to the contour of a part. In this case, the two aforementioned types of connection cannot be used. The algorithm for blending with shortening is the same as for straight blending, but instead of starting from the end of the common cutting path (point Pe), the end of the acute angle is taken as the fixed point formed by the contour of the part and each section of the contour is traversed as previously described.

Lorsque deux trajectoires de coupe commune doivent être raccordées l'une à l'autre et qu'elles se terminent près d'un angle d'une pièce, on peut prolonger ces trajectoires de coupe commune jusqu'à leur intersection (raccordement par prolongation de la trajectoire de coupe commune avec une autre trajectoire de coupe commune).When two common cut paths are to be connected to each other and they end near a corner of a part, these common cut paths can be extended to their intersection (join by extension of the common cut path with another common cut path).

Lorsque deux trajectoires de coupe commune sont parallèles (ou quasi-parallèles) entre elles, le type de raccordement précité ne s'applique pas et on peut à la place appliquer un raccordement rectiligne de la trajectoire de coupe commune avec une autre trajectoire de coupe commune. Avec ce type de raccordement, on prend comme point fixe l'extrémité d'une trajectoire de coupe commune et on parcourt les segments de l'autre trajectoire de coupe commune (on choisit le point fixe sur la trajectoire de coupe commune la plus proche des pièces pour éviter de couper le coin d'une pièce).When two common cutting paths are parallel (or quasi-parallel) to each other, the aforementioned type of connection does not apply and we can instead apply a rectilinear connection of the common cutting path with another common cutting path . With this type of connection, we take as a fixed point the end of a common cutting path and we traverse the segments of the other common cutting path (we choose the fixed point on the common cut path closest to the pieces to avoid cutting the corner of a piece).

Dans le cas où plusieurs types de raccordement sont possibles, il est important de préciser un ordre de priorité entre ces raccordements. Pour les types de raccordement précités, l'ordre de priorité retenu est le suivant : en premier lieu, on applique le raccordement par prolongation de la trajectoire de coupe commune, puis si nécessaire le raccordement rectiligne de la trajectoire de coupe commune, puis si nécessaire le raccordement avec raccourcissement de la trajectoire de coupe commune, puis si nécessaire le raccordement rectiligne avec raccourcissement de la trajectoire de coupe commune, puis si nécessaire le raccordement par prolongation de la trajectoire de coupe commune avec une autre trajectoire de coupe commune, et enfin si nécessaire le raccordement rectiligne de la trajectoire de coupe commune avec une autre trajectoire de coupe commune.If several types of connection are possible, it is important to specify an order of priority between these connections. For the aforementioned types of connection, the order of priority retained is as follows: first, the connection is applied by extending the common cutting path, then if necessary the connection straight line of the common cutting path, then if necessary the connection with shortening of the common cutting path, then if necessary the straight connection with shortening of the common cutting path, then if necessary the connection by extending the common cutting path with another common cutting path, and finally if necessary the rectilinear connection of the common cutting path with another common cutting path.

Claims (11)

  1. A method of automatically modifying the cutting paths for parts (p-1, p-2, ...) that are to be cut out from a flexible material by automatically moving a cutter tool along predetermined cutting paths, the cutting paths associated with each part being defined by a succession of cutting segments forming a polygon, the method comprising in succession:
    - a step of identifying two cutting segments (c-i, c-j) belonging to two different parts (p-i, p-j) for cutting out in the material and for which a maximum distance condition (d) between these cutting segments is satisfied;
    - a step of verifying that the two previously-identified cutting segments are situated facing each other by reciprocal orthogonal projection of the cutting segments onto each other;
    - a step of verifying that no other cutting segments lie between the two previously-identified cutting segments by computing intersections between the two parts for cutting out;
    - a step of computing a common cutting path (30) for the two previously-identified cutting segments; and
    - a step of connecting the common cutting path to the cutting paths of the two parts for cutting out so as to obtain modified cutting paths for the two parts for cutting out.
  2. A method according to claim 1, wherein the step of identifying two cutting segments comprises, in succession and for each part for cutting out:
    - expanding the polygon formed by the cutting segments of said part by a predetermined value in order to obtain a first expanded polygon;
    - identifying an intersection between the first expanded polygon and a polygon formed by the cutting segments of another part;
    - expanding the polygon formed by the cutting segments of the other part by the predetermined value in order to obtain a second expanded polygon;
    - identifying an intersection between the second expanded polygon and the polygon formed by the cutting segments of said part; and
    - uniting intersections in order to obtain cutting segments belonging to two different parts for cutting out and for which a maximum distance condition between these cutting segments is satisfied.
  3. A method according to claim 1 or claim 2, wherein the step of verifying that the previously-identified cutting segments are situated facing each other comprises:
    - reciprocally orthogonally projecting the cutting segments onto each other;
    - projecting each cutting segment onto the other cutting segment in a direction orthogonal to the projected cutting segment; and
    - uniting the projections as performed in this way in order to obtain two cutting segment portions situated facing each other.
  4. A method according to any one of claims 1 to 3, wherein the step of verifying that no other cutting segments lie between the two cutting segments comprises, in succession:
    - computing intersections between the two parts;
    - constructing a geometrical quadrilateral formed by the two cutting segments;
    - intersecting between the previously-constructed quadrilateral and the two parts for cutting out; and
    - subtracting the overlaps between the two parts for cutting out from the previously-constructed quadrilateral.
  5. A method according to claim 4, further comprising, when the subtraction of overlaps gives an empty set, indicating that no cutting path is present between the two cutting segments.
  6. A method according to any one of claims 1 to 5, wherein the step of computing a common cutting path for the two cutting segments comprises:
    - projecting each cutting segment onto the other cutting segment while conserving the same length ratio for each segment; and
    - creating a common cutting path by connecting together points situated at equal distances from the ends of the projections of the cutting segments.
  7. A method according to any one of claims 1 to 6, wherein the step of connecting the common cutting path to the cutting paths of two parts for cutting out comprises applying the following connections taken in succession until a functional connection is obtained: connection by extending the common cutting path, straight-line connection of the common cutting path, connection with shortening of the common cutting path, straight-line connection with shortening of the common cutting path, connection by extending the common cutting path with another common cutting path, straight-line connection of the common cutting path with another common cutting path.
  8. A method according to claim 7, further comprising verifying that the connections that are applied do not lead to the cutting paths of two parts for cutting out being deflected by more than a predetermined angle.
  9. The use of the method according to any one of claims 1 to 8 to modify automatically the cutting path for parts that are to be cut from a leather skin.
  10. A computer program including instructions for executing steps of the method according to any one of claims 1 to 8 for modifying the cutting paths of parts.
  11. A computer readable data medium storing a computer program including instructions for executing steps of the method according to any one of claims 1 to 8 for modifying the cutting paths of parts.
EP17822000.0A 2017-01-09 2017-12-14 A method for modifying the cutting path for cutting parts from a soft material Active EP3565909B1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FR1750173A FR3061669B1 (en) 2017-01-09 2017-01-09 METHOD OF MODIFYING THE CUTTING PATH OF WORKPIECES INTENDED TO BE CUTTED IN A FLEXIBLE MATERIAL
PCT/FR2017/053569 WO2018127637A1 (en) 2017-01-09 2017-12-14 Method for modifying the cutting trajectory for parts intended to be cut from a flexible material

Publications (2)

Publication Number Publication Date
EP3565909A1 EP3565909A1 (en) 2019-11-13
EP3565909B1 true EP3565909B1 (en) 2020-08-05

Family

ID=58645189

Family Applications (1)

Application Number Title Priority Date Filing Date
EP17822000.0A Active EP3565909B1 (en) 2017-01-09 2017-12-14 A method for modifying the cutting path for cutting parts from a soft material

Country Status (9)

Country Link
US (1) US10703004B2 (en)
EP (1) EP3565909B1 (en)
JP (1) JP6951447B2 (en)
CN (1) CN110291213B (en)
BR (1) BR112019013741A2 (en)
FR (1) FR3061669B1 (en)
MX (1) MX2019007780A (en)
PT (1) PT3565909T (en)
WO (1) WO2018127637A1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112488429B (en) * 2020-12-21 2021-07-23 广东工业大学 Two-dimensional irregular layout blanking method based on scanning line method

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3766813A (en) * 1971-08-05 1973-10-23 Gerber Garment Technology Inc Methods for cutting sharp corners and notches in layups of fabric and other sheet material
US4133234A (en) * 1977-04-22 1979-01-09 Gerber Garment Technology, Inc. Method and apparatus for cutting sheet material with improved accuracy
US4178820A (en) * 1977-04-22 1979-12-18 Gerber Garment Technology, Method and apparatus for cutting sheet material with improved accuracy
US4327615A (en) * 1980-05-05 1982-05-04 Gerber Garment Technology, Inc. Method and apparatus for cutting sheet material with preprocessed data
FR2548077B1 (en) * 1983-06-30 1987-03-06 Gerber Scient Inc APPARATUS FOR HELPING AN OPERATOR TO SOLVE PROBLEMS POSED BY FAULTS OF FABRICS
US6810779B2 (en) * 2001-03-16 2004-11-02 Vitaly J. Feldman Critical area preprocessing of numeric control data for cutting sheet material
US9008824B1 (en) * 2004-01-09 2015-04-14 John Bean Technologies Corporation Method and system for portioning workpieces using reference shape as a directly controlled characteristic
FR2896718B1 (en) * 2006-01-27 2008-03-07 Airbus France Sas METHOD FOR CUTTING A PANOPLIE OF PARTS
JP4633177B2 (en) * 2009-05-18 2011-02-16 有限会社ナムックス Method for adjusting projected image of cutting pattern and cutting apparatus
JP5662138B2 (en) * 2010-12-28 2015-01-28 株式会社島精機製作所 Sheet material cutting method and automatic cutting machine
JP5719603B2 (en) * 2011-01-14 2015-05-20 株式会社島精機製作所 Sheet material cutting method and automatic cutting machine
JP2012206237A (en) * 2011-03-30 2012-10-25 Brother Industries Ltd Cutting apparatus, cutting data processing device and program, and recording medium
JP6392616B2 (en) * 2014-10-02 2018-09-19 グラフテック株式会社 Graphic data generation apparatus and graphic data generation program
CN104822152B (en) * 2015-05-11 2018-05-01 苏州惠通天地信息科技有限公司 A kind of wireless sensor network weak fence coverage constructing method of object-oriented detection

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
None *

Also Published As

Publication number Publication date
CN110291213A (en) 2019-09-27
JP2020504021A (en) 2020-02-06
EP3565909A1 (en) 2019-11-13
US10703004B2 (en) 2020-07-07
FR3061669B1 (en) 2019-05-31
JP6951447B2 (en) 2021-10-20
US20200001488A1 (en) 2020-01-02
PT3565909T (en) 2020-09-16
WO2018127637A1 (en) 2018-07-12
MX2019007780A (en) 2019-11-05
FR3061669A1 (en) 2018-07-13
BR112019013741A2 (en) 2020-01-21
CN110291213B (en) 2021-08-24

Similar Documents

Publication Publication Date Title
CA3003368C (en) Method for manufacturing a blade preform, a blade and a nozzle segment by selective powder-bed fusion
EP2983851B1 (en) Method for manufacturing an asymmetric component using additive manufacturing
EP3565909B1 (en) A method for modifying the cutting path for cutting parts from a soft material
EP2075527B1 (en) Method for measuring by scanning the throat cross-sections of a turbomachine nozzle sector
EP2724201B1 (en) Adaptive machining method for smelted blades
EP3440521B1 (en) Method, program and device for optimization of machining programs
EP2409181B1 (en) Method for cutting a patch to be applied onto a curved substrate
FR2982785A1 (en) METHOD FOR OBTAINING AN OPHTHALMIC LENS
EP3717214A1 (en) Application head comprising a cutting system with two movable blades
EP3352031B1 (en) Method for determining the path of a milling tool for machining a workpiece before the finished step
EP4041991A1 (en) Method for the repair welding of an aircraft turbine engine blade
EP3264026B1 (en) Device for inspecting a weld seam and use of the device
FR3057188B1 (en) PROCESS FOR MACHINING A PIECE OF ELASTOMERIC MATERIAL BY TURNING
EP4004661A1 (en) Method and system for generating a cutting plan for a complex glass product
EP1290730B1 (en) Method for producing input/output permutation of several conductive strips with parallel branches of an integrated circuit and resulting circuit
FR3041777A1 (en) METHOD OF DETERMINING THE PATH OF A MACHINING TOOL
FR3053112A1 (en) METHOD FOR MEASURING A ROTATING ANGLE OF A TURBOMACHINE WHEEL BOLT
FR3141358A1 (en) METHOD FOR MANUFACTURING A BROOCH ELEMENT FOR BROOCHING A PART
FR3007312A1 (en) PLATE OR PIECE ASSEMBLY OBTAINED BY CUTTING A BLOCK OF METALLIC OR COMPOSITE MATERIAL.
FR3018910A1 (en) TOOL FOR MONITORING A DIMENSION OF A DASHBOARD OF A MONOBLOC AUBING DISK FOR AIRCRAFT TURBOMACHINE
FR2784920A1 (en) PROCESS FOR DETERMINING THE TRAJECTORY OF THE GROOVE TO BE MACHINED ON THE SLICE OF A GLASS INTENDED TO EQUIP A "SEMI-GLASS" TYPE GLASSES FRAME
FR2933891A1 (en) Squared oak timber sawing method for fabricating shook of barrel, involves sawing cut in back and forth in which precise position of timber is controlled all along operation, where sawing is carried out along validated parameters
FR3000692A1 (en) POSITIONING OF CUTTING BLADES ON A PRESS BUILDING

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: UNKNOWN

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20190620

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602017021338

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: C14B0005000000

Ipc: B26F0001380000

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

RIC1 Information provided on ipc code assigned before grant

Ipc: B26F 1/38 20060101AFI20200505BHEP

INTG Intention to grant announced

Effective date: 20200525

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

Free format text: NOT ENGLISH

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1298076

Country of ref document: AT

Kind code of ref document: T

Effective date: 20200815

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602017021338

Country of ref document: DE

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

Free format text: LANGUAGE OF EP DOCUMENT: FRENCH

REG Reference to a national code

Ref country code: PT

Ref legal event code: SC4A

Ref document number: 3565909

Country of ref document: PT

Date of ref document: 20200916

Kind code of ref document: T

Free format text: AVAILABILITY OF NATIONAL TRANSLATION

Effective date: 20200909

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

REG Reference to a national code

Ref country code: SK

Ref legal event code: T3

Ref document number: E 35744

Country of ref document: SK

Ref country code: NL

Ref legal event code: MP

Effective date: 20200805

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1298076

Country of ref document: AT

Kind code of ref document: T

Effective date: 20200805

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201106

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201105

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201105

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20201205

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602017021338

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed

Effective date: 20210507

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20201231

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20201214

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20201214

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20201231

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20201231

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20201231

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20211214

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20211214

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: IT

Payment date: 20221122

Year of fee payment: 6

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 602017021338

Country of ref document: DE

Representative=s name: CBDL PATENTANWAELTE GBR, DE

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230525

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200805

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: SK

Payment date: 20231128

Year of fee payment: 7

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: TR

Payment date: 20231201

Year of fee payment: 7

Ref country code: RO

Payment date: 20231206

Year of fee payment: 7

Ref country code: PT

Payment date: 20231122

Year of fee payment: 7

Ref country code: FR

Payment date: 20231122

Year of fee payment: 7

Ref country code: DE

Payment date: 20231121

Year of fee payment: 7

Ref country code: CZ

Payment date: 20231124

Year of fee payment: 7