Skip to main content

All Questions

Filter by
Sorted by
Tagged with
4 votes
0 answers
164 views

Tileability and computabilty

Let $n>2$ be an integer. We consider $n$ pairs $(x_1,y_1),\dotsc,(x_n,y_n)$ in $\mathbb{N}^2$, and the polygon defined by drawing a straight line from $(x_k, y_k)$ to $(x_{k+1},y_{k+1})$ and from $(...
Dominic van der Zypen's user avatar