{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T11:16:20Z","timestamp":1778757380305,"version":"3.51.4"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2014,10,17]],"date-time":"2014-10-17T00:00:00Z","timestamp":1413504000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10472-014-9437-3","type":"journal-article","created":{"date-parts":[[2014,10,15]],"date-time":"2014-10-15T21:44:21Z","timestamp":1413409461000},"page":"371-400","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Lang\u2019s Universal molecule algorithm"],"prefix":"10.1007","volume":"74","author":[{"given":"John C.","family":"Bowers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ileana","family":"Streinu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,17]]},"reference":[{"issue":"12","key":"9437_CR1","first-page":"752","volume":"1","author":"O Aichholzer","year":"1995","unstructured":"Aichholzer, O., Alberts, D., Aurenhammer, F., G\u00e4rtner, B.: A novel type of skeleton for polygons. Journal of Universal Computer Science 1(12), 752\u2013761 (1995)","journal-title":"Journal of Universal Computer Science"},{"key":"9437_CR2","doi-asserted-by":"crossref","unstructured":"Bowers, J.C., Lang\u2019s universal molecule, I. Streinu.: algorithm. In: Proceedings of the Twenty-eighth Annual Symposium on Computational Geometry, SoCG \u201912, pp. 419\u2013420. ACM, New York (2012)","DOI":"10.1145\/2261250.2261315"},{"key":"9437_CR3","doi-asserted-by":"crossref","unstructured":"Bowers, J.C., Streinu, I.: Rigidity of origami universal molecules. In: Ida, T., Fleuriot, J. D. (eds.) Automated Deduction in Geometry, vol. 7993 of Lecture Notes in Computer Science, pp. 120\u2013142. Springer (2012)","DOI":"10.1007\/978-3-642-40672-0_9"},{"key":"9437_CR4","doi-asserted-by":"crossref","unstructured":"Bowers, J.C., Streinu, I.: Computing origami universal molecules with cyclic tournament forests. In: Proceedings of the 15th Intern. Symp. on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC\u201913), pages 42\u201352. IEEE (2013)","DOI":"10.1109\/SYNASC.2013.13"},{"key":"9437_CR5","unstructured":"Demaine, E.D., Demaine, M.L.: Computing extreme origami bases. Technical Report CS-97-22, Department of Computer Science, University of Waterloo (1997)"},{"key":"9437_CR6","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Fekete, S.P., Lang, R.J.: Circle packing for origami design is hard. In: Wang-Iverson, P., Lang, R. J., Yim, M. (eds.) Origami 5: Fifth International Meeting of Origami Science, Mathematics, and Education, pp. 609\u2013626. Taylor and Francis (2011)","DOI":"10.1201\/b10971-52"},{"key":"9437_CR7","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., O\u2019Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, and Polyhedra. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511735172"},{"key":"9437_CR8","unstructured":"Huzita, H.: Proceedings First Intern. Meeting of Origami Science and Technology (1989), 143\u2013158 (1991)"},{"key":"9437_CR9","first-page":"361","volume-title":"Mathematical Software - ICMS 2006, vol. 4151 of Lecture Notes in Computer Science","author":"T Ida","year":"2006","unstructured":"Ida, T., Takahashi, H., Marin, M., Ghourabi, F., Kasem, A.: Computational construction of a maximum equilateral triangle inscribed in an origami. In: Iglesias, A., Takayama, N. (eds.) Mathematical Software - ICMS 2006, vol. 4151 of Lecture Notes in Computer Science, pp. 361\u2013372. Springer, Berlin Heidelberg (2006)"},{"key":"9437_CR10","first-page":"132","volume-title":"Artificial Intelligence and Symbolic Computation, vol. 3249 of Lecture Notes in Computer Science","author":"T Ida","year":"2004","unstructured":"Ida, T., Tepeneu, D., Buchberger, B., Robu, J.: Proving and constraint solving in computational origami. In: Buchberger, B., Campbell, J. (eds.) Artificial Intelligence and Symbolic Computation, vol. 3249 of Lecture Notes in Computer Science, pp. 132\u2013142. Springer, Berlin Heidelberg (2004)"},{"key":"9437_CR11","doi-asserted-by":"crossref","unstructured":"Lang, R.J.: A computational algorithm for origami design. In: Proceedings of the 12th Annual ACM Symposium on Computational Geometry, pp. 98\u2013105 (1996)","DOI":"10.1145\/237218.237249"},{"key":"9437_CR12","unstructured":"Lang, R.J.: Treemaker 4.0: A program for origami design, http:\/\/www.langorigami.com (1998)"},{"key":"9437_CR13","doi-asserted-by":"crossref","unstructured":"Lang, R.J.: Origami design secrets: mathematical methods for an ancient art. Ak Peters Series. A.K. Peters (2003)","DOI":"10.1201\/b10706"},{"key":"9437_CR14","unstructured":"Lang, R.J. (ed.): Origami 4: Fourth International Meeting of Origami Science, Mathematics, and Education. A. K. Peters (2009)"},{"key":"9437_CR15","doi-asserted-by":"crossref","unstructured":"Lang, R.J., Demaine, E.D.: Facet ordering and crease assignment in uniaxial bases. In [14] (2009)","DOI":"10.1201\/b10653-21"},{"issue":"8","key":"9437_CR16","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1016\/j.comgeo.2010.04.002","volume":"46","author":"G Panina","year":"2010","unstructured":"Panina, G., Streinu, I.: Flattening single-vertex origami: the non-expansive case. Computational Geometry: Theory and Applications 46(8), 678\u2013687 (2010)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"9437_CR17","volume-title":"Proceedings of the Japan Conf. Discrete and Computational Geometry (JCDCG 2004), vol. 3742 of Lecture Notes in Computer Science, pp. 161\u2013173, Tokai University","author":"I Streinu","year":"2005","unstructured":"Streinu, I., Whiteley, W.: Single-vertex origami and spherical expansive motions. In: Akiyama, J., Kano, M. (eds.) Proceedings of the Japan Conf. Discrete and Computational Geometry (JCDCG 2004), vol. 3742 of Lecture Notes in Computer Science, pp. 161\u2013173, Tokai University. Springer Verlag, Tokyo (2005)"},{"issue":"2","key":"9437_CR18","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1109\/TVCG.2009.67","volume":"16","author":"T Tachi","year":"2010","unstructured":"Tachi, T.: Origamizing polyhedral surfaces. Visualization and Computer Graphics, IEEE Transactions on 16(2), 298\u2013311 (2010)","journal-title":"Visualization and Computer Graphics, IEEE Transactions on"},{"key":"9437_CR19","unstructured":"Wang-Iverson, P., Lang, R.J., Yim, M.: Origami 5: Fifth International Meeting of Origami Science, Mathematics, and Education. Taylor and Francis (2011)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-014-9437-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-014-9437-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-014-9437-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T03:14:40Z","timestamp":1565925280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-014-9437-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,17]]},"references-count":19,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["9437"],"URL":"https:\/\/doi.org\/10.1007\/s10472-014-9437-3","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,17]]}}}