Node Overlap Removal by Growing a Tree

DOI10.1007/978-3-319-50106-2_3zbMath1478.68255OpenAlexW2474068310MaRDI QIDQ2961502

Arlind Nocaj, Lev Nachmanson, Leishi Zhang, Sergey Bereg, Alexander E. Holroyd

Publication date: 21 February 2017

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

Full work available at URL: https://eprints.mdx.ac.uk/20766/1/main%20%282%29.pdf

Mathematics Subject Classification ID

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

Related Items

FORBID: Fast Overlap Removal By stochastic gradIent Descent for graph drawing, Node overlap removal algorithms: a comparative study, Node Overlap Removal Algorithms: an Extended Comparative Study

Uses Software

• IPSep-CoLa

Cites Work

• Removing node overlapping in graph layout using constrained optimization
• A new algorithm for removing node overlapping in graph visualization
• Modern multidimensional scaling. Theory and applications.
• Efficient, Proximity-Preserving Node Overlap Removal
• Removing Node Overlaps Using Multi-sphere Scheme
• Algorithms for Cluster Busting in Anchored Graph Drawing
• Graph Drawing
• Graph Drawing