Removing edge-node intersections in drawings of graphs

DOI10.1016/S0020-0190(01)00194-6zbMath1032.68991OpenAlexW2053290522MaRDI QIDQ1603534

Peter Eades, Wei Lai

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00194-6

zbMATH Keywords

AlgorithmsGraph layoutLayout adjustmentNode-edge intersectionsOverlapping nodes

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

A new algorithm for removing node overlapping in graph visualization

Cites Work

• Algorithms for drawing graphs: An annotated bibliography
• Euclidean shortest paths in the presence of rectilinear barriers
• Finding minimum rectilinear distance paths in the presence of barriers