Improved visibility representation of plane graphs (Q706721)

The problem of computing a compact visibility representation of a plane graph is studied. The authors give an upper bound for the width of the visibility representation of any plane graph, which is obtained by using the simple standard visibility representation algorithm given by \textit{P. Rosenstiehl} and \textit{R. E. Tarjan} [Discrete Comput. Geom. 1, 343--353 (1986; Zbl 0607.05027)] and \textit{R. Tamassia} and \textit{I. G. Tollis} [ibid. 1, 321--341 (1986; Zbl 0607.05026)].