Notes
The convex hull of a set of planar points is the minimal convex polygon that contains all the points; if you're of a physical cast of mind, you could think of this as the shape that you would get by stretching a rubber band around the set of points and then allowing the band to "snap closed" on the points, wrapping around them. Algorithms for constructing the hull are a staple of computational geometry texts such as O'Rourke (1998).
References
Crawford, C. (2002). Tangram puzzles. New York: Sterling.
Gardner, M. (1988). Time travel and other Mathematical Bewilderments. New York: W. H. Freeman.
O’Rourke, J. (1998). Computational geometry in C (2nd ed.). Cambridge, UK: Cambridge University Press.
Read, R. (1965). Tangrams: 330 puzzles. New York: Dover.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Eisenberg, M. Computational Diversions: The Game of HullGrams. Tech Know Learn 16, 97–102 (2011). https://doi.org/10.1007/s10758-011-9178-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10758-011-9178-x