Word2VecGD uses embeddings with a cosine‑stress function, skipping all‑pairs shortest‑path calculations and keeps structure. Tests show comparable layouts on graphs with millions nodes. https://getnews.me/word2vecgd-neural-graph-drawing-using-cosine-stress-optimization/ #graphdrawing #embeddings

Explore and experiment freely with various samples on our yFiles playground! Check it out at yfiles.com/play

What examples would you like to see? Share your ideas with us.

#DataVisualization #GraphDrawing #DeveloperTools #InteractiveDiagrams #DataAnalysis #VisualizationTools #GraphAlgorithms

Researchers present a variant of Levi's Enlargement Lemma: an x‑monotone curve can join any two points with x‑coordinates, intersecting each pseudosegment once, enabling a complete graph. https://getnews.me/new-proof-extends-simple-monotone-graph-drawings-to-complete-graphs/ #graphdrawing #monotone

Researchers proved the unweighted one‑sided local crossing minimization problem is NP‑hard and that the median heuristic still gives a 3‑approximation, per a paper submitted Sep 30 2025. https://getnews.me/local-crossing-minimization-np-hard-median-heuristic-3-approx/ #graphdrawing #nphard

Parallel OSCM algorithms on a 16‑core workstation (32 threads) achieved a near‑19‑fold speedup, nearing linear scaling despite synchronization overhead. Read more: https://getnews.me/parallel-approaches-boost-one-sided-crossing-minimization-speed/ #graphdrawing #parallelcomputing

New variants BH‑tsNET, FIt‑tsNET and L‑tsNET cut tsNET runtime by up to 98.6%, with BH‑tsNET achieving a 93.5% speedup and L‑tsNET a 98.6% gain, while preserving visual quality. Read more: https://getnews.me/fast-tsnet-algorithms-boost-large-graph-drawing-performance/ #graphdrawing #tsnet #algorithm

Researchers unveiled three UMAP‑based graph drawing methods—SS‑GUMAP, SL‑GUMAP and SSSL‑GUMAP—offering up to 80% faster layouts with less than 15% quality loss. Read more: https://getnews.me/fast-umap-based-algorithms-accelerate-large-scale-graph-drawing/ #graphdrawing #umap

The ‘uncrossed collection’ method ensures each edge is crossing‑free in at least one drawing. Presented at GD 2023, the uncrossed crossing number is NP‑hard; latest version posted 22 Sep 2025. https://getnews.me/new-study-introduces-uncrossed-collections-for-graph-drawing/ #graphdrawing #uncrossed