Fixed edge-length graph drawing is NP-hard
Discrete Applied Mathematics
The problem of compatible representatives
SIAM Journal on Discrete Mathematics
Floor-planning by graph dualization: 2-concave rectilinear modules
SIAM Journal on Computing
On finding the rectangular duals of planar triangular graphs
SIAM Journal on Computing
Representing graphs by disks and balls (a survey of recognition-complexity results)
Discrete Mathematics
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
An algorithm for building rectangular floor-plans
DAC '84 Proceedings of the 21st Design Automation Conference
Compact floor-planning via orderly spanning trees
Journal of Algorithms
Computational Geometry: Theory and Applications
Every planar graph is the intersection graph of segments in the plane: extended abstract
Proceedings of the forty-first annual ACM symposium on Theory of computing
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
Orthogonal cartograms with few corners per face
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
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
Hi-index | 0.00 |
We study contact representations of edge-weighted planar graphs, where vertices are rectangles or rectilinear polygons and edges are polygon contacts whose lengths represent the edge weights. We show that for any given edge-weighted planar graph whose outer face is a quadrangle, that is internally triangulated and that has no separating triangles we can construct in linear time an edge-proportional rectangular dual if one exists and report failure otherwise. For a given combinatorial structure of the contact representation and edge weights interpreted as lower bounds on the contact lengths, a corresponding contact representation that minimizes the size of the enclosing rectangle can be found in linear time. If the combinatorial structure is not fixed, we prove NP-hardness of deciding whether a contact representation with bounded contact lengths exists. Finally, we give a complete characterization of the rectilinear polygon complexity required for representing biconnected internally triangulated graphs: For outerplanar graphs complexity 8 is sufficient and necessary, and for graphs with two adjacent or multiple non-adjacent internal vertices the complexity is unbounded.