For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Algorithms for Drawing Plane Graphs
Takao NISHIZEKI Kazuyuki MIURA Md. Saidur RAHMAN
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2004/02/01
Print ISSN: 0916-8532
Type of Manuscript: INVITED SURVEY PAPER
straight line drawing, convex drawing, grid drawing, rectangular drawing, box-rectangular drawing, orthogonal drawing, plane graph,
Full Text: PDF(563KB)
>>Buy this Article
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 box-rectangular drawing.