Skip to main content
Have a personal or library account? Click to login
Shortest polygonal chains covering each planar square grid Cover

Shortest polygonal chains covering each planar square grid

Open Access
|Nov 2026
Read online

References

  1. [BBD+09] S. Bereg, P. Bose, A. Dumitrescu, F. Hurtado, and P. Valtr. Traversing a set of points with a minimum number of turns. Discrete & Computational Geometry, 41(4):513–532, 2009.
  2. [CWSK10] J. M. Chein, R. W. Weisberg, N.L. Streeter, and S. Kwok. Working memory and insight in the nine-dot problem. Memory & Cognition, 38(7):883–892, 2010.
  3. [Kes14] B. Keszegh. Covering paths and trees for planar grids. Geombinatorics Quarterly, 24(1):5–10, 2014.
  4. [KO01] T. C. Kershaw and S. Ohlsson. Training for insight: The case of the nine-dot problem. In Proceedings of the Annual Meeting of the Cognitive Science Society, volume 23, 2001.
  5. [Lev17] A. Levitin. Algorithmic puzzles: History, taxonomies, and applications in human problem solving. Journal of Problem Solving, 10(1):1–15, 2017.
  6. [Loy14] Sam Loyd. Cyclopedia of Puzzles. The Lamb Publishing Company, New York, 1914.
  7. [Peg] E. Pegg Jr. Mathpuzzle. https://www.mathpuzzle.com/dots.html. Accessed on July 5, 2022.
  8. [Rip20] M. Ripà. Solving the 106 years old 3k points problem with the clockwise-algorithm. Journal of Fundamental Mathematics and Applications, 3(2):84–97, 2020.
  9. [Wag06] D. P. Wagner. Path planning algorithms under the link-distance metric. PhD thesis, Dartmouth College Ph.D. Dissertations, Hanover, NH, 2006.
Language: English
Page range: 1 - 18
Published online: Nov 17, 2026
Published in print: Dec 1, 2026
Published by: Ludus Association
In partnership with: Paradigm Publishing Services

© 2026 Marco Ripà, published by Ludus Association
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.