Conversation

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? :)

"convex hull" is a misnomer, based on your description. It sounds like you actually want the minimal circumscribing n-gon.

Yes, you're right. Thank you.

It's necessarily at least as big as the diameter of the set (which you can get by walking the vertices of the convex hull).

but unfortunately that's not a tight bound. I don't know an elegant way to get it off the top of my head.

You can get close by starting with the n-gon that spans the diameter and growing it if any points are outside.

but that process *won't* get you the minimal one in general.

Replying to

Gotcha. Good thing to try, at least. I don't *necessarily* need the minimal. Thanks!