A linear time algorithm for constructing orthogonal floor plans with minimum number of bends

Pinki, Krishnendra Shekhawat

Let G = (V, E) be a planar triangulated graph (PTG) having every face triangular. A rectilinear dual or an orthogonal floor plan (OFP) of G is obtained by partitioning a rectangle…