Published In
Journal of Combinatorial Optimization
Document Type
Pre-Print
Publication Date
9-2023
Subjects
Graphs, Combinatorial analysis, Associative algebras
Abstract
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).
Rights
© Copyright the author(s) 2022
Locate the Document
DOI
10.1007/s10878-023-01084-9
Persistent Identifier
https://archives.pdx.edu/ds/psu/40961
Citation Details
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.
Description
This is the author’s version of a work that was accepted for publication in Journal of Combinatorial Optimization Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Journal of Combinatorial Optimization.