A Layout Adjustment Problem for Disjoint Rectangles Preserving Orthogonal Order

Authors:
Kunihiko Hayashi;Michiko Inoue;Toshimitsu Masuzawa;Hideo Fujiwara
Affiliations:
-;-;-;-
Venue:
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Year:
1998

Citing 4
Cited 9

Automatic graph drawing and readability of diagrams

IEEE Transactions on Systems, Man and Cybernetics
Algorithms for drawing graphs: an annotated bibliography

Computational Geometry: Theory and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Graph Layout Adjustment Strategies

GD '95 Proceedings of the Symposium on Graph Drawing

Classical floorplanning harmful?

ISPD '00 Proceedings of the 2000 international symposium on Physical design
Removing edge-node intersections in drawings of graphs

Information Processing Letters
Using spring algorithms to remove node overlapping

APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Efficient Node Overlap Removal Using a Proximity Stress Model

Graph Drawing
Multi-con: exploring graphs by fast switching among multiple contexts

Proceedings of the International Conference on Advanced Visual Interfaces
On d-regular schematization of embedded paths

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Fast node overlap removal

GD'05 Proceedings of the 13th international conference on Graph Drawing
Rolled-out Wordles: A Heuristic Method for Overlap Removal of 2D Data Representatives

Computer Graphics Forum
On d-regular schematization of embedded paths

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a given set of n rectangles place on a plane, we consider a problem of finding the minimum area layout of the rectangles that avoids intersections of the rectangles and preserves the orthogonal order. Misue et al. proposed an O(n2)-time heuristic algorithm for the problem. We first show that the corresponding decision problem for this problem is NP-complete. We also present an O(n2)-time heuristic algorithm for the problem that finds a layout with smaller area than Misue's.