Document

# Optimizing Symbol Visibility Through Displacement

## File

LIPIcs.SWAT.2024.24.pdf
• Filesize: 3.23 MB
• 16 pages

## Acknowledgements

This research was initiated at the 19th Gremo’s Workshop on Open Problems (GWOP), Binn, Switzerland, June 13-17, 2022.

## Cite As

Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann, and Miloš Stojaković. Optimizing Symbol Visibility Through Displacement. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 24:1-24:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.SWAT.2024.24

## Abstract

In information visualization, the position of symbols often encodes associated data values. When visualizing data elements with both a numerical and a categorical dimension, positioning in the categorical axis admits some flexibility. This flexibility can be exploited to reduce symbol overlap, and thereby increase legibility. In this paper we initialize the algorithmic study of optimizing symbol legibility via a limited displacement of the symbols. Specifically, we consider unit square symbols that need to be placed at specified y-coordinates. We optimize the drawing order of the symbols as well as their x-displacement, constrained within a rectangular container, to maximize the minimum visible perimeter over all squares. If the container has width and height at most 2, there is a point that stabs all squares. In this case, we prove that a staircase layout is arbitrarily close to optimality and can be computed in O(nlog n) time. If the width is at most 2, there is a vertical line that stabs all squares, and in this case, we give a 2-approximation algorithm (assuming fixed container height) that runs in O(nlog n) time. As a minimum visible perimeter of 2 is always trivially achievable, we measure this approximation with respect to the visible perimeter exceeding 2. We show that, despite its simplicity, the algorithm gives asymptotically optimal results for certain instances.

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Computational geometry
##### Keywords
• symbol placement
• visibility
• jittering
• stacking order

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Michael A. Bekos, Benjamin Niedermann, and Martin Nöllenburg. External labeling techniques: A taxonomy and survey. Computer Graphics Forum, 38(3):833-860, 2019.
2. Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, and Jules Wulms. Worbel: Aggregating point labels into word clouds. ACM Transactions on Spatial Algorithms and Systems, 9(3), 2023. URL: https://doi.org/10.1145/3603376.
3. Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, and Bettina Speckmann. Algorithmic aspects of proportional symbol maps. Algorithmica, 58(3):543-565, 2010.
4. Thomas Depian, Guangping Li, Martin Nöllenburg, and Jules Wulms. Transitions in Dynamic Point Labeling. In Proceedings of the 12th International Conference on Geographic Information Science (GIScience 2023), volume 277 of Leibniz International Proceedings in Informatics (LIPIcs), pages 2:1-2:19, 2023. URL: https://doi.org/10.4230/LIPIcs.GIScience.2023.2.
5. Danny Dorling. Area Cartograms: their Use and Creation, volume 59 of Concepts and Techniques in Modern Geography. University of East Anglia, 1996.
6. Tim Dwyer, Kim Marriott, and Peter J. Stuckey. Fast node overlap removal. In Proceedings of the International Symposium on Graph Drawing, LNCS 3843, pages 153-164, 2005.
7. Jiří Fiala, Jan Kratochvíl, and Andrzej Proskurowski. Systems of distant representatives. Discrete Applied Mathematics, 145(2):306-316, 2005.
8. Michael Formann and Frank Wagner. A packing problem with applications to lettering of maps. In Proceedings of the 7th Annual Symposium on Computational Geometry, pages 281-288, 1991.
9. Loann Giovannangeli, Frédéric Lalanne, Romain Giot, and Romain Bourqui. Guaranteed visibility in scatterplots with tolerance. IEEE Transactions on Visualizations and Computer Graphics, to appear, 2023.
10. Erick Gomez-Nieto, Wallace Casaca, Luis Gustavo Nonato, and Gabriel Taubin. Mixed integer optimization for layout arrangement. In Proceedings of the Conference on Graphics, Patterns and Images, pages 115-122, 2013.
11. Daichi Hirono, Hsiang-Yun Wu, Masatoshi Arikawa, and Shigeo Takahashi. Constrained optimization for disoccluding geographic landmarks in 3D urban maps. In Proceedings of the 2013 IEEE Pacific Visualization Symposium, pages 17-24, 2013.
12. Kim Marriott, Peter Stuckey, Vincent Tam, and Weiqing He. Removing node overlapping in graph layout using constrained optimization. Constraints, 8(2):143-171, 2003.
13. Wouter Meulemans. Efficient optimal overlap removal: Algorithms and experiments. Computer Graphics Forum, 38(3):713-723, 2019.
14. Soeren Nickel, Max Sondag, Wouter Meulemans, Stephen Kobourov, Jaakko Peltonen, and Martin Nöllenburg. Multicriteria optimization for dynamic Demers cartograms. IEEE Transactions on Visualization and Computer Graphics, 28(6):2376-2387, 2022.
15. Gabriel Nivasch, János Pach, and Gábor Tardos. The visible perimeter of an arrangement of disks. Computational Geometry, 47(1):42-51, 2014.
16. Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Takeaki Uno, and Alexander Wolff. Labeling points with weights. Algorithmica, 38(2):341-362, 2004. URL: https://doi.org/10.1007/s00453-003-1063-0.
17. Nadine Schwartges, Jan-Henrik Haunert, Alexander Wolff, and Dennis Zwiebler. Point labeling with sliding labels in interactive maps. In Joaquín Huerta, Sven Schade, and Carlos Granell, editors, Connecting a Digital Europe Through Location and Place, pages 295-310. Springer International Publishing, 2014. URL: https://doi.org/10.1007/978-3-319-03611-3_17.
18. Hendrik Strobelt, Marc Spicker, Andreas Stoffel, Daniel Keim, and Oliver Deussen. Rolled-out Wordles: A heuristic method for overlap removal of 2D data representatives. Computer Graphics Forum, 31(3pt3):1135-1144, 2012.
19. Mereke van Garderen. Pictures of the Past - Visualization and visual analysis in archaeological context. PhD thesis, Universität Konstanz, 2018.
20. Mereke van Garderen, Barbara Pampel, Arlind Nocaj, and Ulrik Brandes. Minimum-displacement overlap removal for geo-referenced data visualization. Computer Graphics Forum, 36(3):423-433, 2017.
21. Marc van Kreveld, Tycho Strijk, and Alexander Wolff. Point labeling with sliding labels. Computational Geometry, 13(1):21-47, 1999.
22. Claus O. Wilke. Fundamentals of data visualization: a primer on making informative and compelling figures. O'Reilly Media, 2019.
X

Feedback for Dagstuhl Publishing

Feedback submitted

### Could not send message

Please try again later or send an E-mail