The edge-uncrossing algorithm in d3-dag (and Sugiyama in general) is known to run superlinearly (how bad?) to the edges it has to uncross.

2025-06-26T18:03:51Z

[RESOLVED] Sense Atlas can sometimes be unusably slow.

https://github.com/erikbrinkman/d3-dag

Implement the edge-uncrossing portion of the layout algorithm in a faster language (Rust?) that can be compiled to WASM.

Police d3-dag for any obvious implementation flaws that can be optimized out.

Sense Atlas Front End

The (coarse-grained) layout for the Sugiyama visualization only has to be computed when the state of the graph (actually, subgraph) changes.

The edge-uncrossing algorithm in d3-dag (and Sugiyama in general) is known to run superlinearly (how bad?) to the edges it has to uncross.

While the graph layout is being computed, consider some kind of progress bar or analogous animation to show the user something is happening.