Skip to content

Comment on Tiling with Three Polygons Is Undecidable

Comments

The author gave a talk on this at Tufts during the FWCG last week. Fascinating talk.

One interesting question from audience was whether the ratio between the largest polygon piece and the smallest piece can be made bounded, as the current construction has unbounded ratio.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.