Listing AH Rectangular Drawings with Certain Properties

摘要

A plane drawing of a plane graph is called a rectangular drawing if every face (including the outer face) is a rectangle. An algorithm to generate all based rectangular drawings with maximum degree three is known. In this paper by generalizing the algorithm we give a simple algorithm to generate all based rectangular drawings having n faces without the degree constraint. The algorithm generates without duplications all rectangular drawings having exactly n faces in O(n} time per drawing. By modifying the algorithm we give three more algorithms to generate all rectangular drawings with certain properties. Those algorithms use O(n) space in total.