The Turing Test for Graph Drawing Algorithms
From MaRDI portal
Publication:5014138
DOI10.1007/978-3-030-68766-3_36OpenAlexW3048932628MaRDI QIDQ5014138FDOQ5014138
Authors: Helen Purchase, Daniel Archambault, Stephen G. Kobourov, Martin Nöllenburg, Sergey Pupyrev, Hsiang-Yun Wu 
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.04869
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- GRIP: Graph Drawing with Intelligent Placement
- Multidimensional scaling. I: Theory and method
- Improved Circular Layouts
- Title not available (Why is that?)
- A better heuristic for orthogonal graph drawings
- An algorithm for drawing general undirected graphs
- Title not available (Why is that?)
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Graph-Theoretic Concepts in Computer Science
- Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
- Crossing minimization in linear embeddings of graphs
- A Fast Multi-Scale Method for Drawing Large Graphs
- A multi-scale algorithm for drawing graphs nicely
- Experimental evaluation of book drawing algorithms
- An experimental evaluation of multilevel layout methods
- The three-phase method: a unified approach to orthogonal graph drawing
- COAST: A Convex Optimization Approach to Stress-Based Embedding
This page was built for publication: The Turing Test for Graph Drawing Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014138)
