In mathematics, a holyhedron is a type of 3-dimensional geometric body: a polyhedron each of whose faces contains at least one polygon-shaped hole, and whose holes' boundaries share no point with each other or the face's boundary.[1]
The concept was first introduced by John H. Conway; the term "holyhedron" was coined by David W. Wilson in 1997 as a pun involving polyhedra and holes. Conway also offered a prize of 10,000 USD, divided by the number of faces, for finding an example,[2] asking:
- Is there a polyhedron in Euclidean three-dimensional space that has only finitely many plane faces, each of which is a closed connected subset of the appropriate plane whose relative interior in that plane is multiply connected?
No actual holyhedron was constructed until 1999, when Jade P. Vinson presented an example of a holyhedron with a total of 78,585,627 faces;[3][4] another example was subsequently given by Don Hatch, who presented a holyhedron with 492 faces in 2003, worth about 20.33 USD prize money.[1]
References
- ^ a b Weisstein, Eric W. "Holyhedron". MathWorld.
- ^ Demaine, Erik D.; O'Rourke, Joseph (September 1999). "Computational geometry column 37". ACM SIGACT News. 30 (3): 39–42. doi:10.1145/333623.333625. S2CID 9358750.
- ^ Peterson, Ivars (December 11, 2002). "Punctured Polyhedra". Science News. Archived from the original on March 4, 2016.
- ^ Vinson, J. (2000). "On holyhedra". Discrete & Computational Geometry. 24 (1): 85–104. doi:10.1007/s004540010033. MR 1765235.