Node overlap removal algorithms: a comparative study

DOI10.1007/978-3-030-35802-0_14OpenAlexW2989945661MaRDI QIDQ2206849

Pascal Poncelet, Arnaud Sallaberry, Laurent Piccinini, Fati Chen

Publication date: 26 October 2020

Full work available at URL: https://arxiv.org/abs/1908.07363

zbMATH Keywords

graph drawinglayout adjustmentnode overlap removal

Mathematics Subject Classification ID

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

Related Items (2)

FORBID: Fast Overlap Removal By stochastic gradIent Descent for graph drawing ⋮ Node Overlap Removal Algorithms: an Extended Comparative Study

Cites Work

• Unnamed Item
• Removing node overlapping in graph layout using constrained optimization
• A new algorithm for removing node overlapping in graph visualization
• Node Overlap Removal by Growing a Tree
• Emergence of Scaling in Random Networks
• Efficient, Proximity-Preserving Node Overlap Removal
• Algorithms for Cluster Busting in Anchored Graph Drawing
• An open graph visualization system and its applications to software engineering
• Collective dynamics of ‘small-world’ networks
• Graph Drawing
• Graph Drawing

This page was built for publication: Node overlap removal algorithms: a comparative study