{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:49:45Z","timestamp":1761598185449,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T00:00:00Z","timestamp":1584921600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T00:00:00Z","timestamp":1584921600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"JSPS KAKENHI","award":["17K00342"],"award-info":[{"award-number":["17K00342"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s00453-020-00695-6","type":"journal-article","created":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T12:02:58Z","timestamp":1584964978000},"page":"2502-2534","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An Efficient Exhaustive Search Algorithm for the Escherization Problem"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7582-2699","authenticated-orcid":false,"given":"Yuichi","family":"Nagata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinji","family":"Imahori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,23]]},"reference":[{"issue":"3","key":"695_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1109\/34.75509","volume":"13","author":"EM Arkin","year":"1991","unstructured":"Arkin, E.M., Chew, L.P., Huttenlocher, D.P., Kedem, K., Joseph, S.B.: An efficiently computable metric for comparing polygonal shapes. IEEE Trans. Pattern Anal. Mach. Intell. 13(3), 209\u2013216 (1991)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"695_CR2","volume-title":"Tilings and Patterns","author":"B Gr\u00fcnbaum","year":"1987","unstructured":"Gr\u00fcnbaum, B., Shephard, G.C.: Tilings and Patterns. WH Freeman and Company, New York (1987)"},{"key":"695_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-94883-1","volume-title":"Fl\u00e4chenschlu\u00df: System der formen l\u00fcckenlos aneinanderschlie\u00dfender Flachteile","author":"H Heesch","year":"1963","unstructured":"Heesch, H., Kienzle, O.: Fl\u00e4chenschlu\u00df: System der formen l\u00fcckenlos aneinanderschlie\u00dfender Flachteile. Springer-Verlag, Berlin (1963)"},{"key":"695_CR4","series-title":"Lecture Notes in Computer Science","first-page":"132","volume-title":"Proceedings of Discrete and Computational Geometry and Graphs, JCDCGG 2015","author":"S Imahori","year":"2015","unstructured":"Imahori, S., Kawade, S., Yamakata, Y.: Escher-like tilings with weights. In: Proceedings of Discrete and Computational Geometry and Graphs, JCDCGG 2015. Lecture Notes in Computer Science, vol. 9943, pp. 132\u2013142. Springer, Cham (2015)"},{"key":"695_CR5","unstructured":"Imahori, S., Sakai, S.: A local-search based algorithm for the escherization problem. In: The IEEE International Conference on Industrial Engineering and Engineering Management, pp. 151\u2013155 (2012)"},{"issue":"1","key":"695_CR6","first-page":"1","volume":"4","author":"CS Kaplan","year":"2009","unstructured":"Kaplan, C.S.: Introductory tiling theory for computer graphics. Synth. Lect. Comput. Graph. Anim. 4(1), 1\u2013113 (2009)","journal-title":"Synth. Lect. Comput. Graph. Anim."},{"key":"695_CR7","doi-asserted-by":"crossref","unstructured":"Kaplan, C.S., Salesin, D.H.: Escherization. In: Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques, pp. 499\u2013510. ACM Press\/Addison-Wesley Publishing Co. (2000)","DOI":"10.1145\/344779.345022"},{"issue":"3","key":"695_CR8","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00373-011-1022-5","volume":"27","author":"H Koizumi","year":"2011","unstructured":"Koizumi, H., Sugihara, K.: Maximum eigenvalue problem for escherization. Graphs Combin. 27(3), 431\u2013439 (2011)","journal-title":"Graphs Combin."},{"key":"695_CR9","doi-asserted-by":"crossref","unstructured":"Liu, X., Li, X., et\u00a0al.: The artwork generating system of escher-like positive and negative pattern evolution. In: ACM SIGGRAPH 2017 Posters. ACM (2017)","DOI":"10.1145\/3102163.3102250"},{"key":"695_CR10","doi-asserted-by":"crossref","unstructured":"Ono, S., Kisanuki, M., Machii, H., Mizuno, K.: Creation support for escher-like tiling patterns by interactive genetic algorithms. In: SIGGRAPH Asia 2014 Posters, ACM (2014)","DOI":"10.1007\/978-3-319-13359-1_33"},{"key":"695_CR11","doi-asserted-by":"crossref","unstructured":"Ono, S., Kisanuki, M., Machii, H., Mizuno, K.: Figure pattern creation support for escher-like tiling by interactive genetic algorithms. In: Proceedings of the 18th Asia Pacific Symposium on Intelligent and Evolutionary Systems, vol. 1, pp. 421\u2013432. Springer, Berlin (2015)","DOI":"10.1007\/978-3-319-13359-1_33"},{"key":"695_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970739","volume-title":"Numerical Methods for Large Eigenvalue Problems","author":"Y Saad","year":"2011","unstructured":"Saad, Y.: Numerical Methods for Large Eigenvalue Problems, revised edn. SIAM, New York (2011)","edition":"Revised"},{"key":"695_CR13","volume-title":"Visions of Symmetry","author":"D Schattschneider","year":"2004","unstructured":"Schattschneider, D., Escher, M.C.: Visions of Symmetry. Harry N. Abrams, New York (2004)"},{"issue":"8","key":"695_CR14","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1109\/34.400572","volume":"17","author":"M Werman","year":"1995","unstructured":"Werman, M., Weinshall, D.: Similarity and affine invariant distances between 2D point sets. IEEE Trans. Pattern Anal. Mach. Intell. 17(8), 810\u2013814 (1995)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00695-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-020-00695-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00695-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T00:32:09Z","timestamp":1616459529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-020-00695-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,23]]},"references-count":14,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["695"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00695-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2020,3,23]]},"assertion":[{"value":"24 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}