A layout adjustment problem for disjoint rectangles preserving orthogonal order

Systems and Computers in Japan

Volumn 33, Issue 2, 2002, Pages 31-42

  Hayashi, Kunihiko ^a   Inoue, Michiko ^a   Masuzawa, Toshimitsu ^a   Fujiwara, Hideo ^a  

^a NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Algorithm; Computational complexity; Drawing; Graph; Orthogonal order

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; HEURISTIC METHODS;

DISJOINT RECTANGLES;

GRAPH THEORY;

EID: 0036469921     PISSN: 08821666     EISSN: None     Source Type: Journal    
DOI: 10.1002/scj.1104     Document Type: Article

References (7)

1. Algorithms for drawing graphs: An annotated bibliography
2. Automatic graph drawing and readability of diagrams
3. Automatic graph drawing and its applications
4. Preserving the mental map of a diagram
5. Layout adjustment and the mental map
6. Graph layout adjustment strategies