My problem is finding the longest line segment completely inside of an arbitrary polygon (so it's not necessarily convex). That line can start and end on any point located on the outline of the polygon (so I'm not only considering the vertices).
I have trouble to even find some kind of source for literature or something on this topic.
Can anyone help me with this or point me to some sources?
