Convex drawings of graphs in two and three dimensions (preliminary version)
Proceedings of the twelfth annual symposium on Computational geometry
Dynamic Grid Embedding with Few Bends and Changes
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
A Framework for Drawing Planar Graphs with Curves and Polylines
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A note on isosceles planar graph drawing
Information Processing Letters
Complexity analysis of balloon drawing for rooted trees
Theoretical Computer Science
GD'10 Proceedings of the 18th international conference on Graph drawing
Drawing planar graphs of bounded degree with few slopes
GD'10 Proceedings of the 18th international conference on Graph drawing
The quality ratio of RAC drawings and planar drawings of planar graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
Small area drawings of outerplanar graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Planar straight-line drawing in an O(n)×O(n) grid with angular resolution Ω(1/n)
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Pinning balloons with perfect angles and optimal area
GD'11 Proceedings of the 19th international conference on Graph Drawing
Planar and poly-arc lombardi drawings
GD'11 Proceedings of the 19th international conference on Graph Drawing
Force-Directed lombardi-style graph drawing
GD'11 Proceedings of the 19th international conference on Graph Drawing
| Hi-index | 0.00 |
It is a well-known fact that every planar graph admits a planar straight-line drawing. The angular resolution of such a drawing is the minimum angle subtended by any pair of incident edges. The angular resolution of the graph is the supremum angular resolution over all planar straight-line drawings of the graph. In a recent paper by Formann et al. [Proc. 31st IEEE Sympos. on Found. of Comput. Sci., 1990, pp. 86-95], the following question is posed: Does there exist a constant $r(d) 0$ such that every planar graph of maximum degree $d$ has angular resolution $\geq r(d)$ radians? The present authors show that the answer is yes and that it follows easily from results in the literature on disk-packings. The conclusion is that every planar graph of maximum degree $d$ has angular resolution at least $\alpha^d$ radians, $0