In the context of visualizing spatial data using proportional symbols, the following problem often arises: given a set of overlapping squares of varying sizes, reposition the squares as to remove the overlap while minimizing the displacement of the squares, constrained to maintain the orthogonal order. Though this problem is NP-hard, we show that rotating the squares by 45 degrees into diamonds allows for a linear or convex quadratic program and is thus efficiently solvable even for relatively large instances.
|Number of pages||2|
|Publication status||Published - 2018|
|Event||IEEE VIS 2018 - Berlin, Germany|
Duration: 21 Oct 2018 → 26 Oct 2018
|Conference||IEEE VIS 2018|
|Period||21/10/18 → 26/10/18|