Skip to main content
Log in

Computational Diversions: The Game of HullGrams

  • Computational Diversions
  • Published:
Technology, Knowledge and Learning Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Notes

  1. 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.

    Google Scholar 

  • Gardner, M. (1988). Time travel and other Mathematical Bewilderments. New York: W. H. Freeman.

    Google Scholar 

  • O’Rourke, J. (1998). Computational geometry in C (2nd ed.). Cambridge, UK: Cambridge University Press.

    Google Scholar 

  • Read, R. (1965). Tangrams: 330 puzzles. New York: Dover.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michael Eisenberg.

Appendix: Solutions to puzzles in this column

Appendix: Solutions to puzzles in this column

Figure 4 puzzles

Figure 6 puzzles

Figure 8 puzzles

Rights and permissions

Reprints 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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10758-011-9178-x

Keywords

Navigation