Voronoi diagram-based tool path compensations for removing uncut material in 2½D pocket machining

2006 ◽  
Vol 38 (3) ◽  
pp. 194-209 ◽  
Author(s):  
M. Salman A. Mansor ◽  
S. Hinduja ◽  
O.O. Owodunni
Author(s):  
David Manuel Ochoa González ◽  
Joao Carlos Espindola Ferreira

Traditional (direction-parallel and contour-parallel) and non-traditional (trochoidal) tool paths are generated by specialized geometric algorithms based on the pocket shape and various parameters. However, the tool paths generated with those methods do not usually consider the required machining power. In this work, a method for generating power-aware tool paths is presented, which uses the power consumption estimation for the calculation of the tool path. A virtual milling system was developed to integrate with the tool path generation algorithm in order to obtain tool paths with precise power requirement control. The virtual milling system and the tests used to calibrate it are described within this article, as well as the proposed tool path generation algorithm. Results from machining a test pocket are presented, including the real and the estimated power requirements. Those results were compared with a contour-parallel tool path strategy, which has a shorter machining time but has higher in-process power consumption.


Author(s):  
Greg Burton

In this paper we present a new, efficient algorithm for computing the “raw offset” curves of 2D polygons with holes. Prior approaches focus on (a) complete computation of the Voronoi Diagram, or (b) pair-wise techniques for generating a raw offset followed by removal of “invalid loops” using a sweepline algorithm. Both have drawbacks in practice. Robust implementation of Voronoi Diagram algorithms has proven complex. Sweeplines take O((n + k)log n) time and O(n + k) memory, where n is the number of vertices and k is the number of self-intersections of the raw offset curve. It has been shown that k can be O(n2) when the offset distance is greater than or equal to the local radius of curvature of the polygon, a regular occurrence in the creation of contour-parallel offset curves for NC pocket machining. Our O(n log n) recursive algorithm, derived from Voronoi diagram algorithms, computes the velocities of polygon vertices as a function of overall offset rate. By construction, our algorithm prunes a large proportion of locally invalid loops from the raw offset curve, eliminating all self-intersections in raw offsets of convex polygons and the “near-circular”, k proportional to O(n2) worst-case scenarios in non-convex polygons.


Author(s):  
Divyangkumar D. Patel ◽  
Devdas I. Lalwani

In the 2.5D pocket machining, the pocket geometry (shape of the pocket) significantly affects the efficiency of spiral tool path in terms of tool path length, cutting time, surface roughness, cutting forces, etc. Hence, the pocket geometry is an important factor that needs to be considered. However, quantitative methods to compare different pocket geometries are scarcely available. In this paper, we have introduced a novel approach for quantitative comparison of different pocket geometries using a dimensionless number, “DN.” The concept and formula of DN are developed, and DN is calculated for various pocket geometries. A concept of percentage utilization of tool (PUT) is also introduced and is considered as a measure and an indicator for a good tool path. The guidelines for comparing pocket geometries based on DN and PUT are reported. The results show that DN can be used to predict the quality of tool path prior to tool path generation. Further, an algorithm to decompose pocket geometry into subgeometries is developed that improves the efficiency of spiral tool path for bottleneck pockets (or multiple-connected pocket). This algorithm uses another dimensionless number “HARIN” (HARI is the acronym of “helps in appropriate rive-lines identification” and suffix “N” stands for number) to compare parent pocket geometry with subgeometries. The results indicate that decomposing pocket geometry with the new algorithm improves HARIN and removes the effect of bottlenecks. Furthermore, the algorithm for decomposition is extended for pockets that are bounded by free-form curves.


2000 ◽  
Vol 43 (1) ◽  
pp. 97-103 ◽  
Author(s):  
Shan Yan ◽  
Wang Shuilai ◽  
Tong Shuiguang

Author(s):  
Michael B. Bieterman ◽  
Donald R. Sandstrom

A novel curvilinear tool-path generation method is described for planar milling of pockets. The method uses the solution of an elliptic partial differential equation boundary value problem defined on a pocket region. This mathematical function helps morph a smooth low-curvature spiral path in a pocket interior to one that conforms to the pocket boundary. This morphing leads to substantial reductions of tool wear in cutting hard metals and of machining time in cutting all metals, as experiments described here show. A variable feed-rate optimization procedure is also described. This procedure incorporates path, tool engagement, and machine constraints and can be applied to maximize machine performance for any tool path.


Sign in / Sign up

Export Citation Format

Share Document