主题
Search

图嵌入

下载 Mathematica Notebook下载 Wolfram Notebook
CubicalGraphEmbeddings

图嵌入，有时也称为图绘制，是 图 的一种特定画法。图嵌入最常在平面上绘制，但也可以在三个或更多维度中构建。上图显示了 立方体图 的几种嵌入方式。最常见的图嵌入通常是 直线嵌入，其中所有边都绘制为直线段。

CubicalGraphCircular

对嵌入的良好选择可以产生特别具有启发性的图表。例如，立方体图 的圆形（左侧）嵌入说明了该图固有的对称性。

GraphEmbeddings

Skiena (1990) 考虑了多种不同类型的嵌入，包括 圆形、分级、放射状、根和弹簧。图嵌入可以在 Wolfram 语言 中使用以下选项在二维中可视化GraphLayout. 或者，GraphPlot[g] 可以在二维中使用，以及GraphPlot3D[g] 在三维中使用。树的嵌入可以使用以下方法可视化TreePlot[g]。

Hong 和 Eades (2003) 给出了一种线性时间算法，用于绘制具有最大对称性的 不连通 平面图。Freivalds 等人 (2002) 给出了一种基于 多格骨牌 填充的嵌入 不连通图 的算法。

Wolfram 语言中提供了许多图的某些类型的预计算嵌入，如GraphData[g,"Graph", type]。

另请参阅

圆形嵌入, 嵌入, 积分嵌入, 平面嵌入, 平面直线嵌入, 直线交叉数, 直线嵌入, 单位距离图

使用 探索

参考文献

Chung, F.; Leighton, T.; and Rosenberg, A. "Embeddings Graphs in Books: A Layout Problem with Applications to VLSI Design." SIAM J. Algebraic Disc. Meth. 8, 33-58, 1987.Di Battista, G.; Eades, P.; Tamassia, R.; and Tollis, I. G. Graph Drawing: Algorithms for the Visualization of Graphs. Englewood Cliffs, NJ: Prentice-Hall, 1998.Di Battista, G.; Garg, A.; Liotta, G.; Tamassia, R.; Tassinari, E.; and Vargiu, F. "An Experimental Comparison of Four Graph Drawing Algorithms." Computational Geom. 7, 303-325, 1997.Eades, P. "A Heuristic for Graph Drawing." Congr. Numer. 42, 149-160, 1984.Eades, P.; Fogg, I.; and Kelly, D. SPREMB: A System for Developing Graph Algorithms. Technical Report. Department of Computer Science. St. Lucia, Queensland, Australia: University of Queensland, 1988.Eades, P. and Tamassia, R. "Algorithms for Drawing Graphs: An Annotated Bibliography." Technical Report CS-89-09. Department of Computer Science. Providence, RI: Brown University, Feb. 1989.Freivalds, K.; Dogrusoz, U.; and Kikusts, P. "Disconnected Graph Layout and the Polyomino Packing Approach." In Graph Drawing: 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers (Ed. P. Mutzel, M. Jünger, and S. Leipert). Berlin: Springer, pp. 378-391, 2002.Hong, S.-H. and Eades, P. "Symmetric Layout of Disconnected Graphs." In Algorithms and Computation: 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings (Ed. T. Ibaraki, N. Katoh, and H. Ono). Berlin: Springer, pp. 405-414, 2003.Kamada, T. and Kawai, S. "An Algorithm for Drawing General Undirected Graphs." Inform. Processing Lett. 31, 7-15, 1989.Malitz, S. M. "Genus g Graphs Have Pagenumber O(sqrt(g))." In Proc. 29th Sympos. Found. Computer Sci. IEEE Press, pp. 458-468, 1988.Pemmaraju, S. and Skiena, S. Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Cambridge, England: Cambridge University Press, 2003.Reingold, E. and Tilford, J. "Tidier Drawings of Trees." IEEE Trans. Software Engin. 7, 223-228, 1981.Skiena, S. "Graph Embeddings." §3.3 in Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, pp. 81 and 98-118, 1990.Supowit, K. and Reingold, E. "The Complexity of Drawing Trees Nicely." Acta. Inform. 18, 377-392, 1983.Tamassia, R. "Graph Drawing." Ch. 21 in Handbook of Computational Geometry (Ed. J.-R. Sack and J. Urrutia). Amsterdam, Netherlands: North-Holland, pp. 937-971, 2000.Vaucher, J. "Pretty Printing of Trees." Software Pract. Experience 10, 553-561, 1980.Wetherell, C. and Shannon, A. "Tidy Drawings of Trees." IEEE Trans. Software Engin. 5, 514-520, 1979.White, A. T. "Imbedding Problems in Graph Theory." Ch. 6 in Graphs of Groups on Surfaces: Interactions and Models (Ed. A. T. White). Amsterdam, Netherlands: Elsevier, pp. 49-72, 2001.

在 中被引用

图嵌入

请引用为

Weisstein, Eric W. "图嵌入。" 来自 --一个 Wolfram 网络资源。 https://mathworld.net.cn/GraphEmbedding.html

学科分类