Geometric problem solving with strings and pins

• Published in: Spatial cognition and computation Vol. 19; no. 1; pp. 46 - 68
• Main Authors: Freksa, Christian, Barkowsky, Thomas, Falomir, Zoe, van de Ven, Jasper
• Format: Journal Article
• Language: English
• Published: Mahwah Taylor & Francis 02.01.2019; Taylor & Francis Ltd
• Subjects: Cognitive ability; Computer applications; Geometric problem solving; Geometry; Metaphor; physical metaphors; Problem solving; Shortest-path problems; Spatial discrimination; spatial problem solving; spatial structure; spatial substrate; Strings
• ISSN: 1387-5868; 1573-9252; 1542-7633
• DOI: 10.1080/13875868.2018.1531415

Humans solve spatial and abstract problems more easily if these can be visualized and/or physically manipulated. We analyze the domain of geometric problem solving from a cognitive perspective and identify several levels of domain abstraction that interact in the problem solving process. We discuss the roles of physical manifestations of spatial configurations, their manipulation, and their perception for understanding problem solving processes. We propose an extension of the classical problem solving repertoire of constructive geometry to approach certain problems more directly than under the compass-and-straightedge paradigm. Specifically, we introduce strings and pins as helpful metaphors for a generalization of the constructive geometry approach. We present classical problems from spatial problem solving to illustrate the 'strings and pins' paradigm. Three case studies are discussed: strings-and-pins solutions to (i) the ellipse construction problem; (ii) the shortest path problem; and (iii) the angle trisection problem. Comparisons to formal solutions are drawn. Differences and similarities between the compass-and-straightedge paradigm and the strings-and-pins paradigm are analyzed. Features and limitations of constructive and depictive geometry as well as implications for computational approaches are discussed. The strings-and-pins domain is shown to be more general and less restrictive than the compass-and-straightedge domain.