Improved visibility representation of plane graphs

In this paper, we prove that any plane graph G has a VR with width at most ⌊13n−249⌋, which can be constructed by using the simple standard VR algorithm in [P. Rosenstiehl, R.E. Tarjan, Discrete Comput. Geom. 1 (1986) 343-353; R. Tamassia, I.G. Tollis, Discrete Comput. Geom. 1 (1986) 321-341].