ThesisBalas, KevinIn this thesis, we deal with problems involving finding the maximum area covered when packing rectangles into a bounding box, each containing a specified representative point. Given a set of n points in the unit square, U = [0, 1]^2, we choose n inter . . .
ArticleDumitrescu, AdrianFor points in the unit square , an anchored rectangle packing consists of interior-disjoint axis-aligned empty rectangles such that point is a corner of the rectangle (that is, is anchored at ) for . We show that for every set of points in , there is . . .
ArticleDumitrescu, AdrianFor points p1,…,pn in the unit square [0,1]2, an anchored rectangle packing consists of interior-disjoint axis-aligned empty rectangles r1,…,rn⊆[0,1]2 such that point pi is a corner of the rectangle ri (that is, ri is anchored at pi) for i=1,…,n. We s . . .