Efficient Node Overlap Removal Using a Proximity Stress Model

DOI10.1007/978-3-642-00219-9_20MaRDI QIDQ3611853zbMATH OpenOpenAlexFDO

Authors Emden R. Gansner, Yifan Hu

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_20

Mathematics Subject Classification ID

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

Recommendations

• Efficient, proximity-preserving node overlap removal
• Node overlap removal algorithms: an extended comparative study
• Node overlap removal algorithms: a comparative study
• Removing Node Overlaps Using Multi-sphere Scheme
• Graph Drawing
• Fast Node Overlap Removal—Correction
• An augmented proximity stress model for edge label overlap removal
• Removing node overlapping in graph layout using constrained optimization
• Node overlap removal by growing a tree

Cites work

• A Fast Multi-Scale Method for Drawing Large Graphs
• A sweepline algorithm for Voronoi diagrams
• Algorithms for Cluster Busting in Anchored Graph Drawing
• An algorithm for drawing general undirected graphs
• An open graph visualization system and its applications to software engineering
• Graph Drawing
• Graph Drawing
• Modern multidimensional scaling: theory and applications
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Procrustes Problems
• Removing node overlapping in graph layout using constrained optimization
• The Mathematics Genealogy Project Comes of Age at 21

Cited in

(9)

• A new algorithm for removing node overlapping in graph visualization
• Efficient, proximity-preserving node overlap removal
• An augmented proximity stress model for edge label overlap removal
• Removing node overlapping in graph layout using constrained optimization
• Removing Node Overlaps Using Multi-sphere Scheme
• Node overlap removal by growing a tree
• Node overlap removal algorithms: an extended comparative study
• Node overlap removal by growing a tree
• Graph Drawing

This page was built for publication: Efficient Node Overlap Removal Using a Proximity Stress Model

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