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

8点刚性图的欧氏嵌入的一个上界

An upper bound on Euclidean embeddings of rigid graphs with 8 vertices

Stylianos C. Despotakis, Ioannis Z. Emiris

摘要:

一个图在R^d中被称为(一般地)刚性的,如果对于任何充分一般的边长的选择,它可以以有限数量的不同方式嵌入R^d中,模刚性变换。在这里,我们处理的问题,确定最大数量的平面欧氏嵌入的极小刚性图与8顶点,因为这是最小的未知情况下,在平面上。

英文摘要:

A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in R^d in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining the maximum number of planar Euclidean embeddings of minimally rigid graphs with 8 vertices, because this is the smallest unknown case in the plane.

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

↑