The problems of nicely drawing planar graphs have received increasing attention due to their broad applications [5]. A technique, regular edge labeling, was successfully used in solving several planar graph drawing problems, including visibility representation, straight-line embedding, and rectangular dual problems. A regular edge labeling of a plane graph G labels the edges of G so that the edge labels around any vertex show certain regular pattern. The drawing of G is obtained by using the combinatorial structures resulting from the edge labeling. In this paper, we survey these drawing algorithms and discuss some open problems.
CITATION STYLE
He, X., & Kao, M. Y. (1995). Regular edge labelings and drawings of planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 894, pp. 96–103). Springer Verlag. https://doi.org/10.1007/3-540-58950-3_360
Mendeley helps you to discover research relevant for your work.