Mixed Integer Optimization for Layout Arrangement

Arranging geometric entities in a two-dimensional layout is a common task for most information visualization applications, where existing algorithms typically rely on heuristics to position shapes such as boxes or discs in a visual space. Geometric entities are used as a visual resource to convey information contained in data such as textual documents or videos and the challenge is to place objects with similar content close to each other while still avoiding overlap. In this work we present a novel mechanism to arrange rectangular boxes in a two-dimensional layout which copes with the two properties above, that is, it keeps similar object close and prevents overlap. In contrast to heuristic techniques, our approach relies on mixed integer quadratic programming, resulting in well structured arrangements which can be easily be tuned to take different forms. We show the effectiveness of our methodology through a comprehensive set of comparisons against state-of-art methods. Moreover, we employ the proposed technique in video data visualization, attesting its usefulness in a practical application.

[1]  Peter J. Stuckey,et al.  Fast Node Overlap Removal , 2005, GD.

[2]  Bongshin Lee,et al.  ManiWordle: Providing Flexible Control over Wordle , 2010, IEEE Transactions on Visualization and Computer Graphics.

[3]  Qiang Du,et al.  Centroidal Voronoi Tessellations: Applications and Algorithms , 1999, SIAM Rev..

[4]  Ioannis G. Tollis,et al.  Graph Drawing , 1994, Lecture Notes in Computer Science.

[5]  Haim Levkowitz,et al.  Least Square Projection: A Fast High-Precision Multidimensional Projection Technique and Its Application to Document Mapping , 2008, IEEE Transactions on Visualization and Computer Graphics.

[6]  Maria Cristina Ferreira de Oliveira,et al.  An incremental space to visualize dynamic data sets , 2010, Multimedia Tools and Applications.

[7]  Peter J. Stuckey,et al.  Removing Node Overlapping in Graph Layout Using Constrained Optimization , 2003, Constraints.

[8]  Augusto Celentano Proceedings of the working conference on Advanced visual interfaces , 2006 .

[9]  Martin Wattenberg,et al.  Participatory Visualization with Wordle , 2009, IEEE Transactions on Visualization and Computer Graphics.

[10]  Luis Gustavo Nonato,et al.  Local Affine Multidimensional Projection , 2011, IEEE Transactions on Visualization and Computer Graphics.

[11]  Carla Maria Dal Sasso Freitas,et al.  Design and Evaluation of MagnetViz—A Graph Visualization Tool , 2012, IEEE Transactions on Visualization and Computer Graphics.

[12]  Daniel A. Keim,et al.  Rolled‐out Wordles: A Heuristic Method for Overlap Removal of 2D Data Representatives , 2012, Comput. Graph. Forum.

[13]  Jen-Hui Chuang,et al.  Drawing Graphs with Nonuniform Nodes Using Potential Fields , 2003, Graph Drawing.

[14]  Junbin Gao,et al.  A new algorithm for removing node overlapping in graph visualization , 2007, Inf. Sci..

[15]  Gerard Salton,et al.  A vector space model for automatic indexing , 1975, CACM.

[16]  David Harel,et al.  Drawing graphs with non-uniform vertices , 2002, AVI '02.

[17]  Ernesto G. Birgin,et al.  Symmetry-breaking constraints for packing identical rectangles within polyhedra , 2013, Optim. Lett..

[18]  Rafael Lazimy,et al.  Mixed-integer quadratic programming , 1982, Math. Program..

[19]  Marco A. Boschetti,et al.  The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case , 2003, 4OR.

[20]  Sven Leyffer,et al.  Mixed Integer Nonlinear Programming , 2011 .

[21]  Kozo Sugiyama,et al.  Layout Adjustment and the Mental Map , 1995, J. Vis. Lang. Comput..