A Geometric Algorithm for Finding the Largest Milling Cutter
| dc.contributor.author | Yao, Zhiyang | en_US |
| dc.contributor.author | Gupta, Satyandra K. | en_US |
| dc.contributor.author | Nau, Dana S. | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T10:09:27Z | |
| dc.date.available | 2007-05-23T10:09:27Z | |
| dc.date.issued | 2000 | en_US |
| dc.description.abstract | 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:<p>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.<p>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.<p>3. We present a geometric algorithm for finding the maximal cutter for 2-D milling operations, and we show thatour algorithm is correct. | en_US |
| dc.format.extent | 473287 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/6137 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 2000-40 | en_US |
| dc.subject | algorithms | en_US |
| dc.subject | computational geometry | en_US |
| dc.subject | path planning | en_US |
| dc.subject | computer aided manufacturing CAM | en_US |
| dc.subject | manufacturing | en_US |
| dc.subject | cutter selection | en_US |
| dc.subject | Next-Generation Product Realization Systems | en_US |
| dc.title | A Geometric Algorithm for Finding the Largest Milling Cutter | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1