Wu, Niederman, Takahashi and Nöllenburg – A SURVEY ON COMPUTING SCHEMATIC NETWORK MAPS 2022
£0.00
A downloadable PDF file for your personal use.
Description
This recent, 7-page academic survey, published on arXiv in August 2022, offers a comprehensive and up-to-date overview of algorithmic approaches for computing schematic network maps. Authored by an international team from TU Wien, University of Bonn, and University of Aizu, it specifically focuses on advancements made since 2014. The paper systematically analyzes the critical trade-off between computational complexity, layout quality, and interactivity, visually depicting these correlations through informative scatter plot diagrams (Figures 1-3). It covers both network layout and station labeling techniques, discussing their applicability in various domains, including data visualization metaphors. This well-referenced and trustworthy resource provides an excellent state-of-the-art summary and outlines promising future research directions in interactive schematic mapping.
Additional information
| Pages | 7 |
|---|---|
| Filesize | 0.1Mb |





