%0 Report %D 2000 %T A Geometric Algorithm for Finding the Largest Milling Cutter %A Yao,Zhiyang %A Gupta, Satyandra K. %A Nau, Dana S. %K algorithms %K computational geometry %K computer aided manufacturing CAM %K cutter selection %K Manufacturing %K Next-Generation Product Realization Systems %K path planning %X In this paper, we describe a new geometric algorithm to determine the largest feasible cutter size for2-D milling operations to be performed using a single cutter. In particular:

1. We give a general definition of the problem as the task of covering a target region without interfering with anobstruction region. This definition encompasses the task of milling a general 2-D profile that includes bothopen and closed edges.

2. We discuss three alternative definitions of what it means for a cutter to be feasible, and explain which of thesedefinitions is most appropriate for the above problem.

3. We present a geometric algorithm for finding the maximal cutter for 2-D milling operations, and we show thatour algorithm is correct. %I Institute for Systems Research, University of Maryland, College Park %V ISR; TR 2000-40 %8 2000/// %G eng %U http://drum.lib.umd.edu//handle/1903/6137