Coding Challenge: Minkowski Sum to thicken convex polygons

[dandersod]

I'd love to see how to implement a minkowski sum for a convex polygon and a circle so that you could thicken the polygon. Here's a youtube link with a visual description of the result. The reason that I came across this was I was trying to replicate the AMAZING work of Jessica Rosenkrantz's N-E-R-V-O-U-S geode puzzles. So you'd have to find the minkowski sum of a polygon, and then find the minkowski sum of the previous step ... .

[mike239x]

If you want to replicate those pictures of geode puzzles you should also take non-convex polygons. Also, I think it would be better to implement a way to make parallel curves for this task. Last but not least, I think there is a way to cheese the whole thing by changing strokeWeight --- starting with some insanely big values and changing it step by step for each layer. The problem there will be that you will also get some stuff drawn outside, but this can also be fixed.

[mike239x]

@dandersod Here is an example of that cheese I described. Also, here is the sourcecode. I still need to make the color palette somehow better + there are some other things in the code that I find a bit weird, but overall, it works.