On Minimizing Wiggle in Stacked Area Charts

2025-06-26

AI Summary

This paper addresses the minimization of vertical boundary fluctuations (“wiggle”) in stacked area charts to enhance readability. We first establish, for the first time, that multiple wiggle-minimization variants are NP-hard and inapproximable (unless P = NP), and show their equivalence to the fundamental absolute prefix-sum minimization problem. To solve it exactly, we propose a mixed-integer linear programming (MILP) framework—rigorous in theory and computationally tractable in practice. Experiments on both real-world and synthetic datasets demonstrate that our method consistently outperforms existing heuristics, achieving 20–65% higher accuracy in wiggle reduction. This work provides the first computational complexity characterization, an optimal exact algorithm, and a verifiable performance benchmark for stacked area chart layout optimization.

Technology Category

• Constraint Satisfaction and Optimization: Other Foundations of Constraint Satisfaction
• Reasoning under Uncertainty: Stochastic Optimization
• Knowledge Representation and Reasoning: Computational Complexity of Reasoning

Application Category

• Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphs
• Web Mining and Content Analysis: Web data visualization
• Responsible Web: Human-perceived consequences of algorithmic deployment on the web

Abstract

Stacked area charts are a widely used visualization technique for numerical time series. The x-axis represents time, and the time series are displayed as horizontal, variable-height layers stacked on top of each other. The height of each layer corresponds to the time series values at each time point. The main aesthetic criterion for optimizing the readability of stacked area charts is the amount of vertical change of the borders between the time series in the visualization, called wiggle. While many heuristic algorithms have been developed to minimize wiggle, the computational complexity of minimizing wiggle has not been formally analyzed. In this paper, we show that different variants of wiggle minimization are NP-hard and even hard to approximate. We also present an exact mixed-integer linear programming formulation and compare its performance with a state-of-the-art heuristic in an experimental evaluation. Lastly, we consider a special case of wiggle minimization that corresponds to the fundamentally interesting and natural problem of ordering a set of numbers as to minimize their sum of absolute prefix sums. We show several complexity results for this problem that imply some of the mentioned hardness results for wiggle minimization.

Problem

• Analyzing computational complexity of minimizing wiggle in stacked area charts
• Proving NP-hardness and approximation hardness for wiggle minimization variants
• Exploring special cases and complexity of ordering numbers to minimize prefix sums

Innovation

• NP-hard analysis of wiggle minimization
• Exact mixed-integer linear programming solution
• Complexity results for prefix sums ordering