Removing node overlapping in graph layout using constrained optimization

DOI10.1023/A:1022371615202MaRDI QIDQ1405333zbMATH OpenOpenAlexFDO

Authors Kim Marriott, Weiqing He, Peter J. Stuckey, Vincent H. Tam

Publication date 25 August 2003

Published in Constraints (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1022371615202, http://scholarbank.nus.edu.sg/handle/10635/39028

zbMATH Keywords

constrained optimizationdisjunctive constraintsgraph layout

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Graph Drawing
• 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
• Removing Node Overlaps Using Multi-sphere Scheme

Cited in

(10)

• Constrained graph layout by stress majorization and gradient projection
• Node overlap removal algorithms: a comparative study
• A new algorithm for removing node overlapping in graph visualization
• Node overlap removal by growing a tree
• An augmented proximity stress model for edge label overlap removal
• Efficient Node Overlap Removal Using a Proximity Stress Model
• Removing Node Overlaps Using Multi-sphere Scheme
• Node overlap removal algorithms: an extended comparative study
• Optimizing symbol visibility through displacement
• Optimizing symbol visibility through displacement

Describes a project that uses

Uses Software

• QOCA

This page was built for publication: Removing node overlapping in graph layout using constrained optimization

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