I got trouble need your help:
I'm working on a program that shows n
videos in tiling mode (aka, videos wall, c
columns and r
rows). The n
is arbitrary, the videos have same size (W x H
) and we have W / H
ratio, the size of wall is fixed, how can I get best set of c
, r
, W
and H
when n
changes? The best set defined as: W
and H
is maximum values and videos fill maximum area of the wall.
I have taken a look at Packing Problem but still can't solve my problem above, can someone help me this? Thank you very much!
See Question&Answers more detail:os