Graph Drawing

DOI10.1007/B105810zbMath1111.68580OpenAlexW4206160220MaRDI QIDQ5711610

Yehuda Koren, Emden R. Gansner, Stephen C. North

Publication date: 7 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b105810

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (37)

Complex systems: features, similarity and connectivity ⋮ Visualizing the effects of a changing distance on data using continuous embeddings ⋮ A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing ⋮ An improved force-directed graph layout algorithm based on aesthetic criteria ⋮ Connected-closeness: A Visual Quantification of Distances in Network Layouts ⋮ Spherical graph drawing by multi-dimensional scaling ⋮ Shape-faithful graph drawings ⋮ An annotated review on graph drawing and its applications ⋮ A Sparse Stress Model ⋮ Node Overlap Removal by Growing a Tree ⋮ Visualizing evolving trees ⋮ A fast successive over-relaxation algorithm for force-directed network graph drawing ⋮ A quality metric for visualization of clusters in graphs ⋮ Stress-Plus-X (SPX) graph layout ⋮ An Experimental Study on the Ply Number of Straight-Line Drawings ⋮ An Experimental Study on the Ply Number of Straight-line Drawings ⋮ A force-directed algorithm for drawing directed graphs symmetrically ⋮ Anisotropic Radial Layout for Visualizing Centrality and Structure in Graphs ⋮ A regularized graph layout framework for dynamic network visualization ⋮ A greedy heuristic for crossing-angle maximization ⋮ Data-driven graph drawing techniques with applications for conveyor systems ⋮ Unnamed Item ⋮ The Binary Stress Model for Graph Drawing ⋮ Efficient Node Overlap Removal Using a Proximity Stress Model ⋮ An Experimental Study on Distance-Based Graph Drawing ⋮ Topology Preserving Constrained Graph Layout ⋮ Constrained Stress Majorization Using Diagonally Scaled Gradient Projection ⋮ On the perception of small sub-graphs ⋮ Balancing between the local and global structures (LGS) in graph embedding ⋮ The appeals of quadratic majorization-minimization ⋮ A simple visualization method for three-dimensional (3D) network ⋮ Visualizing large graphs ⋮ Constrained graph layout by stress majorization and gradient projection ⋮ Graph Drawing via Gradient Descent, $$(GD)^2$$ ⋮ Stochastic Gradient Descent Works Really Well for Stress Minimization ⋮ Exploring the Design Space of Aesthetics with the Repertory Grid Technique ⋮ New Quality Metrics for Dynamic Graph Drawing

This page was built for publication: Graph Drawing