Rectangular Drawings of Planar Graphs (Extended Abstract)Rahman, Md. Saidur and Nishizeki, Takao and Ghosh, Shubhashis (2002) Rectangular Drawings of Planar Graphs (Extended Abstract). In: Graph Drawing 10th International Symposium, GD 2002, August 2628, 2002 , pp. 244255(Official URL: http://dx.doi.org/10.1007/3540361510_23). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/3540361510_23
AbstractA plane graph is a planar graph with a fixed embedding. In a rectangular drawing of a plane graph, each vertex is drawn as a point, each edge is drawn as a horizontal or vertical line segment, and each face is drawn as a rectangle. A planar graph is said to have a rectangular drawing if at least one of its plane embeddings has a rectangular drawing. In this paper we give a lineartime algorithm to examine whether a planar graph G of the maximum degree three has a rectangular drawing or not, and to find a rectangular drawing of G if it exists.
Actions (login required)
