Show simple item record

A Geometric Algorithm for Finding the Largest Milling Cutter

dc.contributor.authorYao, Zhiyangen_US
dc.contributor.authorGupta, Satyandra K.en_US
dc.contributor.authorNau, Dana S.en_US
dc.description.abstractIn this paper, we describe a new geometric algorithm to determine the largest feasible cutter size for 2-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 an obstruction region. This definition encompasses the task of milling a general 2-D profile that includes both open and closed edges.2. We discuss three alternative definitions of what it means for a cutter to be feasible, and explain which of these definitions 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 that our algorithm is correct.en_US
dc.format.extent650680 bytes
dc.relation.ispartofseriesISR; TR 2001-32en_US
dc.subjectNext-Generation Product Realization Systemsen_US
dc.titleA Geometric Algorithm for Finding the Largest Milling Cutteren_US
dc.typeTechnical Reporten_US

Files in this item


This item appears in the following Collection(s)

Show simple item record