D. G. Charlton

Papers

Total Citations

H-Index

About

D. G. Charlton is a mathematician whose work lies at the intersection of geometry, combinatorics, and computational geometry, with a particular focus on the theory of dissections. His most significant contribution is the resolution of a long-standing open problem: proving that any finite collection of polygons of equal area has a common hinged dissection. This means that a chain of polygons, connected at vertices like a physical hinge, can be folded continuously in the plane—without any self-intersection—to form any polygon in the original set. The result, published in two papers (2011, 27 citations; 2008, 8 citations), is both elegant and profound, settling a question that had puzzled mathematicians for decades. Charlton’s work not only advances pure geometric theory but also has potential applications in reconfigurable robotics, deployable structures, and even the design of foldable furniture. His proof demonstrates a deep understanding of spatial reasoning and algorithmic construction, making him a key figure in the modern study of hinged dissections. For students and researchers, Charlton’s work is a masterclass in how a clever geometric insight can solve a problem that seems impossible at first glance.