Graph Drawing via Gradient Descent, $$(GD)^2$$
From MaRDI portal
Publication:5014098
DOI10.1007/978-3-030-68766-3_1OpenAlexW3126659272MaRDI QIDQ5014098
Sabin Devkota, Reyan Ahmed, Mingwei Li, Felice De Luca, Stephen G. Kobourov
Publication date: 1 December 2021
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.05584
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
Connected-closeness: A Visual Quantification of Distances in Network Layouts ⋮ Visualizing evolving trees ⋮ Graph Drawing via Gradient Descent, $$(GD)^2$$
Uses Software
Cites Work
- Unnamed Item
- A heuristic approach towards drawings of graphs with high crossing resolution
- A greedy heuristic for crossing-angle maximization
- An algorithm for drawing general undirected graphs
- Stress-Plus-X (SPX) graph layout
- The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- The Rectilinear Crossing Number of K n : Closing in (or Are We?)
- Thirty Essays on Geometric Graph Theory
- The Straight-Line RAC Drawing Problem Is NP-Hard
- Evaluating Derivatives
- Graph Drawing via Gradient Descent, $$(GD)^2$$
- A Geometric Heuristic for Rectilinear Crossing Minimization
- Graph Drawing
- Shape-Based Quality Metrics for Large Graph Visualization
- Drawing 3-Polytopes with Good Vertex Resolution
This page was built for publication: Graph Drawing via Gradient Descent, $$(GD)^2$$
