In this paper, we present a geometric algorithm of finding the maximal cutter for 2-D milling operations. Our algorithm works not only for the common closed pocket problem, but also for the general 2-D milling problems with open edges. We define the general 2-D milling process in terms of a "target region" to be machined and an "obstruction region" that should not intersect with the cutter during machining. Our algorithm finds the largest cutter that can cover the target region without interfering with the obstruction region. Finding the biggest cutter is expected to help in the selection of the right sets of tools and the right type of cutter trajectories, and thereby ensure high production rate and meet the required quality level.
展开▼
