Removing Node Overlaps Using Multi-sphere Scheme

DOI10.1007/978-3-642-00219-9_28MaRDI QIDQ3611863zbMATH OpenOpenAlexFDO

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

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

Recommendations

• Graph Drawing
• Efficient, proximity-preserving node overlap removal
• Removing node overlapping in graph layout using constrained optimization
• Node overlap removal by growing a tree
• Efficient Node Overlap Removal Using a Proximity Stress Model

Cites work

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

Cited in

(5)

• Removing node overlapping in graph layout using constrained optimization
• Node overlap removal by growing a tree
• Efficient Node Overlap Removal Using a Proximity Stress Model
• Removing Node Overlaps Using Multi-sphere Scheme
• Graph Drawing

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

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