Efficient Node Overlap Removal Using a Proximity Stress Model

DOI10.1007/978-3-642-00219-9_20zbMath1213.68448OpenAlexW1888514102MaRDI QIDQ3611853

Yifan Hu, Emden R. Gansner

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 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)

Cites Work

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

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