Talk:Star-shaped polygon

Max number of segments to reach any point

I think there is a term for the maximum number of segments necessary to go, entirely within the polygon, from any point to any other point in the polygon. In a convex polygon this parameter = 1, and for a nonconvex star-shaped polygon it = 2. Does anyone know what this parameter is called? 208.50.124.65 (talk) 20:03, 26 June 2014 (UTC)[reply]

Link distance (between two points) or link diameter (max over all pairs of points), I believe. At least that's the computational geometry term for it; the same concept may go under a different name elsewhere. We should probably have an article on it. —David Eppstein (talk) 22:04, 26 June 2014 (UTC)[reply]

Self-link "other uses"

This article has "for other uses see Kernel (geometry)" at the top, but that just redirects back to this page. Cai (talk) 14:28, 30 April 2019 (UTC)[reply]