Abstract
A monotone drawing of a graph G is a straight-line drawing of G such that, for every pair of vertices u, w in G, there exists a path \(P_{uw}\) in G that is monotone in some direction l. (Namely, the order of the orthogonal projections of the vertices of \(P_{uw}\) on l is the same as the order they appear in \(P_{uw}\).)
The problem of finding monotone drawing for trees has been studied in several recent papers. The main focus is to reduce the size of the drawing. Currently, the smallest drawing size is \(O(n^{1.5}) \times O(n^{1.5})\). In this paper, we present a linear time algorithm for constructing monotone drawing of trees on a grid of size at most \(O(n^{1.205}) \times O(n^{1.205})\). This is the first result achieving \(o(n^3)\) drawing area for solving this problem.
X. He—Research supported in part by NSF Grant CCR-1319732.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Angelini, P., Colasante, E., Di Battista, G., Frati, F., Patrignani, M.: Monotone Drawings of Graphs. Journal of Graph Algorithms and Applications 16(1), 5–35 (2012)
Angelini, P., Frati, F., Grilli, L.: An Algorithm to Construct Greedy Drawings of Triangulations. Journal of Graph Algorithms and Applications 14(1), 19–51 (2010)
Angelini, P., Didimo, W., Kobourov, S., Mchedlidze, T., Roselli, V., Symvonis, A., Wismath, S.: Monotone Drawings of Graphs with Fixed Embedding. Algorithmica (2013). doi:10.1007/s00453-013-9790-3
Arkin, E.M., Connelly, R., Mitchell, J.S.: On Monotone Paths among Obstacles with Applications to Planning Assemblies. In: SoCG 1989, pp. 334–343 (1989)
Brocot, A.: Calcul des Rouages par Approximation. Nouvelle Methode, Revue Chronometrique 6, 186–194 (1860)
Di Battista, G., Tamassia, R.: Algorithms for Plane Representations of Acyclic Digraphs. Theor. Comput. Sci. 61, 175–198 (1988)
Garg, A., Tammassia, R.: On the Computational Complexity of Upward and Rectilinear Planarity Testing. SIAM J. Comp. 31(2), 601–625 (2001)
Hardy, G., Write, E.M.: An Introduction to the Theory of Numbers, 5th edn. Oxford University Press (1989)
Hossain, M.I., Rahman, M.S.: Monotone Grid Drawings of Planar Graphs. In: Chen, J., Hopcroft, J.E., Wang, J. (eds.) FAW 2014. LNCS, vol. 8497, pp. 105–116. Springer, Heidelberg (2014)
Huang, W., Eades, P., Hong, S.-H.: A Graph Reading Behavior: Geodesic-Path Tendency. In Proceedings of IEEE Pacific Visualization Symposium, pp. 137–144 (2009)
Kindermann, P., Schulz, A., Spoerhase, J., Wolff, A.: On Monotone Drawings of Trees. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 488–500. Springer, Heidelberg (2014)
Moitra, A., Leighton, T.: Some Results on Greedy Embeddings in Metric Spaces. In: Proceedings FOCS 2008, pp. 337–346 (2008)
Papadimitriou, C.H., Ratajczak, D.: On a Conjecture Related to Geometric Routing. Theoretical Computer Science 344(1), 3–14 (2005)
Stern, M.A.: Ueber eine Zahlentheoretische Funktion. Journal fur die reine und angewandte Mathematik 55, 193–220 (1958)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
He, X., He, D. (2015). Compact Monotone Drawing of Trees. In: Xu, D., Du, D., Du, D. (eds) Computing and Combinatorics. COCOON 2015. Lecture Notes in Computer Science(), vol 9198. Springer, Cham. https://doi.org/10.1007/978-3-319-21398-9_36
Download citation
DOI: https://doi.org/10.1007/978-3-319-21398-9_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21397-2
Online ISBN: 978-3-319-21398-9
eBook Packages: Computer ScienceComputer Science (R0)