Please use this identifier to cite or link to this item: http://dspace.aiub.edu:8080/jspui/handle/123456789/1874
Title: Survey on Convex Drawing of Planar Graph
Authors: Mahmud, Sharifa Rania
Keywords: Biconnected, Convex Drawing, Internally Triconnected, Planar Graph
Issue Date: Jan-2013
Publisher: IOSR
Abstract: This paper presented study on convex drawing of planar graph. In graph theory, a planar graph is a graph that can be embedded in the plane. A planar graph is one that can be drawn on a plane in such a way that there are no “edge crossings,” i.e. edges intersect only at their common vertices. Convex polygon has all interior angles less than or equal to 180°. A graph is called a convex drawing if every facial cycle (face) is drawn as a convex polygon. In a convex drawing of a planar graph, all edges are drawn by straight line segments in such a way that every face boundary in a convex polygon. This paper describes some of the recent works on convex drawing on planar graph.
URI: http://dspace.aiub.edu:8080/jspui/handle/123456789/1874
ISSN: e-ISSN: 2278-0661 p-ISSN : 2278-8727
Appears in Collections:Publications: Journals

Files in This Item:
File Description SizeFormat 
Survey on Convex Drawing of Planar Graph.docx4.66 MBMicrosoft Word XMLView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.