Small sets supporting fary embeddings of planar graphs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the angular resolution of planar graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the Angular Resolution of Planar Graphs
SIAM Journal on Discrete Mathematics
A linear-time algorithm for drawing a planar graph on a grid
Information Processing Letters
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Planar Polyline Drawings with Good Angular Resolution
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Framework for Drawing Planar Graphs with Curves and Polylines
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract)
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
| Hi-index | 0.00 |
We study a problem of straight-line drawings for plane graphs. We show that each plane graph can be drawn in an $\mathcal{O}(n)\times \mathcal{O}(n)$ grid with angular resolution $\it \Omega$(1/n).