On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Automatic graph drawing and readability of diagrams
IEEE Transactions on Systems, Man and Cybernetics
On finding the rectangular duals of planar triangular graphs
SIAM Journal on Computing
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
Theoretical Computer Science
Algorithms for area-efficient orthogonal drawings
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
A better heuristic for orthogonal graph drawings
Computational Geometry: Theory and Applications
Spirality and Optimal Orthogonal Drawings
SIAM Journal on Computing
Rectangular grid drawings of plane graphs
Computational Geometry: Theory and Applications
Computing Orthogonal Drawings with the Minimum Number of Bends
IEEE Transactions on Computers
Box-rectangular drawings of plane graphs
Journal of Algorithms
Drawing High Degree Graphs with Low Bend Numbers
GD '95 Proceedings of the Symposium on Graph Drawing
Refinement of Orthogonal Graph Drawings
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Area-Efficient Static and Incremental Graph Drawings
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
| Hi-index | 0.00 |
In this paper we introduce a new drawing style of a plane graph G, called proper box rectangular (PBR) drawing. It is defined to be a drawing of G such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal or a vertical line segment, and each face is drawn as a rectangle. We establish necessary and sufficient conditions for G to have a PBR drawing. We also give a simple linear time algorithm for finding such drawings. The PBR drawing is closely related to the box rectangular (BR) drawing defined by Rahman, Nakano and Nishizeki [17]. Our method can be adapted to provide a new algorithm for solving the BR drawing problem.