Science Fair Project Encyclopedia
Heesch's problem
Finding the maximum number of times that any closed plane figure could be completely surrounded by exact copies of itself is Heesch's problem. The number for a given figure is known as the Heesch number of that figure.
External links
Wolfram Mathworld : Heesch Number
UCI : Heesch's Problem
Last updated: 05-26-2005 20:59:58
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details


