Closed rectangle-of-influence drawings for irreducible triangulations (Q709065)

The authors consider a (weak) rectangle-of-influence drawing called RI drawing that is a straight-line planar grid drawing in which the axis parallel rectangle defined by the two vertices of any edge does not contain any other vertex [see \textit{M. Ichino} and \textit{J. Sklansky}, Pattern Recognition 18, 161--167 (1985; Zbl 0563.68070)]. Introducing the notion of compatible drawings the relation between such drawings and RI drawings is obtained. A compatible drawing algorithm is presented. Applying this algorithm an algorithm that computes a closed RI drawing for an irreducible triangulation [see \textit{E. Fusy}, Discrete Math. 309, No.~7, 1870--1894 (2009; Zbl 1163.05009)] is introduced. A lower bound on a closed RI drawing for an arbitrary graph is also presented [cf. \textit{T. Biedl, A. Bretscher} and \textit{H. Meijer}, Lect. Notes Comput. Sci. 1731, 359--368 (1999; Zbl 0953.05015)].