Corpus ID: 16990016

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

Figures from this paper

Interactive searching and visualization of patterns in attributed graphs
  • 11
  • PDF
Development of a force directed module placement tool
  • 5

References

SHOWING 1-10 OF 14 REFERENCES
Removing Node Overlapping in Graph Layout Using Constrained Optimization
  • 44
Using Spring Algorithms to Remove Node Overlapping
  • 58
  • PDF
A layout adjustment problem for disjoint rectangles preserving orthogonal order
  • 21
Improved Force-Directed Layouts
  • 120
  • PDF
Drawing graphs with non-uniform vertices
  • 72
  • PDF
Removing edge-node intersections in drawings of graphs
  • 27
Cluster busting in anchored graph drawing
  • 43
Layout of Bayesian Networks
  • 10
  • PDF
Layout Adjustment and the Mental Map
  • 616