{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T08:10:14Z","timestamp":1778746214923,"version":"3.51.4"},"reference-count":10,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2022,6]]},"abstract":"<jats:p>Undoubtedly the following fact is surprising when being first encountered with:<\/jats:p>\n          <jats:p>It is possible to cut a hole in the unit cube such that another unit cube can pass through it.<\/jats:p>","DOI":"10.1145\/3572867.3572870","type":"journal-article","created":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T00:37:32Z","timestamp":1669250252000},"page":"32-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Extended abstract for"],"prefix":"10.1145","volume":"56","author":[{"given":"Jakob","family":"Steininger","sequence":"first","affiliation":[]},{"given":"Sergey","family":"Yurkevich","sequence":"additional","affiliation":[]}],"member":"320","published-online":{"date-parts":[[2022,11,23]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.2018.1449505"},{"key":"e_1_2_1_2_1","first-page":"1","volume-title":"Advances in Computing Research I","author":"Chazelle B.","year":"1983","unstructured":"B. Chazelle . The polygon containment problem . Advances in Computing Research I , pages 1 -- 33 , 1983 . B. Chazelle. The polygon containment problem. Advances in Computing Research I, pages 1--33, 1983."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(88)80005-1"},{"issue":"1","key":"e_1_2_1_4_1","first-page":"29","article-title":"Rupert properties of polyhedra and the generalised Nieuwland constant","volume":"23","author":"Hoffmann B.","year":"2019","unstructured":"B. Hoffmann . Rupert properties of polyhedra and the generalised Nieuwland constant . J. Geom. Graph. , 23 ( 1 ): 29 -- 35 , 2019 . B. Hoffmann. Rupert properties of polyhedra and the generalised Nieuwland constant. J. Geom. Graph., 23(1):29--35, 2019.","journal-title":"J. Geom. Graph."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.4169\/math.mag.90.2.87"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.2019.1656958"},{"issue":"3","key":"e_1_2_1_7_1","first-page":"417","article-title":"Properness defects of projections and computation of at least one point in each connected component of a real algebraic set","volume":"32","author":"Safey El Din M.","year":"2004","unstructured":"M. Safey El Din and E. Schost . Properness defects of projections and computation of at least one point in each connected component of a real algebraic set . Discrete Comput. Geom. , 32 ( 3 ): 417 -- 430 , 2004 . M. Safey El Din and E. Schost. Properness defects of projections and computation of at least one point in each connected component of a real algebraic set. Discrete Comput. Geom., 32(3):417--430, 2004.","journal-title":"Discrete Comput. Geom."},{"issue":"9","key":"e_1_2_1_8_1","first-page":"241","article-title":"Das Problem des Prinzen Ruprecht von der Pfalz","volume":"10","author":"Scriba C. J.","year":"1968","unstructured":"C. J. Scriba . Das Problem des Prinzen Ruprecht von der Pfalz . Praxis Math. , 10 ( 9 ): 241 -- 246 , 1968 . C. J. Scriba. Das Problem des Prinzen Ruprecht von der Pfalz. Praxis Math., 10(9):241--246, 1968.","journal-title":"Praxis Math."},{"key":"e_1_2_1_9_1","volume-title":"An algorithmic approach to Rupert's problem","author":"Steininger J.","year":"2021","unstructured":"J. Steininger and S. Yurkevich . An algorithmic approach to Rupert's problem , 2021 . Preprint , https:\/\/arxiv.org\/abs\/2112.13754. J. Steininger and S. Yurkevich. An algorithmic approach to Rupert's problem, 2021. Preprint, https:\/\/arxiv.org\/abs\/2112.13754."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1525\/9780520348097"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3572867.3572870","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3572867.3572870","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:10Z","timestamp":1750183690000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3572867.3572870"}},"subtitle":["solving rupert's problem algorithmically"],"short-title":[],"issued":{"date-parts":[[2022,6]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["10.1145\/3572867.3572870"],"URL":"https:\/\/doi.org\/10.1145\/3572867.3572870","relation":{},"ISSN":["1932-2240"],"issn-type":[{"value":"1932-2240","type":"print"}],"subject":[],"published":{"date-parts":[[2022,6]]},"assertion":[{"value":"2022-11-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}