论文标题
在三维欧几里得空间中的一些最小网络在四个点
Some minimum networks for four points in the three dimensional Euclidean Space
论文作者
论文摘要
我们为某些边界对称四面体r^3构建了一个最小树，该树具有两个节点（内部点），其权重（正数）具有相等的权重（正数），其特性是大约两个相反边缘的常见垂直线经过其中点。我们证明，对于同一边界对称的四面体，这条最小树的长度可能小于完整的施泰纳树的长度。
We construct a minimum tree for some boundary symmetric tetrahedra R^3, which has two nodes (interior points) with equal weights (positive numbers) having the property that the common perpendicular of some two opposite edges passes through their midpoints. We prove that the length of this minimum tree may have length less than the length of the full Steiner tree for the same boundary symmetric tetrahedra.
