{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:43:42Z","timestamp":1740120222185,"version":"3.37.3"},"reference-count":4,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01n02","funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","award":["RGPIN-07185-2020"],"award-info":[{"award-number":["RGPIN-07185-2020"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:p> In 1985 Hopcroft, Joseph and Whitesides showed it is NP-complete to decide whether a carpenter\u2019s ruler with segments of given positive lengths can be folded into an interval of at most a given length, such that the folded hinges alternate between 180 degrees clockwise and 180 degrees counter-clockwise. At the open-problem session of 33rd Canadian Conference on Computational Geometry (CCCG \u201921), O\u2019Rourke proposed a natural variation of this problem called ruler wrapping, in which all folded hinges must be folded the same way. In this paper we show O\u2019Rourke\u2019s variation has a linear-time solution. <\/jats:p>","DOI":"10.1142\/s0218195922410011","type":"journal-article","created":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T10:54:52Z","timestamp":1671447292000},"page":"3-12","source":"Crossref","is-referenced-by-count":0,"title":["Ruler Wrapping"],"prefix":"10.1142","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3689-327X","authenticated-orcid":false,"given":"Travis","family":"Gagie","sequence":"first","affiliation":[{"name":"Faculty of Computer Science, Dalhousie University, Halifax, NS, Canada"}]},{"given":"Mozhgan","family":"Saeidi","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, Dalhousie University, Halifax, NS, Canada"}]},{"given":"Allan","family":"Sapucaia","sequence":"additional","affiliation":[{"name":"Institute of Computing, University of Campinas, Campinas, SP, Brazil"}]}],"member":"219","published-online":{"date-parts":[[2022,12,19]]},"reference":[{"issue":"2","key":"S0218195922410011BIB001","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1137\/0214025","volume":"14","author":"Hopcroft J.","year":"1985","journal-title":"SIAM J. Comput."},{"key":"S0218195922410011BIB002","first-page":"155","volume":"52","author":"C\u0103linescu G.","year":"2005","journal-title":"Combin. Comput. Geom."},{"issue":"1","key":"S0218195922410011BIB003","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(75)90103-X","volume":"11","author":"Fredman M. L.","year":"1975","journal-title":"Discr. Math."},{"key":"S0218195922410011BIB004","volume-title":"The Art of Computer Programming","volume":"3","author":"Knuth D. E.","year":"1973"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195922410011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T01:36:01Z","timestamp":1679448961000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0218195922410011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,19]]},"references-count":4,"journal-issue":{"issue":"01n02","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["10.1142\/S0218195922410011"],"URL":"https:\/\/doi.org\/10.1142\/s0218195922410011","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"type":"print","value":"0218-1959"},{"type":"electronic","value":"1793-6357"}],"subject":[],"published":{"date-parts":[[2022,12,19]]}}}