Removing Node Overlaps Using Multi-sphere Scheme

DOI10.1007/978-3-642-00219-9_28zbMath1213.68458OpenAlexW1543341129MaRDI QIDQ3611863

Jaeseong Gim, Seok-Hee Hong, Hiroshi Nagamochi, Takashi Imamichi, Yohei Arahori

Publication date: 3 March 2009

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_28

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Node Overlap Removal by Growing a Tree ⋮ Removing Node Overlaps Using Multi-sphere Scheme

Cites Work

• Unnamed Item
• On the limited memory BFGS method for large scale optimization
• Removing node overlapping in graph layout using constrained optimization
• Removing Node Overlaps Using Multi-sphere Scheme
• Algorithms for Cluster Busting in Anchored Graph Drawing
• A Multi-sphere Scheme for 2D and 3D Packing Problems
• Graph Drawing

This page was built for publication: Removing Node Overlaps Using Multi-sphere Scheme