Abstract
A 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 linear-time 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. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Rahman, M. S., Nishizeki, T., & Ghosh, S. (2002). Rectangular drawings of planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2528 LNCS, pp. 244–255). https://doi.org/10.1007/3-540-36151-0_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
