An augmented proximity stress model for edge label overlap removal

DOI10.15960/J.CNKI.ISSN.1007-6093.2015.03.011MaRDI QIDQ2993679zbMATH OpenFDO

Authors Yifan Hu

Publication date 10 August 2016

zbMATH Keywords

visualizationstress model

Mathematics Subject Classification ID

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

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

Cited in

(3)

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

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)