36
[2025 Day 9] When you wake up and see lots of grey stars (thelemmy.club)
submitted 9 months ago* (last edited 9 months ago) by to c/advent_of_code@programming.dev
8 comments fedilink hide all child comments
 

It is only going to be downhill from here

you are viewing a single comment's thread
view the rest of the comments
[–] 1 point 9 months ago (2 children)

It was easy staight forward brtue force:

Spoiler

For each possible_rectange Find Max:
   If polygon.contains(rectangle) Then rectangle.area() Else 0

For speed the loop can be run paralelley.

I had no time to implent the contains myself, but pretty much all languages have a library already.

  • permalink
  • fedilink
  • source
  • hideshow 2 child comments
    •
  • [–] [S] 2 points 9 months ago (1 child)

    yea becomes trivial if one uses a polygon library (I did too) but looking at the actual polygon, one can cook up some clever heuristics to do it quite quickly with some basic checks I think.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 1 child comment
    •
  • [–] 1 point 9 months ago

    I'll check if someone created a guide for the clever solution, cos I'm interested. But I don't have nearly enough knowledge about geometry to came up with one myshelf. (nor energy after the 10 hour workdays in the last two weeks..)

  • permalink
  • fedilink
  • source
  • parent