Empirical evaluation of aesthetics-based graph layout
From MaRDI portal
Publication:1859362
DOI10.1023/A:1016344215610zbMath1010.68636OpenAlexW1502938161MaRDI QIDQ1859362
Publication date: 17 February 2003
Published in: Empirical Software Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1016344215610
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99) General topics in the theory of software (68N01)
Related Items (27)
Recognizing and drawing IC-planar graphs ⋮ HV-planarity: algorithms and complexity ⋮ On multi-objective optimization aided drawing of special graphs ⋮ Layered drawing of undirected graphs with generalized port constraints ⋮ EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING ⋮ Drawing Graphs with Right Angle Crossings ⋮ On RAC drawings of 1-planar graphs ⋮ An annotated bibliography on 1-planarity ⋮ Unnamed Item ⋮ On time and space: an experimental study on graph structural and temporal encodings ⋮ Fast layout computation of clustered networks: algorithmic advances and experimental analysis ⋮ Right angle crossing graphs and 1-planarity ⋮ ChordLink: a new hybrid visualization model ⋮ Upward and quasi-upward planarity testing of embedded mixed graphs ⋮ An Experimental Study on the Ply Number of Straight-Line Drawings ⋮ Area, curve complexity, and crossing resolution of non-planar graph drawings ⋮ An Experimental Study on the Ply Number of Straight-line Drawings ⋮ Drawing graphs with right angle crossings ⋮ On RAC drawings of graphs with one bend per edge ⋮ Compact drawings of 1-planar graphs with right-angle crossings and few bends ⋮ On RAC drawings of graphs with one bend per edge ⋮ Testing gap \(k\)-planarity is NP-complete ⋮ Crossing numbers of beyond-planar graphs ⋮ Crossing numbers of beyond-planar graphs ⋮ The Straight-Line RAC Drawing Problem Is NP-Hard ⋮ Planar drawings of fixed-mobile bigraphs ⋮ Exploring the Design Space of Aesthetics with the Repertory Grid Technique
This page was built for publication: Empirical evaluation of aesthetics-based graph layout
