Removing edge-node intersections in drawings of graphs

Information Processing Letters

Volumn 81, Issue 2, 2002, Pages 105-110

  Lai, Wei ^a   Eades, Peter ^b  

^a SWINBURNE UNIVERSITY OF TECHNOLOGY   (Australia)

^b UNIVERSITY OF SYDNEY   (Australia)

Author keywords

Algorithms; Graph layout; Layout adjustment; Node edge intersections; Overlapping nodes

Indexed keywords

ALGORITHMS; DATA FLOW ANALYSIS; MATHEMATICAL MODELS; MOTION PLANNING; PERT;

GRAPH LAYOUT;

GRAPH THEORY;

EID: 0037203618     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00194-6     Document Type: Article

References (14)

1. Algorithms for drawing graphs: An annotated bibliography
2. A heuristic for graph drawing
3. Visual interface design for relational systems
4. Preserving the mental map of a diagram
5. Layout adjustment and the mental map
6. Algorithms for disjoint node images
7. On visual formalisms
8. Removing node overlapping using constrained optimization
9. A layout adjustment problem for disjoint rectangles preserving orthogonal order
10. Finding minimum rectilinear distance paths in the paths in the presence of barriers
11. Euclidean shortest paths in the presence of rectilinear barriers
12. An algorithm for planning collision-free paths among polyhedral obstacles
13. OMT: The development process
14. Visualization of structural information: Automatic drawing of compound digraphs