有人懂一点树理论么？

salushijie

恳请大家将这个理论翻译一下，谢谢！



Define a simply connected tree T with leaf nodes Pi
,
i = 1, 2,…N. Define by l
ij
the dis-tance between nodes
Piand P
j
as measured along the edges of the tree; that
is, l
ij
is the sum of the lengths of all the edges between
nodes P
iand P
j. For each leaf node P
i
, define a leaf
vertex ui
in the unit square u
i,x∈[0,1], u
i,y∈[0,1]. Then
a crease pattern exists that transforms the unit square
into a uniaxial base whose projection is T if
(a) |ui
–uj
| ≥ l
ij
for every i,j;
(b) every leaf vertex belongs to a polygon whose
boundary is composed of segments, each of
which is either on the convex hull of the leaf
vertices or is a line along which |ui
–uj
| = l
ij
;
(c) the projection of a path around each polygon
follows a simple path around some subset of
the tree that does not cross any edge of the tree
more than twice.
Furthermore, in such a base, Pi
is the projection of ui
for all i.

罗炳之家

定义一个单连通T树与叶子节点圆周率
　　,
　　i = 1、2、…N。定义了l
　　Ij
　　节点之间的dis-tance
　　Piand P
　　J
　　树的沿边缘;衡量
　　是,我
　　Ij
　　是所有的长度的总和之间的边缘
　　节点P
　　我和P
　　每个叶子节点P j。
　　我
　　,定义一个叶子
　　顶点ui
　　在单位广场
　　我,x∈[0,1],u
　　我,y∈[0,1]。然后
　　折痕模式存在转换单位正方形
　　成一个单轴的投影是T如果基础
　　(一)| ui
　　-uj
　　|≥l
　　Ij
　　对于每一个

万事通360

理论很难的，这是我实践得出的结果，劝楼主还是不要学了

salushijie

万事通360 发表于 2014-8-2 21:36
理论很难的，这是我实践得出的结果，劝楼主还是不要学了

x谢谢你好意劝解