Abstract
We consider the carpenter’s ruler folding problem in the plane, i.e., finding a minimum area shape with diameter 1 that accommodates foldings of any ruler whose longest link has length 1. An upper bound of 0.614 and a lower bound of 0.476 are known for convex cases. We generalize the problem to simple nonconvex cases: we improve the upper bound to 0.583 and establish the first lower bound of 0.073.
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
Alt, H., Buchin, K., Cheong, O., Hurtado, F., Knauer, C., Schulz, A., Whitesides, S.: Small boxes for carpenter’s rules (2006) (manuscript), http://page.mi.fu-berlin.de/alt/papers/carpenter.pdf
Braß, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)
Călinescu, G., Dumitrescu, A.: The carpenter’s ruler folding problem. In: Goodman, J., Pach, J., Welzl, E. (eds.) Combinatorial and Computational Geometry, pp. 155–166. Mathematical Science Research Institute Publications, Cambridge University Press (2005)
Klein, O., Lenz, T.: Carpenters rule packings—a lower bound. In: Abstracts of 23rd European Workshop on Computational Geometry, pp. 34–37 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Chen, K., Dumitrescu, A. (2014). Nonconvex Cases for Carpenter’s Rulers. In: Ferro, A., Luccio, F., Widmayer, P. (eds) Fun with Algorithms. FUN 2014. Lecture Notes in Computer Science, vol 8496. Springer, Cham. https://doi.org/10.1007/978-3-319-07890-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-07890-8_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07889-2
Online ISBN: 978-3-319-07890-8
eBook Packages: Computer ScienceComputer Science (R0)