On monotone paths among obstacles with applications to planning assemblies
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
SIAM Journal on Computing
On a conjecture related to geometric routing
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
A graph reading behavior: Geodesic-path tendency
PACIFICVIS '09 Proceedings of the 2009 IEEE Pacific Visualization Symposium
Some Results on Greedy Embeddings in Metric Spaces
Discrete & Computational Geometry
GD'10 Proceedings of the 18th international conference on Graph drawing
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
A drawing of a graph is a monotone drawing if for every pair of vertices u and v, there is a path drawn from u to v that is monotone in some direction. In this paper we investigate planar monotone drawings in the fixed embedding setting, i.e., a planar embedding of the graph is given as part of the input that must be preserved by the drawing algorithm. In this setting we prove that every planar graph on n vertices admits a planar monotone drawing with at most two bends per edge and with at most 4n --- 10 bends in total; such a drawing can be computed in linear time and requires polynomial area. We also show that two bends per edge are sometimes necessary on a linear number of edges of the graph. Furthermore, we investigate subclasses of planar graphs that can be realized as embedding-preserving monotone drawings with straight-line edges, and we show that biconnected embedded planar graphs and outerplane graphs always admit such drawings, which can be computed in linear time.