Node overlap removal by growing a tree

DOI10.1007/978-3-319-50106-2_3MaRDI QIDQ2961502zbMATH OpenOpenAlexFDO

Authors Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, A. 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

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

Recommendations

• Node overlap removal by growing a tree
• Graph Drawing
• Efficient, proximity-preserving node overlap removal
• Efficient Node Overlap Removal Using a Proximity Stress Model
• Node overlap removal algorithms: an extended comparative study

Cites work

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

Cited in

(6)

• Node overlap removal algorithms: a comparative study
• Efficient, proximity-preserving node overlap removal
• Node overlap removal algorithms: an extended comparative study
• Node overlap removal by growing a tree
• Graph Drawing
• FORBID: Fast Overlap Removal By stochastic gradIent Descent for graph drawing

Describes a project that uses

Uses Software

• IPSep-CoLa

This page was built for publication: Node overlap removal by growing a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961502)