@article {IOPORT.01354501,
    author       = {He, Xin},
    title        = {On floor-plan of plane graphs.},
    year         = {1999},
    journal      = {SIAM Journal on Computing},
    volume       = {28},
    number       = {6},
    issn         = {0097-5397},
    pages        = {2150-2167},
    publisher    = {Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA},
    doi          = {10.1137/S0097539796308874},
    abstract     = {Plane graphs $G$ can be represented by floor plans. A floor plan is a rectangle, partitioned into a set of disjoint rectilinear polygonal regions, which are called the modules. Every module presents a vertex, and it is required that two modules share a piece of their borders if and only if the corresponding vertices are adjacent in $G$. It has been known that every triangulated planar graph has a floor plan with modules that are formed by the disjoint union of one, two, or three rectangles. In this paper, it is shown that two rectangles per module are sufficient: a linear time algorithm is given that, when given a triangulated plane graph, finds a floor plan with only 1-rectangle and 2-rectangle modules.},
    reviewer     = {H.L.Bodlaender (Utrecht)},
    identifier   = {01354501},
}