Colored Simultaneous Geometric Embeddings and Universal Pointsets
- 121 Downloads
Universal pointsets can be used for visualizing multiple relationships on the same set of objects or for visualizing dynamic graph processes. In simultaneous geometric embeddings, the same point in the plane is used to represent the same object as a way to preserve the viewer’s mental map. In colored simultaneous embeddings this restriction is relaxed, by allowing a given object to map to a subset of points in the plane. Specifically, consider a set of graphs on the same set of n vertices partitioned into k colors. Finding a corresponding set of k-colored points in the plane such that each vertex is mapped to a point of the same color so as to allow a straight-line plane drawing of each graph is the problem of colored simultaneous geometric embedding.
For n-vertex paths, we show that there exist universal pointsets of size n, colored with two or three colors. We use this result to construct colored simultaneous geometric embeddings for a 2-colored tree together with any number of 2-colored paths, and more generally, a 2-colored outerplanar graph together with any number of 2-colored paths. For n-vertex trees, we construct small near-universal pointsets for 3-colored caterpillars of size n, 3-colored radius-2 stars of size n+3, and 2-colored spiders of size n. For n-vertex outerplanar graphs, we show that these same universal pointsets also suffice for 3-colored K 3-caterpillars, 3-colored K 3-stars, and 2-colored fans, respectively. We also present several negative results, showing that there exist a 2-colored planar graph and pseudo-forest, three 3-colored outerplanar graphs, four 4-colored pseudo-forests, three 5-colored pseudo-forests, five 5-colored paths, two 6-colored biconnected outerplanar graphs, three 6-colored cycles, four 6-colored paths, and three 9-colored paths that cannot be simultaneously embedded.
KeywordsSimultaneous embedding Simultaneous geometric embedding Colored simultaneous embedding Universal pointsets Graph drawing
Unable to display preview. Download preview PDF.
- 7.de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting Fary embeddings of planar graphs. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 426–433 (1988) Google Scholar
- 10.Dux, B., Iyer, A., Debray, S., Forrester, D., Kobourov, S.G.: Visualizing the behavior of dynamically modifiable code. In: 13th Workshop on Program Comprehension, pp. 337–340 (2005) Google Scholar
- 13.Fowler, J.J., Kobourov, S.G.: Minimum level nonplanar patterns for trees. In: 15th Symposium on Graph Drawing, GD 2007. LNCS, vol. 4875, pp. 69–75. Springer, Berlin (2008) Google Scholar
- 14.Fowler, J.J., Jünger, M., Kobourov, S.G., Schulz, M.: Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges. In: 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2008. LNCS, vol. 5344, pp. 146–158. Springer, Berlin (2008) CrossRefGoogle Scholar
- 15.Frati, F.: Embedding graphs simultaneously with fixed edges. In: 14th Symposium on Graph Drawing, GD 2006. LNCS, vol. 4372, pp. 108–113. Springer, Berlin (2007) Google Scholar
- 16.Frati, F., Kaufmann, M., Kobourov, S.G.: Constrained simultaneous and near-simultaneous embeddings. In: 15th Symposium on Graph Drawing, GD 2007. LNCS, vol. 4875, pp. 268–279. Springer, Berlin (2008) Google Scholar
- 18.Healy, P., Kuusik, A., Leipert, S.: Characterization of level non-planar graphs by minimal patterns. In: 6th Computing and Combinatorics Conference, COCOON 2000, pp. 74–84 (2000) Google Scholar
- 19.Kaufmann, M., Vrto, I., Geyer, M.: Two trees which are self-intersecting when drawn simultaneously. In: 13th Symposium on Graph Drawing, GD 2005. LNCS, vol. 3843, pp. 201–210. Springer, Berlin (2006) Google Scholar