US4621959A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Area cutting method
Assignee: Fanuc Corp
•
Filing: 1984-10-12
•
Granted: 1986-11-11
•
Expires: 2004-10-12
Abstract
Abstract An area cutting method for cutting the interior of an area (AR) bounded by an external shape curve (OLC) including a number of straight lines (S1, S2, . . . S6) and a circular arc (A1). The method includes linearly approximating a circular arc portion (A1') of an offset curve (OFC) which is offset a predetermined amount from the external shape curve. Then an area bounded by the linearly approximated offset curve is divided into a plurality of convex polygons (PG1-PG3). The centroid (Wi) of each convex polygon and the mid-points (M1, M2) of boundary lines (B1, B2) of two mutually adjacent convex polygons are calculated, and a base line (BL) is generated by successively connecting each centroid and each mid-point. Straight lines (L1-L14) connecting the centroids (Wi) of the convex polygons and the apices (P1-P10) of the convex polygons, and straight lines (BL1-BL4) connecting the mid-points (M1, M2) and the two ends (P1, P4; P4, P7) of the boundary lines bisected by the mid-points are partitioned into a predetermined number of partitions. A tool is moved along plural closed paths (CPT1, CPT2, . . . ) obtained by connecting partitioning points (P a1 , P a2 , . . . P a18 ; P b1 , P b2 , . . . P b18 ), which correspond to the straight lines (L1-L14, BL1-BL4), in such a manner that the base line (BL) is enclosed. The tool is moved along the base line (BL) and along the offset curve (OFC).
Inventors
- 👤 Hajimu Kishi
- 👤 Masaki Seki
- 👤 Takashi Takegahara
- 👤 Yasushi Onishi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 12:41
CPC Classifications
G; G05; G05B; G05B19/00; G05B19/02; G05B19/18; G05B19/41; G05B2219/00; G05B2219/30; G05B2219/34; G05B2219/34101; G05B2219/49; G05B2219/49226; G05B2219/49381; G05B2219/50; G05B2219/50336; Y; Y10; Y10T; Y10T409/00; Y10T409/30; Y10T409/30084; Y10T409/300896; Y10T409/30112; Y10T409/303752; Y10T409/303808
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
140 words
An area cutting method for cutting the interior of an area bounded by a curve of an external shape, comprising the steps of: (a) dividing the bounded area into a plurality of convex polygons having boundary lines therebetween; (b) calculating the centroid of each of the convex polygons and the mid-points of the boundary lines of two mutually adjacent convex polygons; (c) partitioning, into a predetermined number of partitions for each of the convex polygons, line segments connecting the centroid of the convex polygon and the apices of the convex polygon, and partitioning, into a predetermined number of partitions for each of the mid-points, line segments connecting the mid-point and the two ends of the boundary line bisected by the mid-point; and (d) moving a tool along plural closed paths obtained by connecting partitioning points corresponding to the line segments.
Claim 2
Dependent Claim
140 words
An area cutting method for cutting the interior of an area bounded by a curve of an external shape, comprising the steps of: (a) dividing the bounded area into a plurality of convex polygons having boundary lines therebetween; (b) calculating the centroid of each of the convex polygons and the mid-points of the boundary lines of two mutually adjacent convex polygons; (c) partitioning, into a predetermined number of partitions for each of the convex polygons, line segments connecting the centroid of the convex polygon and the apices of the convex polygon, and partitioning, into a predetermined number of partitions for each of the mid-points, line segments connecting the mid-point and the two ends of the boundary line bisected by the mid-point; and (d) moving a tool along plural closed paths obtained by connecting partitioning points corresponding to the line segments.
Claim 3
Dependent Claim
46 words
An area cutting method according to claim 1, wherein said step (a) includes the substeps of obtaining an offset curve which is offset a predetermined amount from the curve of the external shape, and dividing an area bounded by the offset curve into plural convex polygons.
Claim 4
Dependent Claim
77 words
An area cutting method according to claim 1, wherein when the curve of the external shape is composed of circular arcs and straight lines, said step (a) includes substeps of obtaining an offset curve, which is offset a predetermined amount from the curve of the external shape, linearly approximating a circular arc portion of the offset curve to obtain a linear offset curve, and dividing an area bounded by the linear offset curve into plural convex polygons.
Claim 5
Dependent Claim
28 words
An area cutting method according to claim 3, further comprising the step of moving the tool along a base line obtained by connecting the centroids and the mid-points.
Claim 6
Dependent Claim
21 words
An area cutting method according to claim 4, further comprising the step of moving the tool along the linear offset curve.
Claim 7
Dependent Claim
22 words
An area cutting method according to claim 5, wherein the predetermined amount is the sum of a finishing margin and cutter diameter.
Claim 8
Dependent Claim
47 words
An area cutting method according to claim 5, wherein when the circular arc portion is approximated by the linear offset curve, it is so arranged that a maximum distance between the circular arc portion and the approximating linear offset curve is smaller than a predetermined cut-in pitch.
Claim 9
Dependent Claim
111 words
An area cutting method according to claim 5, wherein when a side on which an (i+1)th line segment of the linear offset curve lies with respect to an i-th line segment, differs from a side on which the i-th line segment lies with respect to an (i-1)th line segment, said step (a) comprises generating one convex polygon by a line segment connecting a starting point of the i-th line segment and a starting point of a first line segment, the one convex polygon including the first, second, . . . i-th line segments, and wherein the (i+1)th line segment serves as the first line segment for generating the next convex polygon.
Claim 10
Dependent Claim
73 words
An area cutting method according to claim 5, wherein said step (c) includes determining the number of partitions in such a manner that the length of a partitioned line segment, obtained by partitioning by the number of partitions a line segment of the maximum length among the line segments connecting the centroids and the apices, and the line segments connecting the mid-points and the two ends, is smaller than a predetermined cut-in pitch.
Claim 11
Dependent Claim
77 words
An area cutting method according to claim 5, wherein when the convex polygon is a quadrilateral, said step (b) includes dividing the quadrilateral into first and second triangles, calculating the centroids and areas of the respective first and second triangles, and partitioning a straight line connecting the centroids at a partitioning point based on the ratio of the areas of the first and second triangles, and wherein the partitioning point serves as the centroid of the quadrilateral.
Claim 12
Dependent Claim
181 words
An area cutting method according to claim 5, wherein said step (b) includes dividing the convex polygon into plural triangles, calculating the centroids and areas of the respective triangles, partitioning a line segment, which connects the centroids of first and second neighboring triangles, by a partitioning point based on the ratio of the area of the first triangle to the area of the second triangle, adopting the partitioning point as the centroid of a quadrilateral obtained by combining the first and second triangles, partitioning a line segment which connects the centroid of the quadrilateral and the centroid of a third triangle, by a partitioning point based on the ratio of the area of the quadrilateral to the area of the third triangle, adopting the partitioning point as the centroid of a pentagon obtained by combining the first, second and third triangles, and continuing calculation of a partitioning point based on the ratio of the area of a polygon for which the centroid has been calculated to the area of a neighboring triangle, until the centroid of the convex polygon is calculated.
Claim 13
Dependent Claim
218 words
An area cutting method for cutting the interior of an area bounded by a curve of an external shape, comprising the steps of: (a) dividing, into plural convex polygons having boundary lines therebetween, an area bounded by an offset curve which is offset a predetermined amount from the curve of the external shape; (b) calculating the centroid of each of the convex polygons and the mid-points of the boundary lines of two mutually adjacent convex polygons; (c) generating a base line obtained by successively connecting the centroids and the mid-points; (d) partitioning, into a predetermined number of partitions for each of the convex polygons, line segments connecting the centroid of the convex polygon and the apices of the convex polygon, and partitioning, into a predetermined number of partitions for each of the mid-points, line segments connecting the mid-point and the two ends of the boundary line bisected by the mid-point; (e) creating NC data for moving a tool along plural closed paths obtained by connecting partitioning points corresponding to the partitioned line segments, in such a manner that the base line is enclosed, creating NC data for moving the tool along the base line, and creating NC data for moving the tool along the offset curve; and (f) performing area cutting on the basis of the NC data.
Claim 14
Dependent Claim
218 words
An area cutting method for cutting the interior of an area bounded by a curve of an external shape, comprising the steps of: (a) dividing, into plural convex polygons having boundary lines therebetween, an area bounded by an offset curve which is offset a predetermined amount from the curve of the external shape; (b) calculating the centroid of each of the convex polygons and the mid-points of the boundary lines of two mutually adjacent convex polygons; (c) generating a base line obtained by successively connecting the centroids and the mid-points; (d) partitioning, into a predetermined number of partitions for each of the convex polygons, line segments connecting the centroid of the convex polygon and the apices of the convex polygon, and partitioning, into a predetermined number of partitions for each of the mid-points, line segments connecting the mid-point and the two ends of the boundary line bisected by the mid-point; (e) creating NC data for moving a tool along plural closed paths obtained by connecting partitioning points corresponding to the partitioned line segments, in such a manner that the base line is enclosed, creating NC data for moving the tool along the base line, and creating NC data for moving the tool along the offset curve; and (f) performing area cutting on the basis of the NC data.
Claim 15
Dependent Claim
77 words
An area cutting method according to claim 12, wherein when the curve of the external shape is composed of circular arcs and straight lines, said step (a) includes substeps of obtaining an offset curve which is offset a predetermined amount from the curve of the external shape, linearly approximating the circular arc portion of the offset curve to obtain a linear offset curve, and dividing an area bounded by the linear offset curve into plural convex polygons.
Claim 16
Dependent Claim
184 words
An area cutting method for cutting the interior of an area bounded by a curve, comprising the steps of: (a) automatically dividing the bounded area into a plurality of convex polygons having boundary lines therebetween; (b) automatically calculating the centroid of each of the convex polygons; (c) automatically calculating the mid-point of each of the boundary lines between the convex polygons; (d) automatically generating, for each of the convex polygons, line segments connecting the centroid and the apices of the convex polygon, and partitioning the line segments so as to generate at least one partitioning point on each of the line segments; (e) automatically partitioning each of the boundary lines so as to generate partition points on each of the boundary lines; (f) automatically generating a base line by connecting the centroids of the convex polygons and the mid-points of the boundary lines; (g) automatically generating closed paths by connecting the partitioning points in such a manner that the base line is enclosed; and (h) moving a tool along the plural closed paths obtained in said step (g) so as to perform area cutting.
Claim 17
Dependent Claim
184 words
An area cutting method for cutting the interior of an area bounded by a curve, comprising the steps of: (a) automatically dividing the bounded area into a plurality of convex polygons having boundary lines therebetween; (b) automatically calculating the centroid of each of the convex polygons; (c) automatically calculating the mid-point of each of the boundary lines between the convex polygons; (d) automatically generating, for each of the convex polygons, line segments connecting the centroid and the apices of the convex polygon, and partitioning the line segments so as to generate at least one partitioning point on each of the line segments; (e) automatically partitioning each of the boundary lines so as to generate partition points on each of the boundary lines; (f) automatically generating a base line by connecting the centroids of the convex polygons and the mid-points of the boundary lines; (g) automatically generating closed paths by connecting the partitioning points in such a manner that the base line is enclosed; and (h) moving a tool along the plural closed paths obtained in said step (g) so as to perform area cutting.
Claim 18
Dependent Claim
77 words
An area cutting method according to claim 14, wherein when the curve is composed of straight lines and at least one circular arc, said step (a) includes the substeps of: (a1) obtaining an offset curve which is offset by a predetermined amount from the curve; (a2) obtaining a linear offset curve by linearly approximating the circular arc portion of the offset curve; and (a3) dividing the area bounded by the linear offset curve into the convex polygons.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1989-11-10 | 1990-05-12 | 1990-11-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-11-10 | 1994-05-12 | 1994-11-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-11-10 | 1998-05-12 | 1998-11-11 | $7700.00 | Window Closed / Lapsed |