A Geometric Algorithm for Finding the Largest Milling Cutter

Abstract This paper describes a new geometric algorithm to determine the largest feasible cutter size for 2-D milling operations to be performed using a single cutter. First is given a general definition of the problem as the task of covering a target region without interfering with an obstruction region. This definition encompasses the task of milling a general 2-D profile that includes both open and closed edges. Discussed next are three alternative definitions of what it means for a cutter to be feasible, with explanations of which of these definitions is most appropriate for the above problem. Then, a geometric algorithm is presented for finding the maximal cutter for 2-D milling operations, and the algorithm is shown to be correct.