Maximum eigenvalue problem for Escherization

DOI10.1007/S00373-011-1022-5zbMATH Open1233.05084OpenAlexW2000150676MaRDI QIDQ659697FDOQ659697

Hiroshi Koizumi, K. Sugihara

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1022-5

zbMATH Keywords

TilingEscherizationMaximum eigenvalueTessellation

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Cites Work

• Shape Manifolds, Procrustean Metrics, and Complex Projective Spaces

Cited In (3)

• Escher-like Tilings with Weights
• Ambiguous tiling
• An efficient exhaustive search algorithm for the Escherization problem

   Recommendations

• An efficient exhaustive search algorithm for the Escherization problem 👍 👎
• Escher-like Tilings with Weights 👍 👎
• Title not available (Why is that?) 👍 👎
• Computational aspects of M. C. Escher's ribbon patterns 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Maximum eigenvalue problem for Escherization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659697)