The Turing Test for Graph Drawing Algorithms

DOI10.1007/978-3-030-68766-3_36OpenAlexW3048932628MaRDI QIDQ5014138

Martin Nöllenburg, Hsiang-Yun Wu, Sergey Pupyrev, Helen Purchase, Daniel Archambault, 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.04869

zbMATH Keywords

Turing testempirical studiesgraph drawing algorithms

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A better heuristic for orthogonal graph drawings
• An algorithm for drawing general undirected graphs
• Multidimensional scaling. I: Theory and method
• THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING
• COAST: A Convex Optimization Approach to Stress-Based Embedding
• An Experimental Evaluation of Multilevel Layout Methods
• Improved Circular Layouts
• Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• A Fast Multi-Scale Method for Drawing Large Graphs
• GRIP: Graph Drawing with Intelligent Placement
• Experimental Evaluation of Book Drawing Algorithms
• Crossing minimization in linear embeddings of graphs
• Graph-Theoretic Concepts in Computer Science
• A multi-scale algorithm for drawing graphs nicely

This page was built for publication: The Turing Test for Graph Drawing Algorithms