Pith. sign in

REVIEW 1 cited by

Crossing Minimization in Time Interval Storylines

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2302.14213 v1 pith:3YOOTEGJ submitted 2023-02-28 cs.CG

classification cs.CG
keywords interactionstimestorylinescharacterscurvesintervalsmethodsoften
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Storyline visualizations are a popular way of visualizing characters and their interactions over time: Characters are drawn as x-monotone curves and interactions are visualized through close proximity of the corresponding character curves in a vertical strip. Existing methods to generate storylines assume a total ordering of the interactions, although real-world data often do not contain such a total order. Instead, multiple interactions are often grouped into coarser time intervals such as years. We exploit this grouping property by introducing a new model called storylines with time intervals and present two methods to minimize the number of crossings and horizontal space usage. We then evaluate these algorithms on a small benchmark set to show their effectiveness.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Optimizing Wiggle in Storylines

    cs.DS 2025-08 conditional novelty 6.0 of 10

    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 p...

Pith tools