Algorithms for Drawing Plane Graphs
Takao Nishizeki, Kazuyuki Miura, Md. Saidur Rahman · IEICE Transactions on Information and Systems · 2004
SUMMARY Graph drawing addresses the problem of constructing geometric representation of information and finds applications in almost every branch of science and technology. Efficient algorithms are essential for automatic drawings of graphs, and hence a lot of research has been carried out in the last decade by many researchers over the world to develop efficient algorithms for drawing graphs. In this paper we survey the recent algorithmic results on various drawings of plane graphs: straight line drawing, convex drawing, orthogonal drawing, rectangular drawing and boxrectangular drawing.