تقرير
FORBID: Fast Overlap Removal By stochastic gradIent Descent for Graph Drawing
| العنوان: | FORBID: Fast Overlap Removal By stochastic gradIent Descent for Graph Drawing |
|---|---|
| المؤلفون: | Giovannangeli, Loann, Lalanne, Frederic, Giot, Romain, Bourqui, Romain |
| سنة النشر: | 2022 |
| المجموعة: | Computer Science |
| مصطلحات موضوعية: | Computer Science - Computational Geometry, Computer Science - Graphics, Computer Science - Machine Learning |
| الوصف: | While many graph drawing algorithms consider nodes as points, graph visualization tools often represent them as shapes. These shapes support the display of information such as labels or encode various data with size or color. However, they can create overlaps between nodes which hinder the exploration process by hiding parts of the information. It is therefore of utmost importance to remove these overlaps to improve graph visualization readability. If not handled by the layout process, Overlap Removal (OR) algorithms have been proposed as layout post-processing. As graph layouts usually convey information about their topology, it is important that OR algorithms preserve them as much as possible. We propose a novel algorithm that models OR as a joint stress and scaling optimization problem, and leverages efficient stochastic gradient descent. This approach is compared with state-of-the-art algorithms, and several quality metrics demonstrate its efficiency to quickly remove overlaps while retaining the initial layout structures. Comment: Appears in the Proceedings of the 30th International Symposium on Graph Drawing and Network Visualization (GD 2022) |
| نوع الوثيقة: | Working Paper |
| DOI: | 10.1007/978-3-031-22203-0_6 |
| URL الوصول: | http://arxiv.org/abs/2208.10334 |
| رقم الأكسشن: | edsarx.2208.10334 |
| قاعدة البيانات: | arXiv |
| DOI: | 10.1007/978-3-031-22203-0_6 |
|---|