A plane graph is a drawing of a planar graph in the plane such that no two edges cross each other. In a rooted plane graph, an outer (directed) edge is designated as the root. For a given positive integer
≥ 1, we give an
(1)-time delay algorithm that enumerates all plane graphs with exactly
) space. Our algorithm can generates only plane graphs such that the size of each inner face is bounded from above by a prescribed integer
≥ 3 in the same time and space complexity.