Orthogeodesic Point-Set Embedding of Trees
Let S be a set of N grid points in the plane, and let G a graph with n vertices (n ≤ N). An orthogeodesic point-set embedding of G on S is a drawing of G such that each vertex is drawn as a point of S and each edge is an orthogonal chain with bends on grid points whose length is equal to the Manhattan distance. We study the following problem. Given a family of trees \(\mathcal F\) what is the minimum value f(n) such that every n-vertex tree in \(\mathcal F\) admits an orthogeodesic point-set embedding on every grid-point set of size f(n)? We provide polynomial upper bounds on f(n) for both planar and non-planar orthogeodesic point-set embeddings as well as for the case when edges are required to be L-shaped chains.
- 7.Di Giacomo, E., Grilli, L., Krug, M., Liotta, G., Rutter, I.: Hamiltonian Orthogeodesic Alternating Paths. In: Iliopoulos, C.S. (ed.) IWOCA 2011. LNCS, vol. 7056, pp. 170–181. Springer, Heidelberg (2011)Google Scholar
- 11.Fink, M., Haunert, J.-H., Mchedlidze, T., Spoerhase, J., Wolff, A.: Drawing graphs with vertices at specified positions and crossings at large angles. pre-print, arXiv:1107.4970v1 (July 2011)Google Scholar
- 12.Di Giacomo, E., Frati, F., Fulek, R., Grilli, L., Krug, M.: Orthogeodesic point-set embedding of trees. Technical Report 2011-24, Kalrsruhe Institute of Technology, KIT (2011)Google Scholar