Floor-planning by graph dualization: 2-concave rectilinear modules
SIAM Journal on Computing
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
RecMap: Rectangular Map Approximations
INFOVIS '04 Proceedings of the IEEE Symposium on Information Visualization
Optimal BSPs and rectilinear cartograms
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
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
Area-universal rectangular layouts
Proceedings of the twenty-fifth annual symposium on Computational geometry
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
On rectilinear duals for vertex-weighted plane graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
How to visualize the k-root name server (demo)
GD'11 Proceedings of the 19th international conference on Graph Drawing
Linear-time algorithms for hole-free rectilinear proportional contact graph representations
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Computing cartograms with optimal complexity
Proceedings of the twenty-eighth annual symposium on Computational geometry
Edge-Weighted contact representations of planar graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
Orthogonal cartograms with at most 12 corners per face
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We give an algorithm to create orthogonal drawings of 3- connected 3-regular planar 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.