This MR replaces the grouping function that is used to define the windows in which presentation graphics are drawn.
The new algorithm performs a search for a set of two windows that minimizes the total drawing area. The optimal solution may be to split in the middle of a bitmap: in the middle of a sentence!
There is no negative performance impact by this aggressive approach. The current grouping algorithm tends to perform worse as it brute forces a solution on some inferred (and constrained) structure which may be obtained only after several iterations.
This MR replaces the grouping function that is used to define the windows in which presentation graphics are drawn. The new algorithm performs a search for a set of two windows that minimizes the total drawing area. The optimal solution may be to split in the middle of a bitmap: in the middle of a sentence!
There is no negative performance impact by this aggressive approach. The current grouping algorithm tends to perform worse as it brute forces a solution on some inferred (and constrained) structure which may be obtained only after several iterations.