Patent US4706201A successfully refreshed from Google Patents.
US4706201A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Area cutting method
Assignee: Fanuc Corp
•
Filing: 1985-01-10
•
Granted: 1987-11-10
•
Expires: 2005-01-10
Abstract
Abstract The present invention provides an area cutting method for cutting the interior of an area (AR) bounded by a closed curve (OFC'). The area cutting method includes the steps of: (1) calculating a centroid (W) of an area bounded by the closed curve; (2) determining whether each line segment (L1-L10) connecting the centroid with each vertex (P1-P10) of the area intersects the closed curve; (3) partitioning each line segment into a predetermined number of partitions if the line segment does not intersect the closed curve, and (4) performing area cutting by moving a tool along plural closed paths (CPT1, CPT2 . . . ) each of which is obtained by connecting corresponding ones of the partitioning points of respective line segments. If at least one line segment intersects the closed curve, the method includes the steps of: partitioning the area (AR) into a plurality of regions; (5b) calculating the centroid of each partitioned region; (5c) partitioning each line segment connecting the centroid with each vertex of the partitioned region corresponding to the centroid into a predetermined number of partitions; (5d) finding plural closed curves, for each and every partitioned region, obtained by connecting corresponding ones of the partitioning points of the line segments; and (5e) performing area cutting by successively moving the tool along each closed path.
Inventors
- 👤 Hajimu Kish
- 👤 Masaki Seki
- 👤 Takashi Takegahara
- 👤 Yasushi Onishi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 14:50
CPC Classifications
G; G05; G05B; G05B19/00; G05B19/02; G05B19/18; G05B19/41; G05B2219/00; G05B2219/30; G05B2219/49; G05B2219/49381; G05B2219/49392
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
109 words
An area cutting method for cutting the interior of an area of a workpiece bounded by a closed curve, said method comprising the steps of: calculating a workpiece centroid of an area bounded by said closed curve; determining whether each line segment connecting said workpiece centroid with each vertex of the area crosses the closed curve; partitioning each line segment into a predetermined number of partitions if each line segment does not cross the closed curve; and performing cutting of the workpiece by moving a tool along plural closed paths each of which is obtained by connecting corresponding ones of partitioning points of respective ones of said line segments.
Claim 2
Dependent Claim
109 words
An area cutting method for cutting the interior of an area of a workpiece bounded by a closed curve, said method comprising the steps of: calculating a workpiece centroid of an area bounded by said closed curve; determining whether each line segment connecting said workpiece centroid with each vertex of the area crosses the closed curve; partitioning each line segment into a predetermined number of partitions if each line segment does not cross the closed curve; and performing cutting of the workpiece by moving a tool along plural closed paths each of which is obtained by connecting corresponding ones of partitioning points of respective ones of said line segments.
Claim 3
Dependent Claim
107 words
An area cutting method of claim 1, further comprising the steps of: partitioning said area into a plurality of partitioned regions if at least one line segment crosses the closed curve; calculating a partitioned region centroid of each partitioned region; partitioning a line segment connecting the partitioned region centroid with each vertex of the corresponding partitioned region corresponding to said partitioned region centroid into a predetermined number of partitions; finding plural closed curves for each partitioned region, obtained by connecting corresponding ones of partitioning points of respective ones of the line segments; and performing cutting of the workpiece by successively moving the tool along each closed curve.
Claim 4
Dependent Claim
43 words
An area cutting method according to claim 2, wherein if a line segment connecting an i-th vertex Pi with the workpiece centroid crosses the closed curve, a region composed of vertices P1, P2, . . . Pi-1 is treated as one partitioned region.
Claim 5
Dependent Claim
65 words
An area cutting method according to claim 3, further comprising the steps of: determining whether each line segment connecting the partitioned region centroid of a region composed of vertices Pi, Pi+1, . . . , P1 with each vertex of the region intersects a curve of an external shape specifying the area, and designating said region as a partitioned region if intersection does not occur.
Claim 6
Dependent Claim
37 words
An area cutting method according to claim 1, wherein said workpiece centroid is the centroid of an area bounded by an offset curve offset a predetermined amount from a curve of an external shape specifiying the area.
Claim 7
Dependent Claim
23 words
An area cutting method according to claim 5, wherein said predetermined amount is the sum of a finishing tolerance and a cutter diameter.
Claim 8
Dependent Claim
42 words
An area cutting method according to claim 5, wherein when said offset curve includes a circular arc portion, said workpiece centroid is the centroid of an area bounded by a linearly approximated offset curve obtained by linearly approximating said circular arc portion.
Claim 9
Dependent Claim
39 words
An area cutting method according to claim 7, wherein when said circular arc portion is approximated by a straight line, the maximum distance between the circular arc portion and approximating straight line is less than a predetermined cut-in pitch.
Claim 10
Dependent Claim
162 words
An area cutting method according to claim 7, wherein said step of calculating the workpiece centroid comprises the steps of: dividing the area bounded by said linearly approximated offset curve into plural triangles; calculating the triangle centroids and areas of the respective triangles; partitioning a line segment, which connects the triangle centroids of first and second neighboring triangles, by a first partitioning point at a ratio of an area of said first triangle to an area of said second triangle; specifying said partitioning point as a quadrilateral centroid of a quadrilateral obtained by combining said first and second triangles; partitioning a line segment, which connects the quadrilateral centroid of said quadrilateral and the triangle centroid of a third triangle, by a second partitioning point at a ratio of an area of said quadrilaterial to an area of said third triangle; and specifying said second partitioning point as a pentagon centroid of a pentagon obtained by combining said first, second and third triangles.
Claim 11
Dependent Claim
46 words
An area cutting method according to claim 1, wherein said predetermined number of partitions is determined where the length of partitioned line segments, obtained by partitioning a line segment of maximum length connecting said workpiece centroid with said vertices, is less than a predetermined cut-in pitch.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1990-11-09 | 1991-05-11 | 1991-11-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-11-09 | 1995-05-11 | 1995-11-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-11-09 | 1999-05-11 | 1999-11-10 | $7700.00 | Window Closed / Lapsed |