EP0240569A1 - Method of forming compposite curved surface - Google Patents

Method of forming compposite curved surface Download PDF

Info

Publication number
EP0240569A1
EP0240569A1 EP86905416A EP86905416A EP0240569A1 EP 0240569 A1 EP0240569 A1 EP 0240569A1 EP 86905416 A EP86905416 A EP 86905416A EP 86905416 A EP86905416 A EP 86905416A EP 0240569 A1 EP0240569 A1 EP 0240569A1
Authority
EP
European Patent Office
Prior art keywords
intersection
line
curved surface
section
curves
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.)
Granted
Application number
EP86905416A
Other languages
German (de)
French (fr)
Other versions
EP0240569A4 (en
EP0240569B1 (en
Inventor
Masaki Seki
Norihisa Amano
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.)
Fanuc Corp
Original Assignee
Fanuc Corp
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 Fanuc Corp filed Critical Fanuc Corp
Publication of EP0240569A1 publication Critical patent/EP0240569A1/en
Publication of EP0240569A4 publication Critical patent/EP0240569A4/en
Application granted granted Critical
Publication of EP0240569B1 publication Critical patent/EP0240569B1/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B19/00Programme-control systems
    • G05B19/02Programme-control systems electric
    • G05B19/18Numerical control [NC], i.e. automatically operating machines, in particular machine tools, e.g. in a manufacturing environment, so as to execute positioning, movement or co-ordinated operations by means of programme data in numerical form
    • G05B19/402Numerical control [NC], i.e. automatically operating machines, in particular machine tools, e.g. in a manufacturing environment, so as to execute positioning, movement or co-ordinated operations by means of programme data in numerical form characterised by control arrangements for positioning, e.g. centring a tool relative to a hole in the workpiece, additional detection means to correct position
    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B19/00Programme-control systems
    • G05B19/02Programme-control systems electric
    • G05B19/18Numerical control [NC], i.e. automatically operating machines, in particular machine tools, e.g. in a manufacturing environment, so as to execute positioning, movement or co-ordinated operations by means of programme data in numerical form
    • G05B19/41Numerical control [NC], i.e. automatically operating machines, in particular machine tools, e.g. in a manufacturing environment, so as to execute positioning, movement or co-ordinated operations by means of programme data in numerical form characterised by interpolation, e.g. the computation of intermediate points between programmed end points to define the path to be followed and the rate of travel along that path
    • GPHYSICS
    • G05CONTROLLING; REGULATING
    • G05BCONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B2219/00Program-control systems
    • G05B2219/30Nc systems
    • G05B2219/35Nc in input of data, input till input file format
    • G05B2219/35151Modeling geometric, generation or forming of curved surface

Definitions

  • This invention relates to a method of generating a complex curved surface and, more particularly, to a method of generating a complex curved surface by combining at least two three-dimensional curved surfaces.
  • a curved surface of a three-dimensional metal mold or the like on a design drawing is generally expressed by a plurality of section curves, but no profile data is shown for the shape of the area lying-between a certain section curve and the next adjacent section curve.
  • machining it is essential that machining be carried out so as to smoothly connect these two section curves despite the fact that the profile between them is not given. In other words, this means that machining must be performed by generating the curved surface between the two section curves from such data as that indicative of the section curves, storing on an NC tape the data concerning the generated curved surface, and carrying out machining in accordance with commands from the NC tape.
  • This proposed method of creating complex curved surfaces includes the following steps, with reference being had to Fig. 8:
  • the section curves 13a, 13b are obtained as sets of discrete points on the respective three-dimensional curves surfaces 12a, 12b, and the section curves 13a, 13b are specified by obtaining points over the entire range of these three-dimensional curved surfaces.
  • the section curve 13a is specified by discretely obtaining all points from the end point Al to the end point A2;
  • the section curve 13b is specified by discretely obtaining all points from the end point Bl to the end point B2.
  • the segment from CR i to end point A2 on the section curve 13a and the segment from CR i to end point B l on the section curve 13b do not form a complex curved surface but are necessary merely for the purpose of obtaining the point of intersection CR . , which can be found even if section curves are not obtained over the entire ranges mentioned above.
  • a problem with the proposed method is that a considerable period of time is required for processing since unnecessary segments of the section curves are obtained.
  • an object of the present invention is to provide a complex curved surface creation method in which it suffices to obtain only section curves within predetermined ranges necessary for generating a complex curved surface, thereby shortening processing time.
  • the present invention relates to a method of creating a complex curved surface by combining at least two three-dimensional curved surfaces.
  • the method of creating a complex curved surface includes a step of inputting data for specifying each of the three-dimensional curved surfaces, and inputting, for every three-dimensional curved surface, data specifying one line of intersection on a predetermined plane, a rule for specifying a number of lines of intersection on the predetermined plane on the basis of the first-mentioned line of intersection, and a range for obtaining a section curve of each of the three-dimensional curved surfaces, which section curve is obtained when the three-dimensional curved surface is cut by a predetermined section, a step of obtaining first and second section curves in the abovementioned ranges when the first and second three-dimensional curved surfaces are cut by a section whose line of intersection with the predetermined plane is an i-th line of intersection among the number of lines of intersection, a step of obtaining a point of intersection between the two section curves, and a step of adopting a set of first and second section curve segments, having the point of intersection as a boundary, as a section curve SC i
  • Fig. 1 is a view for describing the general features of the present invention.
  • Numeral 11 denotes a complex curved surface.
  • Numerals 12a, 12b denote first and second curved surfaces constituting the complex curved surface.
  • Numerals 13a', 13b' designate partial section curves obtained when the first and second curved surfaces are cut by a section 13 perpendicular to the XY plane.
  • CL i designates a line of intersection between the XY plane and the abovementioned section, and CR i a point of intersection between the section curve 13a' and section curve 13b'.
  • a 1 - A 2 1 is a range on the curved surface of section curve 13a'
  • B 1 ' - B2 is a range on the curved surface of section curve 13b'
  • SCR1 is a range of the section curve 13a' on the line of intersection CL i
  • SCR2 is a range of the section curve 13b' on the line of intersection CL.
  • the range SCRl is a 1 % - a 2 % and the range SCR2 is b 1 % - b 2 %, where the starting point P s and end point p e of the line of intersection CL. are 0% and 100%, respectively.
  • Fig. 2 is a block diagram of an automatic programming apparatus for practicing the method of the present invention.
  • numeral 101 denotes a keyboard for data input, 102 a processor, 103 a ROM storing a control program, 104 and RAM, and 105 a working memory.
  • Numeral 106 designates a curved surface memory for storing curved surface data indicative of a generated complex curved surface, as well as NC program data for curved surface machining, 107 an output unit for outputting curved surface data indicative of a generated complex curved surface, or NC program data for curved surface machining, to an external storage medium 108 such as a paper tape or magnetic tape, 109 an address bus, and 110 a data bus.
  • Each of the three-dimensional curved surfaces 201a - 201c is specified by two operating curves DRCl, DRC2 and two base curves BSC1, BSC2, etc. Each of the three-dimensional curved surfaces is specified by entering these curve data and the like.
  • data specifying the first line of intersection CL 1 as well as the distance between two adjacent lines of intersection (either the distance along the X axis or the distance along the Y axis will suffice), are inputted.
  • data are inputted specifying the first line of intersection CL1
  • the distance d between two mutually adjacent lines of intersection is also inputted.
  • the lines of intersection shown in Fig. 5(A) and the rule are inputted, the three-dimensional curved surfaces 201a - 201c are cut by a predetermined section 202 i [see Fig. 4(B)] specified by the line of intersection and the rule.
  • the section curves that result are SCli, SC 2i , SC 3i , ... and so on.
  • step (c) When the line of intersection on the XY plane and the rule have been inputted, a range for determining a section curve is inputted for each three-dimensional curved surface. It should be noted that when the starting point and end point of the line of intersection specified in step (b) are the 0% position and 100% position, respectively, the ranges for determining the section curves are specified by designating the percentage ranges on the line of intersection.
  • L c (j) express an intermediate section curve containing a j-th dividing point on the base curve BSCl of the created three-dimensional curved surface
  • a quadrilateral bounded by curves L c (j), L c (j+1), L r ( i ) and L r (i+1) shall be referred to as a "patch" P T (i, j).
  • the four vertices Ql, Q2, Q3, Q4 of the patch PT (i, j) are generated by the above-described curved surface creation processing and are stored in the curve surface memory 106.
  • processing for creating a complex curved surface begins, as follows:
  • the coordinates of points on the j-th three-dimensional curved surface that correspond to all of the points of intersection determined are found through the foregoing procedure and these coordinates are stored in the curved surface memory 106. This will provide a section curve SC ji [see Fig. 4(b)] obtained when the j-th three-dimensional curved surface is cut by a section corresponding to the i-th line of intersection CL.
  • step (k) If the section curves [SC li , SC 2i , SC 3i ,... in Figs. 4(C)] within the designated ranges of all three-dimensional curved surfaces have not been obtained, the operation j+1 ⁇ j is performed and the processing from step (h) onward is repeated.
  • step (p) If section curves corresponding to all lines of intersection have not been obtained, the operation i+1 ⁇ i is performed and processing from step (f) onward is repeated.
  • the processing for creating the complex curved surface ends. Thereafter, the generated curved surface data are used to create e.g. NC data for curved surface machining.
  • ranges required for curved surface generation are predetermined along respective section curves, section curves are obtained within these ranges, and both section curves are used to obtain a point of intersection constituting an intersecting portion.

Landscapes

  • Engineering & Computer Science (AREA)
  • Human Computer Interaction (AREA)
  • Manufacturing & Machinery (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Automation & Control Theory (AREA)
  • Computing Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Numerical Control (AREA)

Abstract

This method comprises the steps of: inputting data for specifying three-dimensionally curved surfaces (12a, 12b), both of which specify a composite curved surface (11); inputting data which specify one line of intersection (CLi) on an X-Y plane (10) and a rule for specifying a large number of lines of intersection on the X-Y plane on the basis of said line of intersection (CLi); inputting ranges (SCR1, SCR2) for determining sectional curves of each three-dimensionally curved surface (12a, 12b) as cut in a predetermined section for every three-dimensionally curved surface; getting first and second sectional curves (13a', 13b') within the ranges (SCR1, SCR2) respectively when the first and second three-dimensionally curved surfaces (12a, 12b) are cut at the section including the ith line of intersection (CLi) which is the line of intersection with the X-Y plane; determining the point of intersection (CRi) of both sectional curves (13a', 13b'); and forming a composite curved surface (11) with the aggregate of the sectional curves by using the aggregate of the portions in the first and second sectional curves (A1 ~ CRi, CRi - B2) having the point of intersection (CRi) as a boundary, as the sectional curves of the composite curved surface (11).

Description

    Technical Field
  • This invention relates to a method of generating a complex curved surface and, more particularly, to a method of generating a complex curved surface by combining at least two three-dimensional curved surfaces.
  • Background Art
  • A curved surface of a three-dimensional metal mold or the like on a design drawing is generally expressed by a plurality of section curves, but no profile data is shown for the shape of the area lying-between a certain section curve and the next adjacent section curve. In numerically controlled machining it is essential that machining be carried out so as to smoothly connect these two section curves despite the fact that the profile between them is not given. In other words, this means that machining must be performed by generating the curved surface between the two section curves from such data as that indicative of the section curves, storing on an NC tape the data concerning the generated curved surface, and carrying out machining in accordance with commands from the NC tape. To this end, there has been developed and put into practical use a method comprising generating a plurality of intermediate sections in accordance with predetermined rules from data specifying several sections and section curves of a three-dimensional curved body, finding a section curve (intermediate section curve) on the curved body based on the intermediate sections, and generating a curved surface of the-three-dimensional body based on the plurality of generated intermediate section curves. (For example, see U.S.P. 4,491,906). This method is useful in generating a smooth curved surface from section data.
  • Depending upon machining, there are cases where it is necessary to machine a complex curved surface obtained by combining two or more three-dimensional curved surfaces, or in other words, to create a complex curved surface. However, it is not possible with the prior art to create a complex curved surface in a simple manner by combining these three-dimensional curved surfaces using the data indicative of each three-dimensional curved surface. Accordingly, the applicant has proposed in Japanese Patent Application No. 60-39445 (corresponding to PCT/JP86/00100) a novel method of creating complex curved surfaces.
  • This proposed method of creating complex curved surfaces includes the following steps, with reference being had to Fig. 8:
    • (a) inputting data in advance for specifying first and second three-dimensional curved surfaces 12a, 12b constituting a complex curved surface 11;
    • (b) inputting data specifying one line of intersection CL. on a predetermined plane (e.g. the X-Y plane) 10 as well as a rule for specifying a number of lines of intersection on the X-Y plane on the basis of said line of intersection;
    • (c) finding first and second section curves 13a, 13b obtained when the first and second three-dimensional curved surfaces 12a, 12b are cut by a section which has the i-th line of intersection CL., among the number of lines of intersection, as its line of intersection with the X-Y plane;
    • (d) obtaining a point of intersection CRi between the two section curves 13a, 13b; and
    • (e) generating the complex curved surface 11 by adopting a set of the points of intersection CRi (i = 1, 2, ...) corresponding to the lines of intersection CLi (i = 1, 2, ...) as an intersection CRL between the first and second three-dimensional curved surfaces 12a, 12b.
  • The section curves 13a, 13b are obtained as sets of discrete points on the respective three- dimensional curves surfaces 12a, 12b, and the section curves 13a, 13b are specified by obtaining points over the entire range of these three-dimensional curved surfaces. In other words, for the first three-dimensional curved surface 12a, the section curve 13a is specified by discretely obtaining all points from the end point Al to the end point A2; for the second three-dimensional curved surface 12b, the section curve 13b is specified by discretely obtaining all points from the end point Bl to the end point B2.
  • Thus, with the proposed method, the section curves 13a, 13b are obtained over the entire range (between Al and A2 and between Bl and B2) of the respective three-dimensional curved surfaces, the point of intersection CRi is found by using the section curves obtained, and an intersection is formed by similarly obtaining a set of obtained points of intersection CRi (i = 1, 2, ...).
  • However, the segment from CRi to end point A2 on the section curve 13a and the segment from CRi to end point Bl on the section curve 13b do not form a complex curved surface but are necessary merely for the purpose of obtaining the point of intersection CR., which can be found even if section curves are not obtained over the entire ranges mentioned above.
  • In other words, a problem with the proposed method is that a considerable period of time is required for processing since unnecessary segments of the section curves are obtained.
  • Accordingly, an object of the present invention is to provide a complex curved surface creation method in which it suffices to obtain only section curves within predetermined ranges necessary for generating a complex curved surface, thereby shortening processing time.
  • Disclosure of the Invention
  • The present invention relates to a method of creating a complex curved surface by combining at least two three-dimensional curved surfaces.
  • The method of creating a complex curved surface includes a step of inputting data for specifying each of the three-dimensional curved surfaces, and inputting, for every three-dimensional curved surface, data specifying one line of intersection on a predetermined plane, a rule for specifying a number of lines of intersection on the predetermined plane on the basis of the first-mentioned line of intersection, and a range for obtaining a section curve of each of the three-dimensional curved surfaces, which section curve is obtained when the three-dimensional curved surface is cut by a predetermined section, a step of obtaining first and second section curves in the abovementioned ranges when the first and second three-dimensional curved surfaces are cut by a section whose line of intersection with the predetermined plane is an i-th line of intersection among the number of lines of intersection, a step of obtaining a point of intersection between the two section curves, and a step of adopting a set of first and second section curve segments, having the point of intersection as a boundary, as a section curve SCi of the complex curved surface, and generating the complex curved surface by sets of these section curves SCi (i = 1, 2, ...).
  • Brief Description of the Drawings
    • Fig. 1 is a view for describing the general features of the present invention;
    • Fig. 2 is a block diagram of an apparatus for practicing the present invention;
    • Fig. 3 is a flowchart of processing according to the present invention;
    • Figs. 4 through 7 are views for describing complex curved surface creation processing; and
    • 'Fig. 8 is a view for describing a curved surface creation method already proposed.
    Best Mode for Carrying Out the Invention
  • Fig. 1 is a view for describing the general features of the present invention.
  • Numeral 11 denotes a complex curved surface. Numerals 12a, 12b denote first and second curved surfaces constituting the complex curved surface. Numerals 13a', 13b' designate partial section curves obtained when the first and second curved surfaces are cut by a section 13 perpendicular to the XY plane. CLi designates a line of intersection between the XY plane and the abovementioned section, and CRi a point of intersection between the section curve 13a' and section curve 13b'. A1 - A2 1 is a range on the curved surface of section curve 13a', B1' - B2 is a range on the curved surface of section curve 13b', SCR1 is a range of the section curve 13a' on the line of intersection CLi, and SCR2 is a range of the section curve 13b' on the line of intersection CL.
  • The range SCRl is a1% - a2% and the range SCR2 is b1% - b2%, where the starting point Ps and end point pe of the line of intersection CL. are 0% and 100%, respectively.
  • The point of intersection CRi can be determined even if the section curves are not obtained over the entire ranges of the respective three-dimensional curved surfaces. Accordingly, in the present invention, the ranges SCRl, SCR2 necessary for curved surface creation are determined beforehand for every curved surface, the section curves 13a', 13b' are obtained within these ranges, the point of intersection CRi is found using both of these section curves 13a', 13b', and an intersection CRL is formed of a set of similarly obtained points of intersction CRi (i = 1, 2, ...).
  • Fig. 2 is a block diagram of an automatic programming apparatus for practicing the method of the present invention. In Fig. 2, numeral 101 denotes a keyboard for data input, 102 a processor, 103 a ROM storing a control program, 104 and RAM, and 105 a working memory. Numeral 106 designates a curved surface memory for storing curved surface data indicative of a generated complex curved surface, as well as NC program data for curved surface machining, 107 an output unit for outputting curved surface data indicative of a generated complex curved surface, or NC program data for curved surface machining, to an external storage medium 108 such as a paper tape or magnetic tape, 109 an address bus, and 110 a data bus.
  • A method of creating a complex curved surface in accordance with the present invention will now be described in accordance with the flowchart of Fig. 3.
  • (a) First, data are entered from the keyboard 101 specifying a first three-dimensional curved surface 201a, a second three-dimensional curved surface 201b, a third three-dimensional curved surface 201c ... constituting a complex curved surface 201 [see (A) of Fig. 4J. In addition, the starting curved surface (assumed to be the first three-dimensional curved surface) is designated as well as the order in which the curved surfaces are combined (the order is assumed here to be the first curved surface, the second curved surface, the third curved surface,..., and so on), this being necessary in generating the complex curved surface. These inputted data are stored in the RAM 104 (Fig. 2). Each of the three-dimensional curved surfaces 201a - 201c is specified by two operating curves DRCl, DRC2 and two base curves BSC1, BSC2, etc. Each of the three-dimensional curved surfaces is specified by entering these curve data and the like.
  • (b) Next, data are inputted from the keyboard 101 for specifying a number of sections perpendicular to the X-Y plane, which cuts the complex curved surface 201, and these data are stored in the RAM 104. More specifically, a single line of intersection CLi on the X-Y plane 203 is inputted, as well as a rule for specifying a number of lines of intersection in the X-Y plane on the basis of the single line of intersection.
  • By way of example, in a case where the sections are parallel to one another and perpendicular to the X-Y plane and, moreover, the spacing between adjacent sections is constant, the line of intersection CLi (i=l, 2, 3,... between each section and the X-Y plane is as shown in Fig. 5(A). In such case, therefore, data specifying the first line of intersection CL1, as well as the distance between two adjacent lines of intersection (either the distance along the X axis or the distance along the Y axis will suffice), are inputted.
  • In a case where the sections intersect one another in a straight line perpendicular to the X-Y plane and, moreover, the angles between adjacent sections are constant, lines of intersection CLi (i=l, 2, 3,...) between the sections and the X-Y plane intersect successively at equal angles at a single point P, as shown in Fig. 5(B). In such case, therefore, data are inputted specifying the first line of intersection CL1 and the point P, and an angler defined by two mutually adjacent lines of intersection is also inputted.
  • Further, in a case where the sections are mutually concentric cylinders perpendicular to the X-Y plane and, moreover, the spacing between adjacent cylinders is constant, the lines of intersection CLi (i=l, 2, 3,...) between the sections and the X-Y plane are concentric cylindrical arcs, as shown in Fig. 5(C). In such case, therefore, data are inputted specifying the first line of intersection CL1, and the distance d between two mutually adjacent lines of intersection is also inputted. If the lines of intersection shown in Fig. 5(A) and the rule are inputted, the three-dimensional curved surfaces 201a - 201c are cut by a predetermined section 202i [see Fig. 4(B)] specified by the line of intersection and the rule. The section curves that result are SCli, SC2i, SC3i, ... and so on.
  • (c) When the line of intersection on the XY plane and the rule have been inputted, a range for determining a section curve is inputted for each three-dimensional curved surface. It should be noted that when the starting point and end point of the line of intersection specified in step (b) are the 0% position and 100% position, respectively, the ranges for determining the section curves are specified by designating the percentage ranges on the line of intersection.
  • (d) When these data have been entered, the processor 102 generates each of the three-dimensional curved surfaces 201a - 201c by a well-known-method (for example, see U.S.P. 4,491,906). As shown in Fig. 6, let Lc(j) express an intermediate section curve containing a j-th dividing point on the base curve BSCl of the created three-dimensional curved surface, and let Lr(i) express a curve obtained by connecting an i-th dividing point on each of the intermediate section curves Lc(j) (j=l, 2, 3, ... n). A quadrilateral bounded by curves Lc(j), Lc(j+1), Lr(i) and Lr(i+1) shall be referred to as a "patch" PT (i, j). The four vertices Ql, Q2, Q3, Q4 of the patch PT (i, j) are generated by the above-described curved surface creation processing and are stored in the curve surface memory 106.
  • When the processing for generating each of the curved surfaces in accordance with step (d) is completed, processing for creating a complex curved surface begins, as follows:
    • (e) First, the operation 1 → i is performed.
    • (f) Next, the operation 1 → j is performed.
    • (g) The processor 102 then obtains a line of intersection CLi on the i-th X-Y plane by using the data indicative of the 1st line of intersection and the spacing between the lines of intersection obtained in step (b).
    • (h) When the i-th line of intersection CL. has been found, the processor 102 finds the coordinates of points of intersection lying within the section curve range of the j-th curved surface inputted in step (c), these being from among the points of intersection between the i-th line of intersection CLi and the sides of projection patches, which are obtained by projecting each patch (Fig. 6) of the j-th three-dimensional curved surface onto the X-Y plane.
    • (i) When the coordinates of points of intersection within the abovementioned section curve range have been found among the points of intersection between the sides of several projection patches and the i-th line of intersection CL., the coordinates of points on the j-th three-dimensional curved surface corresponding to these points of intersection are computed. Specifically, the coordinates of the points on the j-th curved surface, which points are obtained by projecting the points of intersection onto the X-Y plane, are found. Fig. 7 is a view for describing a method of computing the coordinates of the points on the curved surface. Four sides ia, ib' ja' jb are obtained by projecting a predetermined patch P (m, n) on a three-dimensional curved surface onto the X-Y plane. Let P1i, P2i represent the points of intersection between the i-th line of intersection CLi and a predetermined two of these four sides, and let (x1i, y1i), (x2i, y2i) represent the boordinates of these points of intersection. Further, let Q1', Q2' denote the end points of the side i a intersected by the line of intersection GLi, let Q3', Q4' denote the end points of the side ib intersected by the line of intersection GLi, let Qi (i=l - 4) represent the points on the three-dimensional curved surface that correspond to the points Qi' (i= 1 - 4), and let (xi, Yi. zi) denote the coordinates of each of the points Qi. Then, the Z coordinates zli, z2i of the points Pli', P2i' on the curved surface that correspond to the points of intersection Pli, P2i are calculated in accordance with the following equations:
      Figure imgb0001
      Figure imgb0002
      The coordinates of the points on the curved surface will be (x1i' y1i' z1i), (x2i, Y2i, z2i).
  • The coordinates of points on the j-th three-dimensional curved surface that correspond to all of the points of intersection determined are found through the foregoing procedure and these coordinates are stored in the curved surface memory 106. This will provide a section curve SCji [see Fig. 4(b)] obtained when the j-th three-dimensional curved surface is cut by a section corresponding to the i-th line of intersection CL.
  • (j) Next, the processor 102 checks whether the section curves for all three-dimensional curved surfaces have been obtained.
  • (k) If the section curves [SCli, SC2i, SC3i,... in Figs. 4(C)] within the designated ranges of all three-dimensional curved surfaces have not been obtained, the operation j+1 → j is performed and the processing from step (h) onward is repeated.
  • (m) If the section curves (SCli, SC 2i' SC3i,...) within the designated ranges of all three-dimensional curved surfaces have been obtained, on the other hand, the section curve SCi [see the dashed line in Fig. 4(C)] of the complex curved surface 201 is found through the following processing:
    • Specifically, a point of intersection between the section curve SCji and a section curve SC(j+1) (j=l, 2, 3,...) is calculated. When a point of intersection Rji (j=l, 2, ...) has been found as set forth above, a section curve SCi corresponding to the i-th line of intersection CLi is specified by a section curve SCli, between points of intersection R0i, R1i, a section curve SC2i' between points of intersection Rl., R2i, a section curve SC3i' between points of intersection R2i, R3i,... and so on.
  • (n) When the section curve SCi has been found, it is checked whether section curves corresponding to all lines of intersection CL. have been obtained.
  • (p) If section curves corresponding to all lines of intersection have not been obtained, the operation i+1 → i is performed and processing from step (f) onward is repeated.
  • If section curves corresponding to all lines of intersection have been obtained, however, the processing for creating the complex curved surface ends. Thereafter, the generated curved surface data are used to create e.g. NC data for curved surface machining.
  • Thus, in accordance with the present invention as described above, ranges required for curved surface generation are predetermined along respective section curves, section curves are obtained within these ranges, and both section curves are used to obtain a point of intersection constituting an intersecting portion. As a result, it suffices to obtain only section curves within the specified ranges, without finding section curves over entire ranges. This makes it possible to shorten processing time.

Claims (6)

1. A method of creating a complex curved surface by combining at least two three-dimensional curved surfaces, said method comprising:
a step of inputting data for specifying each of said three-dimensional curved surfaces, and inputting, for every three-dimensional curved surface, data specifying one line of intersection on a predetermined plane, a rule for specifying a number of lines of intersection on said predetermined plane on the basis of said line of intersection, and a range for obtaining a section curve of each of the three-dimensional curved surface, which section curve is obtained when the three-dimensional curved surface is cut by a predetermined section;
a step of obtaining first and second section curves within said ranges obtained when the first and second three-dimensional curved surfaces are cut by a section whose line of intersection with said predetermined plane is an i-th line of intersection among said number of lines of intersection;
a step-of obtaining a point of intersection between the two section curves; and
a step of adopting a set of first and second section curve segments, having said point of intersection as a boundary, as a section curve SCi of the complex curved surface, and generating the complex curved surface by sets of said section curves SCi (i = 1, 2, ...).
2. A method of creating a complex curved surface according to claim 1, characterized in that the ranges of said section curves are specified by ranges on said line of intersection.
3. A method of creating a complex curved surface according to claim 2, characterized in that said section curves are obtained in the form of percentages from one end of said line of intersection, where the one end of the line of intersection is 0 (%) and the other end thereof is 100 (%).
4. A method of creating a complex curved surface according to claim 1, characterized in that said line of intersection is a straight line.of finite length, and said rule decides an (i+l)th line of intersection in such a manner that the spacing between the i-th line of intersection and the (i+l)th line of intersection is constant, lines of intersection being specified in regular order with said one specified line of intersection serving as a first straight line.
5. A method of creating a complex curved surface according to claim 1, characterized in that said line of intersection is a straight line of finite length, and said rule decides an (i+l)th line of intersection in such a manner that an angle between the i-th line of intersection and the (i+l)th line of intersection at a predetermined point is constant, lines of intersection being specified in regular order with said one specified line of intersection serving as a first straight line.
6. A method of creating a complex curved surface according to claim 1, characterized in that said line of intersection is a circular arc, and said rule decides an (i+l)th circular arc in such a manner that the spacing between an i-th circular arc and the (i+l)th circular arc which are mutually concentric is constant, lines of intersection being specified in regular order with said specified line of intersection serving as a first circular arc.
EP86905416A 1985-09-13 1986-09-11 Method of forming compposite curved surface Expired - Lifetime EP0240569B1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP60202809A JPH061404B2 (en) 1985-09-13 1985-09-13 Complex curved surface processing method
JP202809/85 1985-09-13

Publications (3)

Publication Number Publication Date
EP0240569A1 true EP0240569A1 (en) 1987-10-14
EP0240569A4 EP0240569A4 (en) 1990-02-21
EP0240569B1 EP0240569B1 (en) 1993-03-31

Family

ID=16463559

Family Applications (1)

Application Number Title Priority Date Filing Date
EP86905416A Expired - Lifetime EP0240569B1 (en) 1985-09-13 1986-09-11 Method of forming compposite curved surface

Country Status (6)

Country Link
US (1) US4870597A (en)
EP (1) EP0240569B1 (en)
JP (1) JPH061404B2 (en)
KR (1) KR910005902B1 (en)
DE (1) DE3688193T2 (en)
WO (1) WO1987001830A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0237578A1 (en) * 1985-09-17 1987-09-23 Fanuc Ltd. Method of forming composite curved surface

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6318405A (en) * 1986-07-09 1988-01-26 Fanuc Ltd Method for preparing cutting path of composite curved surface
JPS63263501A (en) * 1987-04-21 1988-10-31 Fanuc Ltd Nc data generating method for curved surface working
JPH01319868A (en) * 1988-06-21 1989-12-26 Mitsubishi Electric Corp Curved surface generating system
DE3888188D1 (en) * 1988-12-06 1994-04-07 Heidenhain Gmbh Dr Johannes Method for simulating the machining of a workpiece and displaying the same, and device for carrying out the method.
DE59008038D1 (en) * 1990-09-25 1995-01-26 Heidenhain Gmbh Dr Johannes Process for machining workpieces with numerically controlled machines.
ES2080774T3 (en) * 1990-09-25 1996-02-16 Heidenhain Gmbh Dr Johannes PROCEDURE TO DETERMINE THE PATH CONTOUR OF THE UTIL FOR NUMERICAL CONTROL MACHINES.
DE59009901D1 (en) * 1990-09-25 1996-01-04 Heidenhain Gmbh Dr Johannes Procedure for determining tool path contours in numerically controlled machines.
EP0523270A1 (en) * 1991-07-18 1993-01-20 International Business Machines Corporation Method to control a positioning system
US5416716A (en) * 1993-03-30 1995-05-16 Gerber Garment Technology, Inc. Contour builder
US6134532A (en) * 1997-11-14 2000-10-17 Aptex Software, Inc. System and method for optimal adaptive matching of users to most relevant entity and information in real-time
GB2337123A (en) * 1998-05-09 1999-11-10 Rover Group Calculation of crankshaft angle in a four stroke engine having an odd number of cylinders
KR101686170B1 (en) * 2010-02-05 2016-12-13 삼성전자주식회사 Apparatus for planning traveling path and method thereof

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS575109A (en) * 1980-06-10 1982-01-11 Fanuc Ltd Curved surface forming method
EP0068031A1 (en) * 1980-12-30 1983-01-05 Fanuc Ltd. Curved surface forming method
EP0148279A1 (en) * 1983-07-07 1985-07-17 Fanuc Ltd. Method of producing curved surface
EP0215955A1 (en) * 1985-02-28 1987-04-01 Fanuc Ltd. Method of generating compound curved planes

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS57166607A (en) * 1981-04-04 1982-10-14 Fanuc Ltd Curved surface generating method
JPS57169814A (en) * 1981-04-10 1982-10-19 Fanuc Ltd Forming method of curved surface
JPS57211603A (en) * 1981-06-20 1982-12-25 Fanuc Ltd Nc data forming method
JPS58149507A (en) * 1982-02-26 1983-09-05 Mitsubishi Electric Corp Nc automatic programming system
JPH0767658B2 (en) * 1982-03-15 1995-07-26 株式会社日立製作所 Curved surface generation method and numerical control machining method
JPH067362B2 (en) * 1984-06-26 1994-01-26 フアナツク株式会社 Compound surface generation method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS575109A (en) * 1980-06-10 1982-01-11 Fanuc Ltd Curved surface forming method
EP0068031A1 (en) * 1980-12-30 1983-01-05 Fanuc Ltd. Curved surface forming method
EP0148279A1 (en) * 1983-07-07 1985-07-17 Fanuc Ltd. Method of producing curved surface
EP0215955A1 (en) * 1985-02-28 1987-04-01 Fanuc Ltd. Method of generating compound curved planes

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of WO8701830A1 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0237578A1 (en) * 1985-09-17 1987-09-23 Fanuc Ltd. Method of forming composite curved surface
EP0237578B1 (en) * 1985-09-17 1993-04-14 Fanuc Ltd. Method of forming composite curved surface

Also Published As

Publication number Publication date
JPH061404B2 (en) 1994-01-05
WO1987001830A1 (en) 1987-03-26
DE3688193T2 (en) 1993-07-08
US4870597A (en) 1989-09-26
JPS6263307A (en) 1987-03-20
EP0240569A4 (en) 1990-02-21
KR910005902B1 (en) 1991-08-06
EP0240569B1 (en) 1993-03-31
DE3688193D1 (en) 1993-05-06
KR880700343A (en) 1988-02-22

Similar Documents

Publication Publication Date Title
EP0041854B1 (en) A method of mechining a three-dimensional curved surface
EP0160097B1 (en) Area machining method
EP0240569A1 (en) Method of forming compposite curved surface
EP0076327A1 (en) Method of forming curved surface
EP0075031A1 (en) Method of forming curved surface
EP0215955B1 (en) Method of generating compound curved planes
EP0168501B1 (en) Area machining method
EP0276312B1 (en) Method for computing normal vector
EP0231386A1 (en) Method of generating complex curved surfaces
EP0235293A1 (en) Method of producing compound curved surfaces
US4755926A (en) Method and apparatus for producing a three-dimensional curved surface from two-dimensional curves in perpendicular planes
EP0237578A1 (en) Method of forming composite curved surface
EP0303706A1 (en) Method of generating curved surfaces
JPH067362B2 (en) Compound surface generation method
EP0314798A1 (en) Nc data preparation for working curved surface
US4893251A (en) Method of generating cutting path of complex curved surface
US5410489A (en) Method of specifying position to create fillet curved surface
EP0261249B1 (en) Method of preparing nc data of a composite curved surface
EP0411137A1 (en) Method of forming composite curved surface
JPH01276210A (en) Method for rounding intermediate space curve

Legal Events

Date Code Title Description
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

17P Request for examination filed

Effective date: 19870602

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): DE FR GB

A4 Supplementary search report drawn up and despatched

Effective date: 19900221

RHK1 Main classification (correction)

Ipc: G05B 19/41

17Q First examination report despatched

Effective date: 19910920

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB

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

Ref country code: FR

Effective date: 19930331

REF Corresponds to:

Ref document number: 3688193

Country of ref document: DE

Date of ref document: 19930506

EN Fr: translation not filed
PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Effective date: 19930911

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
GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 19930911

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

Ref country code: DE

Payment date: 19960920

Year of fee payment: 11

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

Ref country code: DE

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

Effective date: 19980603