**Reference**:- Man-Kwun Chiu, Erik D. Demaine, Yevhenii Diomidov, David Eppstein, Robert A. Hearn, Adam Hesterberg, Matias Korman, Irene Parada, and Mikhail Rudoy, “New Results in Sona Drawing: Hardness and TSP Separation”, in
*Proceedings of the 32nd Canadian Conference in Computational Geometry (CCCG 2020)*, Saskatchewan, Saskatoon, Canada, August 5–7, 2020. **Abstract**:-
Given a set of point sites, a sona drawing is a single closed curve, disjoint
from the sites and intersecting itself only in simple crossings, so that each
bounded region of its complement contains exactly one of the sites. We prove
that it is NP-hard to find a minimum-length sona drawing for
*n*given points, and that such a curve can be longer than the TSP tour of the same points by a factor > 1.5487875. When restricted to tours that lie on the edges of a square grid, with points in the grid cells, we prove that it is NP-hard even to decide whether such a tour exists. These results answer questions posed at CCCG 2006. **Comments**:- David Eppstein's presentation is available on YouTube.
**Availability**:- The paper is available in PDF (471k).
- See information on file formats.
- [Google Scholar search]

See also other papers by Erik Demaine.

Last updated November 19, 2021 by Erik Demaine.