Orthogonal drawings for plane graphs with specified face areas

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4484 LNCS, Issue , 2007, Pages 584-594

  Kawaguchi, Akifumi ^a   Nagamochi, Hiroshi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; NUMERICAL METHODS; PROBLEM SOLVING;

PLANE GRAPHS; POLYGONS; RECTANGULAR GRAPHS;

GRAPH THEORY;

EID: 35448988421     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-72504-6_53     Document Type: Conference Paper

References (6)

1. F. d'Amore and P. G. Franciosa: On the optimal binary plane partition for sets of isothetic rectangles, Information Proc. Letters, Vol. 44, pp. 255-259, 1992.
2. M. de Berg, E. Mumford and B. Speckmann: On rectilinear duals for vertex-weighted plane graphs. In Proc 13th International Symposium on Graph Drawing, pp. 61-72, 2005.
3. G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis: Graph drawing: Algorithms for the visualization of graphs, Prentice hall, 1999.
4. C.-C. Liao, H.-I. Lu and H.-C. Yen: Floor-planning via orderly spanning trees, In Proc. 9th International Symposium on Graph Drawing, pp. 367-377, 2001.
5. T. Nishizeki, K. Miura and Md. S. Rahman: Algorithms for drawing plane graphs, IEICE Trans. Electron., Vol.E87-D, No.2, pp.281-289, 2004.
6. M. S. Rahman, K. Miura and T. Nishizeki: Octagonal drawings of plane graphs with prescribed face areas, In Graph Theoretic Concepts in Computer Science: 30th International Workshop, Vol. 3353 of Lecture Notes in Computer Science, pp. 320-331, 2004.