With fixed character orderings, linear and quadratic wiggle height minimization are polynomial-time via LP/QP, while wiggle count minimization is NP-complete; a new curve-routing method and railway use case are also presented.
Card, and Jeffrey Heer
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimizing Wiggle in Storylines
With fixed character orderings, linear and quadratic wiggle height minimization are polynomial-time via LP/QP, while wiggle count minimization is NP-complete; a new curve-routing method and railway use case are also presented.