On minimal-displacement overlap removal

Research output: Contribution to conferencePoster

134 Downloads (Pure)


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.
Original languageEnglish
Number of pages2
Publication statusPublished - 2018
EventIEEE VIS 2018 - Berlin, Germany
Duration: 21 Oct 201826 Oct 2018


ConferenceIEEE VIS 2018


Dive into the research topics of 'On minimal-displacement overlap removal'. Together they form a unique fingerprint.

Cite this