Results 1 
8 of
8
A geometric algorithm for finding the largest milling cutter
 J Manufact Process 2001;3(1):1–16
"... This paper describes a new geometric algorithm to determine the largest feasible cutter size for 2D 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. Th ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This paper describes a new geometric algorithm to determine the largest feasible cutter size for 2D 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 2D 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 2D milling operations, and the algorithm is shown to be correct.
Advances in Computational Geometry for Document Analysis
 Proc., 3rd Annual Symp. Document Analysis and Information Retrieval
, 1994
"... Many problems in document image analysis can be couched in geometric terms. We outline recent advances in computational geometry that contribute to many aspects of the document analysis process and we provide pointers to a selection of the computational geometry literature where the most relevan ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Many problems in document image analysis can be couched in geometric terms. We outline recent advances in computational geometry that contribute to many aspects of the document analysis process and we provide pointers to a selection of the computational geometry literature where the most relevant results can be found. 1 Introduction Document image analysis (DIA) is concerned with the automatic transfer by machine of visual twodimensional documents, most commonly consisting of printed pages from books, magazines or newspapers. Maps and engineering drawings constitute another class of common documents. The first class of problems have much in common with optical character recognition (OCR) and both with computer vision. On the other hand DIA is a special case of computer vision and therefore its special properties give rise to special subproblems such as textblock isolation and textlineorientation inference. Furthermore these special properties allow the tailoring of more gener...
A Geometric Algorithm for Selecting Optimal Set of Cutters for MultiPart Milling
 In Proceedings of the sixth ACM symposium on solid modeling and applications
, 2001
"... For the manufacture of milled parts, it is well known that the size of the cutter significantly affects the machining time. However, for smallbatch manufacturing, the time spent on loading tools into the tool magazine and establishing zlength compensation values is just as important. If we can sel ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
For the manufacture of milled parts, it is well known that the size of the cutter significantly affects the machining time. However, for smallbatch manufacturing, the time spent on loading tools into the tool magazine and establishing zlength compensation values is just as important. If we can select a set of milling tools that will produce good machining time on more than one type of parts, then several unnecessary machinetool reconfiguration operations can be eliminated. This paper describes a geometric algorithm for finding an optimal set of cutters for machining a set of 22D parts. In selecting milling cutters we consider both the tool loading time and the machining time and generate solutions that allow us to minimize the total machining time. Our problem formulation addresses the general problem of how to cover a target region to be milled with a cylindrical cutter without intersecting with the obstruction region; this definition allows us to handle both open and closed edges in the target region. Our algorithm improves upon previous work in the tool selection area in following ways: (1) in selecting cutters, it accounts for the tool loading time, and (2) it can simultaneously consider multiple different parts and select the optimal set of cutters to minimize the total manufacturing time.
Finding The Maximal Cutter For 2D Milling Operations
, 2000
"... : In this paper, we describe a new geometric algorithm to determine the biggest feasible cutter size for 2D milling operations to be performed using a single cutter. In particular: . We give a general definition of the problem as the task of covering a target region without interfering with an obs ..."
Abstract
 Add to MetaCart
: In this paper, we describe a new geometric algorithm to determine the biggest feasible cutter size for 2D milling operations to be performed using a single cutter. In particular: . 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 2D profile that includes both open and closed edges. . 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. . We present a geometric algorithm for finding the maximal cutter for 2D milling operations, and we give an outline of a proof that our algorithm is correct. 1 INTRODUCTION NC machining is being used to create increasingly complex shapes. These complex shapes are used in a variety of defense, aerospace, and automotive applications to (1) provide performance improvements, and (2) create high p...
A Scheduling Algorithm for Optimization and Early Planning in Highlevel Synthesis
"... Complexities of applications implemented on embedded and programmable systems grow with the advances in capacities and capabilities of these systems. Mapping applications onto them manually is becoming a very tedious task. This draws attention to using highlevel synthesis within design flows. Mea ..."
Abstract
 Add to MetaCart
Complexities of applications implemented on embedded and programmable systems grow with the advances in capacities and capabilities of these systems. Mapping applications onto them manually is becoming a very tedious task. This draws attention to using highlevel synthesis within design flows. Meanwhile, it is essential to provide a flexible formulation of optimization objectives as well as to perform efficient planning for various design objectives early on in the design flow. In this work, we address these issues in the context of data flow graph (DFG) scheduling which is an essential element within the highlevel synthesis flow. We present a algorithm that schedules a chain of operations with data dependencies among consecutive operations at a single step. This local problem is repeated to generate the schedule for the whole DFG. The local problem is formulated as a maximum weight noncrossing bipartite matching. We use a technique from computational geometry domain to solve the matching problem.
Manufacturing Processes, 3(1):116, 2001. A GEOMETRIC ALGORITHM FOR FINDING THE LARGEST MILLING CUTTER
"... This document contains the draft version of the following paper: Z. Yao, S.K. Gupta, and D.S. Nau. A geometric algorithm for finding the largest milling cutter. Journal of Manufacturing Processes, 3(1):116, 2001. Readers are encouraged to get the official version from the journal’s web site or by ..."
Abstract
 Add to MetaCart
This document contains the draft version of the following paper: Z. Yao, S.K. Gupta, and D.S. Nau. A geometric algorithm for finding the largest milling cutter. Journal of Manufacturing Processes, 3(1):116, 2001. Readers are encouraged to get the official version from the journal’s web site or by
Optimization of machining parameters and tool selection in 2.5D milling using Genetic Algorithm
, 2011
"... Abstract — Optimization of machining parameters for improving the machining efficiency is become important, when high capital cost NC machines have been employed for high precision and efficient machining. The strategy is to minimize the production time and cost by optimizing feed per tooth, speed, ..."
Abstract
 Add to MetaCart
Abstract — Optimization of machining parameters for improving the machining efficiency is become important, when high capital cost NC machines have been employed for high precision and efficient machining. The strategy is to minimize the production time and cost by optimizing feed per tooth, speed, width of cut, depth of cut and tool diameter by satisfying all the constraints such as maximum machine power, maximum cutting force, maximum machining speed, feed rate, tool life and required surface roughness. The optimal End milling cutter diameter and radial depth of cut (step over) are also the key issues for minimization of total production cost. Therefore, in this paper an attempt has been made to include all major parameters such as feed per tooth, speed, width of cut (Stepover) and depth of cut along with diameter of tool for minimising the time and production cost during 2.5 D milling. Hence, a mathematical model has been developed and Genetic Algorithm (GA) has been proposed to solve the problem. Optimal values of machining parameters have been calculated for benchmark problems and compared with handbook recommendations. It has been found that approximately 13 % of production cost can be reduced by choosing optimal cutter diameter and width of cut. Besides this 50 % reduction in cost per unit volume and 61 % increment in material removal rate has also been reported by selecting optimal cutting parameters over the handbook recommendations.
Z. Yao, S.K. Gupta, and D.S. Nau. A geometric algorithm for finding the largest milling cutter. Journal of Manufacturing Processes, 3(1):116, 2001. A GEOMETRIC ALGORITHM FOR FINDING THE LARGEST MILLING CUTTER
"... ABSTRACT: In this paper, we describe a new geometric algorithm to determine the largest feasible cutter size for 2D 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 wit ..."
Abstract
 Add to MetaCart
ABSTRACT: In this paper, we describe a new geometric algorithm to determine the largest feasible cutter size for 2D 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 2D 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 2D milling operations, and we show that our algorithm is correct.