Survey on Convex Drawing of Planar Graph

Please use this identifier to cite or link to this item: http://dspace.aiub.edu:8080/jspui/handle/123456789/1874

Full metadata record

DC Field	Value	Language
dc.contributor.author	Mahmud, Sharifa Rania	-
dc.date.accessioned	2023-11-12T17:43:13Z	-
dc.date.available	2023-11-12T17:43:13Z	-
dc.date.issued	2013-01	-
dc.identifier.issn	e-ISSN: 2278-0661 p-ISSN : 2278-8727	-
dc.identifier.uri	http://dspace.aiub.edu:8080/jspui/handle/123456789/1874	-
dc.description.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.	en_US
dc.publisher	IOSR	en_US
dc.subject	Biconnected, Convex Drawing, Internally Triconnected, Planar Graph	en_US
dc.title	Survey on Convex Drawing of Planar Graph	en_US
Appears in Collections:	Publications: Journals

Files in This Item:

File	Description	Size	Format
Survey on Convex Drawing of Planar Graph.docx		4.66 MB	Microsoft Word XML	View/Open

AIUB DSpace