Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
Theoretical Computer Science
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Minimum-Width Grid Drawings of Plane Graphs
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
RecMap: Rectangular Map Approximations
INFOVIS '04 Proceedings of the IEEE Symposium on Information Visualization
Computational Geometry: Theory and Applications
Drawings of planar graphs with few slopes and segments
Computational Geometry: Theory and Applications
Straight line embeddings of cubic planar graphs with integer edge lengths
Journal of Graph Theory
Octagonal drawings of plane graphs with prescribed face areas
Computational Geometry: Theory and Applications
Orthogonal drawings for plane graphs with specified face areas
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Area-preserving subdivision schematization
GIScience'10 Proceedings of the 6th international conference on Geographic information science
Orthogonal cartograms with few corners per face
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
On rectilinear duals for vertex-weighted plane graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
| Hi-index | 0.00 |
We give an algorithm to create orthogonal drawings of 3-connected 3-regular plane graphs such that each interior face of the graph is drawn with a prescribed area. This algorithm produces a drawing with at most 12 corners per face and 4 bends per edge, which improves the previous known result of 34 corners per face.