Metraipolis › archive › dc_73e8ffdfc305

How to Simplify a Line Chart: A Taxonomy and Feature-Based Evaluation — arXiv:2611.00179

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.00179
License (as archived)
CC0-1.0
Archived
2026-11-03T18:34:46.170Z
SHA-256 of the archived text
df960b2836b497b9722a60e60ba821c05627fb18606d80b4f28739702eb7cfd4
Stable URL of this page
https://metraipolis.com/documento/dc_73e8ffdfc305

How to cite

How to Simplify a Line Chart: A Taxonomy and Feature-Based Evaluation — arXiv:2611.00179 — arXiv (en), https://arxiv.org/abs/2611.00179 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_73e8ffdfc305 (Metraipolis archive dc_73e8ffdfc305, sha256 df960b2836b497b9722a60e60ba821c05627fb18606d80b4f28739702eb7cfd4)
BibTeX
@misc{dc73e8ffdfc305,
  title = {How to Simplify a Line Chart: A Taxonomy and Feature-Based Evaluation — arXiv:2611.00179},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.00179},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_73e8ffdfc305; sha256 df960b2836b497b9722a60e60ba821c05627fb18606d80b4f28739702eb7cfd4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00179. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Simplifying large or noisy time-series is often a prerequisite for producing interpretable line charts, yet existing methods vary widely in how they alter visual features such as trends, extrema, periodicity, curvature, roughness, and overall complexity. We introduce a feature-based taxonomy of line chart simplification that evaluates 19 commonly used algorithms across three families: Transformers, Reducers, and Aggregators. We also formalize 12 perceptually motivated, computationally defined visual features commonly used when analyzing time-series in line charts. We assess preservation using multiple similarity metrics per feature to capture different aspects of fidelity, yielding 21 distinct feature-preservation measurements. To capture the trade-off between fidelity and simplicity, we introduce a Feature--Complexity (FC) score that combines feature preservation with complexity. Our systematic evaluation on 80 datasets reveals distinct family-level patterns: Transformers such as Gaussian, Mean, and Median filters achieve A-mode grades on nearly all metrics but retain full temporal resolution; Reducers such as Douglas-Peucker and M4 receive predominantly D-F mode grades trading fidelity for a reduction in the number of rendered points; and Aggregators ASAP and PAA occupy a middle ground with primarily B-C mode grades. We further characterize the predictability of algorithm behavior across datasets: some methods produce consistent grades regardless of dataset type (Gaussian, Mean, Douglas-Peucker), while others exhibit high data-dependency, with performance varying substantially based on dataset characteristics (FPCS, ASAP). An interactive website supporting exploration of all evaluated techniques, datasets, and results is available at this https URL .

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.HC, nuovi lavori del giorno).
Categorie arXiv: Human-Computer Interaction (cs.HC) ; Computer Vision and Pattern Recognition (cs.CV); Graphics (cs.GR).
Pagina del lavoro: https://arxiv.org/abs/2611.00179 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:12:37.959Z dalla pagina https://arxiv.org/list/cs.HC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).