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.
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…)
![[2025 Day 9] When you wake up and see lots of grey stars](https://programming.dev/pictrs/image/9303f4a6-7e6c-4e14-aa0e-324bf0a303f5.png){kind=link}
It was
easystaight forward brtue force:Spoiler
For each possible_rectange Find Max: If polygon.contains(rectangle) Then rectangle.area() Else 0For 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.
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.
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…)