Journal of Combinatorial Optimization
Graphs, Combinatorial analysis, Associative algebras
A rectangle visibility graph (RVG) is represented by assigning to each vertex a rectangle in the plane with horizontal and vertical sides in such a way that edges in the graph correspond to unobstructed horizontal and vertical lines of sight between their corresponding rectangles. To discretize, we consider only rectangles whose corners have integer coordinates. For any given RVG, we seek a representation with smallest bounding box as measured by its area, perimeter, height, or width (height is assumed not to exceed width).
© Copyright the author(s) 2022
Locate the Document
Published as: Caughman, J. S., Dunn, C. L., Laison, J. D., Neudauer, N. A., & Starr, C. L. (2023). Area, perimeter, height, and width of rectangle visibility graphs. Journal of Combinatorial Optimization, 46(3), 18.