Efficient, Proximity-Preserving Node Overlap Removal

DOI10.7155/jgaa.00198zbMath1185.68778OpenAlexW2098329200MaRDI QIDQ3402374

Yifan Hu, Emden R. Gansner

Publication date: 4 February 2010

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/231584

zbMATH Keywords

drawing graphs

Mathematics Subject Classification ID

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

Related Items (5)

FORBID: Fast Overlap Removal By stochastic gradIent Descent for graph drawing ⋮ Node Overlap Removal by Growing a Tree ⋮ Node overlap removal algorithms: a comparative study ⋮ Node Overlap Removal Algorithms: an Extended Comparative Study ⋮ Improved approximation algorithms for box contact representations

This page was built for publication: Efficient, Proximity-Preserving Node Overlap Removal