Inspired by the recently-introduced slanted orthogonal graph drawing model, we introduce and study planar Kandinsky drawings with almost-empty faces (i.e., faces that were forbidden in the classical Kandinsky model). Based on a recent NP-completeness result for Kandinsky drawings by Bläsius et al., we present and experimentally evaluate (i) an ILP that computes bend-optimal Kandinsky drawings with almost-empty faces, and, (ii) a more efficient heuristic that results in drawings with relatively few bends. Our evaluation shows that the new model, in the presence of many triangular faces, not only improves the number of bends, but also the compactness of the resulting drawings.
CITATION STYLE
Bekos, M. A., Kaufmann, M., Krug, R., & Siebenhaller, M. (2015). The effect of almost-empty faces on planar Kandinsky drawings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9125, pp. 352–364). Springer Verlag. https://doi.org/10.1007/978-3-319-20086-6_27
Mendeley helps you to discover research relevant for your work.