Empirical evaluation of aesthetics-based graph layout
From MaRDI portal
Recommendations
Cited in
(42)- Heuristics for laying out information graphs
- HV-planarity: algorithms and complexity
- Aesthetic discrimination of graph layouts
- Right angle crossing graphs and 1-planarity
- Testing gap \(k\)-planarity is NP-complete
- Layered drawing of undirected graphs with generalized port constraints
- ChordLink: a new hybrid visualization model
- An annotated bibliography on 1-planarity
- Upward and quasi-upward planarity testing of embedded mixed graphs
- Experimenting with aesthetics-based graph layout
- Are crossings important for drawing large graphs?
- An experimental study on the ply number of straight-line drawings
- On multi-objective optimization aided drawing of special graphs
- Towards an aesthetic invariant for graph drawing
- The straight-line RAC drawing problem is NP-hard
- Drawing Graphs with Right Angle Crossings
- A User Study in Similarity Measures for Graph Drawing
- Graph Layout Aesthetics in UML Diagrams: User Preferences
- Graphs in software visualization
- User preference of graph layout aesthetics: A UML study
- An experimental study on the ply number of straight-line drawings
- Experimental analysis of the accessibility of drawings with few segments
- A ground-truthing tool for layout analysis performance evaluation
- Experimental analysis of the accessibility of drawings with few segments
- Exploring the Design Space of Aesthetics with the Repertory Grid Technique
- Aesthetic Discrimination of Graph Layouts
- Every outer-1-plane graph has a right angle crossing drawing
- scientific article; zbMATH DE number 7651192 (Why is no real title available?)
- Graph Drawing
- On RAC drawings of graphs with one bend per edge
- Crossing numbers of beyond-planar graphs
- On RAC drawings of graphs with one bend per edge
- Crossing numbers of beyond-planar graphs
- On time and space: an experimental study on graph structural and temporal encodings
- Visual Causality: Investigating Graph Layouts for Understanding Causal Processes
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Evaluating animation parameters for morphing edge drawings
- Simultaneous drawing of layered trees
- Drawing graphs with right angle crossings
- Planar stories of graph drawings: algorithms and experiments
- Structural parameterizations of simultaneous planarity
- Fast layout computation of clustered networks: algorithmic advances and experimental analysis
This page was built for publication: Empirical evaluation of aesthetics-based graph layout
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1859362)