this post was submitted on 14 Dec 2024
449 points (94.3% liked)
Map Enthusiasts
3594 readers
41 users here now
For the map enthused!
Rules:
-
post relevant content: interesting, informative, and/or pretty maps
-
be nice
founded 2 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Intelligence is knowing I could optimize this with annealing and a decent error function.
Wisdom is deciding not to get nerd-sniped like that.
I feel a tingling in my hands. An algorithm to optimize for n arbitrary polygons
I saw this and had flashbacks to a thousand Mona Lisas.
Apparently I am a fool.
What you'd do is, you pick a representative set of points from a world map, e.g. by reducing it to a low resolution, or by sampling with blue noise. Each point gets a 32-bit integer. For up to 32 circles, you check if each point is inside or outside the circle, and mark one bit accordingly. Every region created by these overlapping circles now has a unique ID for all points inside that region.
Scoring groups points by ID, finds whether each group contains more land or water points, and counts all the points outside that majority. That sum is your error.
Nerd Lemming snaps in 3 hours under zero pressure