论文信息 - Distances in a rigid unit-distance graph in the plane

Distances in a rigid unit-distance graph in the plane

Abstract It is proved that a number d>0 can appear as the Euclidean distance between two vertices in some “rigid” unit-distance graph in the plane if and only if d is an algebraic number.

Hiroshi Maehara | H. Maehara

[1] B. Roth,et al. The rigidity of graphs , 1978 .

[2] H. Maehara,et al. Algebraic distance graphs and rigidity , 1990 .

[3] A. Kempe. On a General Method of describing Plane Curves of the nth degree by Linkwork , 1875 .

[4] B. Roth. Rigid and Flexible Frameworks , 1981 .

[5] John E. Hopcroft,et al. Movement Problems for 2-Dimensional Linkages , 1984, SIAM J. Comput..