GASP is a new algorithm that draws Reeb graphs of 2-manifold scalar fields so they hug the shape's boundary, stay compact, and align with the function's gradient, beating TTK's barycenter layout in evaluation.
D3tw: Discriminative differ- entiable dynamic time warping for weakly supervised action alignment and segmentation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.GR 1years
2025 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs
GASP is a new algorithm that draws Reeb graphs of 2-manifold scalar fields so they hug the shape's boundary, stay compact, and align with the function's gradient, beating TTK's barycenter layout in evaluation.