Interesting Quanta article explaining the "universal covering problem", aka finding the smallest convex region that can cover an entire set of shapes; even restricting to shapes of "diameter 1" still leaves a tough unsolved problem in

Sign in to participate in the conversation

The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!