I need an algorithm to detect free space on a 2D plane. As input I have a canvas (size) and a list of items (their bounding boxes). I want the biggest rectangle which does not intersect with any item (the biggest free space). It does not have to be perfect.
Random positioning is my fallback solution, but I want something better.

I don´t need code, just an idea or the name of an algorithm that provides this. For some reason i´m unable to find it myself (this is maybe the aftermath from the worldcup party )

Thanks