Unit Rectangle Visibility Graphs
Alice Dean (1), Joanna A. Ellis-Monaghan (2), Sarah Hamilton (2),, Greta Pangborn (2) ((1) Skidmore College, (2) Saint Michael's College)

TL;DR
This paper investigates unit rectangle visibility graphs (URVGs), where vertices are fixed-size squares in the plane, and establishes conditions for certain graph classes to be URVGs, relevant for VLSI chip design.
Contribution
It provides necessary and sufficient conditions for complete graphs, bipartite graphs, and trees to be URVGs, along with general edge bounds, advancing understanding of constrained geometric graph representations.
Findings
Characterization of URVGs for complete graphs and bipartite graphs.
Conditions for trees to be URVGs.
Bounds on the number of edges in URVGs.
Abstract
Over the past twenty years, rectangle visibility graphs have generated considerable interest, in part due to their applicability to VLSI chip design. Here we study unit rectangle visibility graphs, with fixed dimension restrictions more closely modeling the constrained dimensions of gates and other circuit components in computer chip applications. A graph is a unit rectangle visibility graph (URVG) if its vertices can be represented by closed unit squares in the plane with sides parallel to the axes and pairwise disjoint interiors, in such a way that two vertices are adjacent if and only if there is a non-degenerate horizontal or vertical band of visibility joining the two rectangles. Our results include necessary and sufficient conditions for , , and trees to be URVGs, as well as a number of general edge bounds.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Graph Theory Research · Interconnection Networks and Systems
