Abstract
We present approximation algorithms for cutting out polygons with line cuts and ray cuts. Our results answer a number of open problems and are either the first solutions or significantly improve over previously known solutions. For the line cutting version, we prove a key property that leads to a simple, constant factor approximation algorithm. For the ray cutting version, we prove it is possible to compute in almost linear time a cutting sequence that is an O(log2 n)-factor approximation. No algorithms were previously known for the ray cutting version.
This research was partially supported by NSF grant CCF-0430366.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bhadury, J., Chandrasekaran, R.: Stock cutting to minimize cutting length. European Journal of Operational Research 88, 69–87 (1996)
Demaine, E.D., Demaine, M.L., Kaplan, C.S.: Polygons cuttable by a circular saw. Computational Geometry: Theory and Applications 20, 69–84 (2001)
Dumitrescu, A.: An approximation algorithm for cutting out convex polygons. Procs. of the 14-th ACM-SIAM Symposium on Discrete Algorithms, 823–827 (2003)
Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2(2), 209–233 (1987)
Jaromczyk, J.W., Kowaluk, M.: Sets of lines and cutting out polyhedral objects. Computational Geometry 25, 67–95 (2003)
Overmars, M.H., Welzl, E.: The complexity of cutting paper. In: Procs. of the 1st Annual ACM Symposium on Computational Geometry, pp. 316–321 (1985)
Pach, J., Tardos, G.: Cutting Glass. Disc. & Comput. Geom. 24, 481–495 (2000)
Toussaint, G.T.: Solving geometric problems with the ‘rotating calipers’. In: Procs. MELECON, Athens, Greece (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daescu, O., Luo, J. (2004). Cutting Out Polygons with Lines and Rays. In: Fleischer, R., Trippen, G. (eds) Algorithms and Computation. ISAAC 2004. Lecture Notes in Computer Science, vol 3341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30551-4_58
Download citation
DOI: https://doi.org/10.1007/978-3-540-30551-4_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24131-7
Online ISBN: 978-3-540-30551-4
eBook Packages: Computer ScienceComputer Science (R0)