Recent content by paizhaulski

Are there any theorems that say something formal about the fact that any graph is drawable on a 2D surface, and can be mapped to a 2D array of pixels if the pixels are infinitely small?

I am looking for theorems/information related to the following statement: any polygon can be created by an infinite number of infinitely small "extensions" or "croppings" of any other polygon, such that the shape is always a polygon (after any amount of extensions of croppings). For example, I...