New answers tagged

1 vote

Finding the point within a convex n-gon that maximizes the least angle subtended there by an edge of the n-gon

This is about existence for both the max-min angle and the min-max angle problem. Existence of the optimiser is not immediately obvious for both, since the objective functions are combinations of ...
Pietro Majer's user avatar
  • 56.6k
1 vote
Accepted

Finding the point within a convex n-gon that maximizes the least angle subtended there by an edge of the n-gon

This is about the issue of uniqueness, with a slight reformulation of the problem in view of an algorithmic approach. Given a (closed) half-plane, a segment $e$ of its boundary, and $0<\theta<\...
Pietro Majer's user avatar
  • 56.6k

Top 50 recent answers are included