Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

17
  • 7
    $\begingroup$ For triangle tiles, there is this paper which I cannot access at the moment: "Classification of tilings of the 2-dimensional sphere by congruent triangles." Yoshio Agaoka and Yukako Ueno. Hiroshima Math. J.. Volume 32, Number 3 (2002), 463-540. $\endgroup$ Commented Nov 2, 2013 at 21:08
  • 5
    $\begingroup$ @JosephO'Rourke : Thank you. The open-access 78-page article is available @ projecteuclid.org/… $\endgroup$ Commented Nov 2, 2013 at 22:12
  • 4
    $\begingroup$ @JosephO'Rourke : True even for non-convex tiles, only define a vertex as a point at which at least three tiles meet; then use the Euler characteristic for the sphere. $\endgroup$ Commented Nov 3, 2013 at 1:59
  • 8
    $\begingroup$ By the way, the hyperbolic plane can be tiled by congruent copies of polygons with arbitrarily small diameters using "horobricks." $\endgroup$ Commented Nov 3, 2013 at 18:32
  • 8
    $\begingroup$ The first questin is Problem 60 in the Scottish Cafe book of problems: Can one, for every $\varepsilon>0$, represent the surface of a sphere as a sum of a finite number of regions which are smaller in diameter than $\varepsilon$, closed, connected, congruent, and have no interior point in common? We assume that the boundaries of these sets are: (a) polygons, (b) curves of finite lengt, (c) sets of measure zero. (RUZIEWICZ) $\endgroup$
    – juan
    Commented Feb 25, 2014 at 20:28