|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM366849832 |
| 003 |
DE-627 |
| 005 |
20240114233603.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
240114s2024 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TVCG.2024.3351479
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n1255.xml
|
| 035 |
|
|
|a (DE-627)NLM366849832
|
| 035 |
|
|
|a (NLM)38194373
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Giovannangeli, Loann
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Overlap Removal by Stochastic Gradient Descent with(out) Shape Awareness
|
| 264 |
|
1 |
|c 2024
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Revised 09.01.2024
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status Publisher
|
| 520 |
|
|
|a In many 2D visualizations, data points are projected without considering their surface area, although they are often represented as shapes in visualization tools. These shapes support the display of information such as labels or encode data with size or color. However, inappropriate shape and size selections can lead to overlaps that obscure information and hinder the visualization's exploration. Overlap Removal (OR) algorithms have been developed as a layout post-processing solution to ensure that the visible graphical elements accurately represent the underlying data. As the original data layout contains vital information about its topology, it is essential for OR algorithms to preserve it as much as possible. This article presents an extension of the previously published FORBID algorithm by introducing a new approach that models OR as a joint stress and scaling optimization problem, utilizing efficient stochastic gradient descent. The goal is to produce an overlap-free layout that proposes a compromise between compactness (to ensure the encoded data is still readable) and preservation of the original layout (to preserve the structures that convey information about the data). Additionally, this article proposes SORDID, a shape-aware adaptation of FORBID that can handle the OR task on data points having any polygonal shape. Our approaches are compared against state-of-the-art algorithms, and several quality metrics demonstrate their effectiveness in removing overlaps while retaining the compactness and structures of the input layouts
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Lalanne, Frederic
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Giot, Romain
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Bourqui, Romain
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on visualization and computer graphics
|d 1996
|g PP(2024) vom: 09. Jan.
|w (DE-627)NLM098269445
|x 1941-0506
|7 nnns
|
| 773 |
1 |
8 |
|g volume:PP
|g year:2024
|g day:09
|g month:01
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TVCG.2024.3351479
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d PP
|j 2024
|b 09
|c 01
|