Area cutting method

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.

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.