Fast Node Overlap Removal in Graph Layout Adjustment
@inproceedings{Dwyer2005FastNO,
title={Fast Node Overlap Removal in Graph Layout Adjustment},
author={T. Dwyer and Kimbal George Marriott and Peter James Stuckey},
year={2005}
}Most graph layout algorithms in the field of graph drawing treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height do not overlap, yet are as close as possible to their original positions. We give an O(n logn) algorithm for achieving this assuming that the number of nodes overlapping any single node is bounded by some constant. This method has two parts, a constraint generation algorithm which… CONTINUE READING
2 Citations
Interactive searching and visualization of patterns in attributed graphs
- Computer Science
- Graphics Interface
- 2010
- 11
- PDF
Development of a force directed module placement tool
- Computer Science
- 2009 Ph.D. Research in Microelectronics and Electronics
- 2009
- 5
References
SHOWING 1-10 OF 14 REFERENCES
Removing Node Overlapping in Graph Layout Using Constrained Optimization
- Mathematics, Computer Science
- Constraints
- 2004
- 44
A layout adjustment problem for disjoint rectangles preserving orthogonal order
- Mathematics, Computer Science
- Systems and Computers in Japan
- 2002
- 21
Flexible Layering in Hierarchical Drawings with Nodes of Arbitrary Size
- Computer Science
- ACSC
- 2004
- 20
- PDF
Removing edge-node intersections in drawings of graphs
- Mathematics, Computer Science
- Inf. Process. Lett.
- 2002
- 27