An augmented proximity stress model for edge label overlap removal

DOI10.15960/J.CNKI.ISSN.1007-6093.2015.03.011zbMATH Open1349.05326MaRDI QIDQ2993679FDOQ2993679

Authors: Yifan Hu 

Publication date: 10 August 2016

Recommendations

• Efficient Node Overlap Removal Using a Proximity Stress Model
• Efficient, proximity-preserving node overlap removal
• A new algorithm for removing node overlapping in graph visualization
• Graph Drawing
• Removing node overlapping in graph layout using constrained optimization

zbMATH Keywords

visualizationstress model

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Cited In (3)

• Efficient, proximity-preserving node overlap removal
• Efficient Node Overlap Removal Using a Proximity Stress Model
• A new algorithm for removing node overlapping in graph visualization

This page was built for publication: An augmented proximity stress model for edge label overlap removal

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