Question: Clever cutter 3

Let a convex polygon, for example Q:=polygon([[0,2],[1,4],[4,4],[5,1],[3,0]]), be given.
How to find the disk of the biggest radius which is contained in Q?
How to find the disk of the smallest radius which contains Q? Of course, with Maple.

Please Wait...