Paths with No Small Angles
暂无分享,去创建一个
Giving a (partial) solution to a problem of Fekete [Geometry and the Traveling Salesman Problem, Ph.D. thesis, University of Waterloo, Waterloo, ON, Canada, 1992] and Fekete and Woeginger [Comput. Geom., 8 (1997), pp. 195-218], we show that given a finite set $X$ of points in the plane, it is possible to find a polygonal path with $|X|-1$ segments and with vertex set $X$ so that every angle on the polygonal path is at least $\pi/9$. According to a conjecture of Fekete and Woeginger, $\pi/9$ can be replaced by $\pi/6$. Previously, the result has not been known with any positive constant. We show further that the same result holds, with an angle smaller than $\pi/9$, in higher dimensions.
[1] Gerhard J. Woeginger,et al. Angle-Restricted Tours in the Plane , 1997, Comput. Geom..
[2] David G. Kirkpatrick,et al. The Ultimate Planar Convex Hull Algorithm? , 1986, SIAM J. Comput..
[3] Bettina Speckmann,et al. Maximizing Maximal Angles for Plane Straight-Line Graphs , 2007, WADS.
[4] Pavel Valtr,et al. Paths with no Small Angles , 2008, LATIN.