Drawing Graphs in the Plane with High Resolution

Formann, M; Hagerup, T; Haralambides, J; Kaufmann, M; Leighton, F; Symvonis, A; Welzl, E; Woeginger, G

dc.contributor.author	Formann, M	en
dc.contributor.author	Hagerup, T	en
dc.contributor.author	Haralambides, J	en
dc.contributor.author	Kaufmann, M	en
dc.contributor.author	Leighton, F	en
dc.contributor.author	Symvonis, A	en
dc.contributor.author	Welzl, E	en
dc.contributor.author	Woeginger, G	en
dc.date.accessioned	2014-03-01T02:47:54Z
dc.date.available	2014-03-01T02:47:54Z
dc.date.issued	1990	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33423
dc.subject	Complete Graph	en
dc.subject	High Resolution	en
dc.subject	Planar Graph	en
dc.title	Drawing Graphs in the Plane with High Resolution	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/FSCS.1990.89527	en
heal.identifier.secondary	http://dx.doi.org/10.1109/FSCS.1990.89527	en
heal.publicationDate	1990	en
heal.abstract	The problem of drawing a graph in the plane so that edges appear as straight lines and the minimum angle formed by any pair of incident edges is maximized is studied. The resolution of a layout is defined to be the size of the minimum angle formed by incident edges of the graph, and the resolution of a graph is	en
heal.journalName	IEEE Symposium on Foundations of Computer Science	en
dc.identifier.doi	10.1109/FSCS.1990.89527	en