Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2310.01147 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908373094498304 |
|---|---|
| author | Gärtner, Bernd Kalani, Vishwas Reddy, Meghana M. Meulemans, Wouter Speckmann, Bettina Stojaković, Miloš |
| author_facet | Gärtner, Bernd Kalani, Vishwas Reddy, Meghana M. Meulemans, Wouter Speckmann, Bettina Stojaković, Miloš |
| contents | 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 closed 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(n\log n)$ time. If the width is at most $2$, there is a vertical line that stabs all squares, and in this case, we design a 2-approximation algorithm (assuming fixed container height) that runs in $O(n\log n)$ time. As it turns out that a minimum visible perimeter of 2 is always achievable with a generic construction, 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_01147 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Optimizing Symbol Visibility through Displacement Gärtner, Bernd Kalani, Vishwas Reddy, Meghana M. Meulemans, Wouter Speckmann, Bettina Stojaković, Miloš Computational Geometry 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 closed 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(n\log n)$ time. If the width is at most $2$, there is a vertical line that stabs all squares, and in this case, we design a 2-approximation algorithm (assuming fixed container height) that runs in $O(n\log n)$ time. As it turns out that a minimum visible perimeter of 2 is always achievable with a generic construction, 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. |
| title | Optimizing Symbol Visibility through Displacement |
| topic | Computational Geometry |
| url | https://arxiv.org/abs/2310.01147 |