Abstract
A chain or n-link is a sequence of n links whose lengths are fixed joined together from their endpoints, free to turn about their endpoints, which act as joints. “Ruler Folding Problem”, which is NP-Complete is to find the minimum length of the folded chain in one dimensional space. The best result for ruler folding problem is reported by Hopcroft et al. in one dimensional space which requires O(nL 2) time complexity, where L is length of the longest link in the chain and links have integer value lengths. We propose a dynamic programming approach to fold a given chain whose links have integer lengths in a minimum length in O(nL) time and space. We show that by generalizing the algorithm it can be used in d-dimensional space for orthogonal ruler folding problem such that it requires O(2d ndL d) time using O(2d ndL d) space.
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
Hopcroft, J., Joseph, D., Whitesides, S.: On the movement of robot arms in 2-dimensional bounded regions. SIAM J. Comput. 14(2), 315–333 (1985)
Whitesides, S.: Chain Reconfiguration. The Ins and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 1–13. Springer, Heidelberg (2001)
Calinescu, 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 Sciences Research Institute Publications, Cambridge University Press (2005)
Kantabutra, V.: Reaching a point with an unanchored robot arm in a square. International journal of Computational Geometry & Applications 7(6), 539–549 (1997)
Biedl, T., Demaine, E., Demaine, M., Lazard, S., Lubiw, A., O’Rourke, J., Robbins, S., Streinu, I., Toussaint, G., Whitesides, S.: A note on reconfigurating tree linkages: Trees can lock. Discrete Appl. Math. (2001)
Biedl, T., Lubiw, A., Sun, J.: When Can a Net Fold to a Polyhedron? In: Eleventh Canadian Conference on Computational Geometry, U. British Columbia (1999)
Lenhart, W.J., Whitesides, S.: Reconfiguring Closed Polygonal Chains in Euclidean d-Space. Discrete and Computational Geometry 13, 123–140 (1995)
Whitesides, S.: Algorithmic issues in the geometry of planar linkage movement. Australian Computer Journal, Special Issue on Algorithms 24(2), 42–50 (1992)
O’Rourke, J.: Folding and unfolding in computational geometry. Discrete and Computational Geometry 1763, 258–266 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nourollah, A., Razzazi, M.R. (2007). A New Dynamic Programming Algorithm for Orthogonal Ruler Folding Problem in d-Dimensional Space. In: Gervasi, O., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2007. ICCSA 2007. Lecture Notes in Computer Science, vol 4705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74472-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-74472-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74468-9
Online ISBN: 978-3-540-74472-6
eBook Packages: Computer ScienceComputer Science (R0)