Approximation Algorithm for Multiple-Tool Milling
暂无分享,去创建一个
[1] Joseph S. B. Mitchell,et al. Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..
[2] Kunwoo Lee,et al. NC milling tool path generation for arbitrary pockets defined by sculptured surfaces , 1990, Comput. Aided Des..
[3] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[4] T.-C. Chang,et al. AUTOMATIC CUTTER SELECTION AND OPTIMAL CUTTER PATH GENERATION FOR PRISMATIC PARTS , 1991 .
[5] Thomas R. Kramer,et al. Pocket milling with tool engagement detection , 1992 .
[6] Sanjeev Arora,et al. Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems , 1997, RANDOM.
[7] H. Persson,et al. NC machining of arbitrarily shaped pockets , 1978 .
[8] Joseph S. B. Mitchell,et al. Query-Sensitive Ray Shooting , 1997, Int. J. Comput. Geom. Appl..
[9] Anand K. Gramopadhye,et al. A general mathematical model for optimizing NC tool path for face milling of flat convex polygonal surfaces , 1990 .
[10] Prabhakar Raghavan,et al. The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection , 1994, ISAAC.
[11] Martin Held,et al. On the Computational Geometry of Pocket Machining , 1991, Lecture Notes in Computer Science.
[12] Joseph S. B. Mitchell,et al. Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem , 1996, SODA '96.
[13] K. Preiss,et al. Automated part programming for CNC milling by artificial intelligence techniques , 1985 .
[14] R. A. Wysk,et al. On the Efficiency of NC Tool Path Planning for Face Milling Operations , 1987 .
[15] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[16] Esther M. Arkin,et al. The Lawnmower Problem , 1993, Canadian Conference on Computational Geometry.
[17] Mark de Berg,et al. Realistic input models for geometric algorithms , 1997, SCG '97.
[18] Farhad Arbab,et al. An algorithm for generating NC tool paths for arbitrarily shaped pockets with islands , 1992, TOGS.
[19] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[20] Esther M. Arkin,et al. Optimization Problems Related to Zigzag Pocket Machining , 1996, SODA '96.