Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-12T09:49:44.415Z Has data issue: false hasContentIssue false

Hole dissections for planar figures

Published online by Cambridge University Press:  21 June 2021

Greg N. Frederickson*
Affiliation:
Department of Computer Science, Purdue University, West Lafayette, IN 47907, USA e-mail:gnf@purdue.edu

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A geometric dissection is a cutting of a geometric figure (or a finite set of figures) into pieces that we can rearrange to form another geometric figure (or finite set of figures). If our figures are required to be polygons, then there is always a dissection that has just a finite number of pieces. This was established by John Lowry [1], William Wallace [2], Farkas Bolyai [3], and Karl Gerwien [4]. The American Sam Loyd [5] and the Englishman Henry Ernest Dudeney [6, 7] emphasised the goal of minimising the number of pieces that resulted from such a standard dissection.

Information

Type
Articles
Copyright
© Mathematical Association 2021