Ancestors

Written by thinkbeforecoding on 2024-12-12 at 09:38

Today was not really easy.

My strategy:

• de-duplicate area letters using a fill algorithm
• finding areas is the easy
• for each area, find all neighbors area
• find top-left corner and follow to count border, remove external neighbors
• for remaining neighbors (holes), find top left corner and follow inner border, remove internal neighbors until all internal neighbors have been seen

=> More informations about this toot | More toots from thinkb4coding@mastodon.social

Toot

Written by J. on 2024-12-13 at 13:19

@thinkb4coding

I tried a few approaches, in the end I walked the cells recursively and stored oriented segments for each side not adjacent to another of the same plot, grouping the segments by region.

After walking the whole grid, it's just a matter of merging the contiguous segments for each region. The hard part for me was figuring out the special case with a cross-like junction.

Still a pretty difficult one compared to the previous ones this year.

=> More informations about this toot | More toots from jadam_fr@hachyderm.io

Descendants