http://de.evo-art.org/index.php?action=history&feed=atom&title=On_the_Enumeration_of_Chequered_Tilings_in_Polygons 2026-07-09T14:28:10Z Versionsgeschichte dieser Seite in de_evolutionary_art_org MediaWiki 1.27.4 http://de.evo-art.org/index.php?title=On_the_Enumeration_of_Chequered_Tilings_in_Polygons&diff=33270&oldid=prev 2017-12-07T10:01:22Z

<p>Die Seite wurde neu angelegt: „ == Referenz == Hiroaki Hamanaka, Takashi Horiyama and Ryuhei Uehara: <a href="/index.php?title=On_the_Enumeration_of_Chequered_Tilings_in_Polygons" title="On the Enumeration of Chequered Tilings in Polygons">On the Enumeration of Chequered Tilings in Polygons</a>. In: <a href="/index.php?title=Bridges_2017" title="Bridges 2017">Bridges 2017</a>, Pages 423…“</p> <p><b>Neue Seite</b></p><div><br /> == Referenz == <br /> Hiroaki Hamanaka, Takashi Horiyama and Ryuhei Uehara: [[On the Enumeration of Chequered Tilings in Polygons]]. In: [[Bridges 2017]], Pages 423–426.<br /> <br /> == DOI ==<br /> <br /> == Abstract ==<br /> The Tokyo 2020 Olympic and Paralympic games emblems, called ‘harmonized chequered emblems,’ are designed with three kinds of rectangles. We enumerate all such tilings in a dodecagon with a hole. <br /> <br /> == Extended Abstract ==<br /> <br /> == Bibtex == <br /> @inproceedings{bridges2017:423,<br /> author = {Hiroaki Hamanaka, Takashi Horiyama and Ryuhei Uehara},<br /> title = {On the Enumeration of Chequered Tilings in Polygons},<br /> pages = {423--426},<br /> booktitle = {Proceedings of Bridges 2017: Mathematics, Art, Music, Architecture, Education, Culture},<br /> year = {2017},<br /> editor = {David Swart, Carlo H. S\&#039;equin, and Krist\&#039;of Fenyvesi},<br /> isbn = {978-1-938664-22-9},<br /> issn = {1099-6702},<br /> publisher = {Tessellations Publishing},<br /> address = {Phoenix, Arizona},<br /> note = {Available online at \url{http://archive.bridgesmathart.org/2017/bridges2017-423.pdf}}<br /> }<br /> <br /> == Used References == <br /> [1] O. Bodini, T. Fernique, M. Rao, and E. R´emila, Distance on Rhombus Tilings, Theoretical Computer<br /> Science, 412 (2011), pp. 4787–4794.<br /> <br /> [2] K. Yamanaka, S. Nakano, Y. Matsui, R. Uehara, and K. Nakada, Efficient enumeration of all ladder<br /> lotteries and its application, Theoretical Computer Science, 411 (2010), pp. 1714–1722.<br /> <br /> <br /> == Links == <br /> <br /> === Full Text === <br /> http://archive.bridgesmathart.org/2017/bridges2017-423.pdf<br /> <br /> [[internal file]] <br /> <br /> <br /> === Sonstige Links ===</div>

Gubachelier