 |
 |
|
 |
 |
|
|
|
|
|
|
Encyclopedia :
H :
HE :
HEE :
Heesch's problem |
|
|
Heesch's problemFinding 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 linksWolfram Mathworld : Heesch NumberUCI : Heesch's Problem |
|
|
This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License. |
|
| © 2008 Chamas Enterprises Inc. |
