arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.1422cs.CG
收藏

图形绘制的伽罗瓦复杂性:为什么数值解对于力定向、谱和圆填充图是普遍存在的

The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings

Michael J. Bannister, William E. Devanny, David Eppstein, Michael T. Goodrich

摘要:

许多著名的图形绘制技术,包括力定向绘图,谱图布局,多维缩放和圆填充,都有代数公式。然而,用于产生这样的绘图的实际方法普遍使用迭代数值近似,而不是构造然后求解表示其精确解的代数表达式。为了解释这一现象,我们使用伽罗瓦理论表明,这些问题的许多变体的解决方案,不能表示嵌套的根或嵌套根的低次多项式。因此,即使在包括这种操作的扩展计算模型中,也不能精确地计算这种解。

英文摘要:

Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. However, practical methods for producing such drawings ubiquitously use iterative numerical approximations rather than constructing and then solving algebraic expressions representing their exact solutions. To explain this phenomenon, we use Galois theory to show that many variants of these problems have solutions that cannot be expressed by nested radicals or nested roots of low-degree polynomials. Hence, such solutions cannot be computed exactly even in extended computational models that include such operations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑