Approximation algorithms for multiple-tool miling

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Approximation algorithms for multiple-tool miling

Full text

Pdf (1.42 MB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the fourteenth annual symposium on Computational geometry table of contents

Minneapolis, Minnesota, United States

Pages: 297 - 306

Year of Publication: 1998

ISBN:0-89791-973-4

Authors

Sunil Arya	Department of Computer Science, The Hong Kong University of Science & Technology, Clear Water Bay, Hong Kong
Siu-Wing Cheng	Department of Computer Science, The Hong Kong University of Science & Technology, Clear Water Bay, Hong Kong
David M. Mount	Department of Computer Science &, Institute for Advanced Computer Studies, University of Maryland, College Park, Maryland

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 19, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/276884.276918 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AFM93	E. Arkin, S. Fekete, and J. Mitchell. The lawnmower problem. In Proc. 5th Canad. Conf. Cornput. Geom., pages 461-466, 1993.
	AFM95	E. Arkin, S. Fekete, and J. Mitchell. Approximation algorithms for lawnmowing and milling. Report, SUNY Stony Brook, 1995.
	AHS96	Esther M. Arkin , Martin Held , Christopher L. Smith, Optimization problems related to zigzag pocket machining, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.419-428, January 28-30, 1996, Atlanta, Georgia, United States
	Aro96	S. Arora, Polynomial time approximation schemes for Euclidean TSP and other geometric problems, Proceedings of the 37th Annual Symposium on Foundations of Computer Science, p.2, October 14-16, 1996
	Arc97	S. Arora, Nearly linear time approximation schemes for Euclidean TSP and other geometric problems, Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS '97), p.554, October 19-22, 1997
	BC91	M. Bah and T.-C. Chang. Automatic cutter selection and optimal cutter path generation for prismatic parts. Int. J. Prod. Re.s, 29:2163-2176, 1991.
	Bru82	L.K. Bruckner. Geometric algorithms for 2.5d roughing process of sculptured surfaces. In Proc. Joint Anglo-Hungarian Seminar on Computer- Aided Geometric Design, 1982.
	DBW93	A. V. Deshmukh, M. M. Barash, and H. P. #Vang. On selection of tool path orientations for generating prismatic features. Report, IF. Dept, Purdue U, 1993.
	HA92	Allan Hansen , Farhad Arbab, An algorithm for generating NC tool paths for arbitrarily shaped pockets with islands, ACM Transactions on Graphics (TOG), v.11 n.2, p.152-182, April 1992 [doi>10.1145/130826.130832]
	Hel89	M. Held. Geopocket - A sophisticated computational geometry solution of geometrical and technological problems arising from pocket machining. In F. Kimura and A. Rolstad#, editors, Proc. Computer Applications in Production and Engineering, pages 283-293. North-Holland, October 1989.
	Hel91a	M. Held. A geometry-based investigation of the tool path generation for zigzag pocket machining. Visual Comput., 7(5-6):296-308, September 1991.
	Hel91b	Martin Held, On the computational geometry of pocket machining, Springer-Verlag New York, Inc., New York, NY, 1991
	IRT94	Kazuo Iwano , Prabhakar Raghavan , Hisao Tamaki, The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection, Proceedings of the 5th International Symposium on Algorithms and Computation, p.29-37, August 25-27, 1994
	Kra92	T. tL Kramer. Pocket milling with tool engagement detection. J. of Maufacturing Sy#b'm#, 11(2):114-123, 1992.
	Mit96	Joseph S. B. Mitchell, Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.402-408, January 28-30, 1996, Atlanta, Georgia, United States
	MMS94	Joseph S. B. Mitchell , David M. Mount , Subhash Suri, Query-sensitive ray shooting, Proceedings of the tenth annual symposium on Computational geometry, p.359-368, June 06-08, 1994, Stony Brook, New York, United States [doi>10.1145/177424.178094]
	Per78	H. Persson. NC machining of arbitrarily shaped pockets. Comput. Aided Design, 10(3):169-17,1, May 1978.
	PGW90	P. V. Prabhu, A. K. Gramopadhye, and H. P. Wang. General mathematical model to optimizing NC tool path for face milling of flat convex polygonal surfaces. Int. J. Production Rc#carch, 28(1):101-130, 1990.
	PK83	K. Preiss and E. Kaplansky. Automatic mill routing from solid geometry information. In Proc. Computer Applications in Production and Engineering. North-Holland, 1983.
	PK85	K. Preiss and E. Kaplansky. Automated CNC milling by artificial intelligence method#. J. of Maufacturing Systems, 4(1):51-63, 1985.
	Pre89	K. Preiss. Automated mill pocketing computations. In Advanced Geometric Modeling for Engineering Applications. North-Holland, 1989.
	SL90	Y. S. Suh , K. Lee, NC milling tool path generation for arbitrary pockets defined by sculptered surfaces, Computer-Aided Design, v.22 n.5, p.273-284, June 1990 [doi>10.1016/0010-4485(90)90092-Q]
	W+87	H.-P. Wang et al. On the efficiency of NC tool path planning for face milling operations. Tran.#. of the ASME, J. of Engineering for Indu.#try, 109(4):370-376, November 1987.

CITED BY 3

	Zhiyang Yao , Satyandra K. Gupta , Dana S. Nau, A geometric algorithm for selecting optimal set of cutters for multi-part milling, Proceedings of the sixth ACM symposium on Solid modeling and applications, p.130-139, May 2001, Ann Arbor, Michigan, United States
	Siu-Wing Cheng , Tamal K. Dey, Approximate minimum weight Steiner triangulation in three dimensions, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.205-214, January 17-19, 1999, Baltimore, Maryland, United States
	Esther M. Arkin , Michael A. Bender , Erik D. Demaine , Sándor P. Fekete , Joseph S. B. Mitchell , Saurabh Sethia, Optimal covering tours with turn costs, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.138-147, January 07-09, 2001, Washington, D.C., United States