三维欧几里得空间中四点的最小网络
Some minimum networks for four points in the three dimensional Euclidean Space
摘要：
我们为某个边界对称四面体R^3构造了一棵最小树，该四面体有两个权值相等（正数）的节点（内点），具有两条相对边的公垂线通过其中点的性质。我们证明了对于相同的边界对称四面体，这棵最小树的长度可能小于全Steiner树的长度。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
