I want to construct the minimal convex hull of some n points such that the hull is a regular polygon of degree n. Math friends, pointers? :)
Conversation
Replying to
Ah, yes! The last of these in particular seems close…
Basically trying to find minimal circumscribing n-gon
Replying to
for an approximation, you could use Megiddo's algorithm for smallest circle and then circumscribe+shrink an n-gon about that
2
Yeah, that's a good strategy! I do know the minimal diameter of the n-gon (it's the diameter of the convex hull), so that helps.
1
Show replies