Anastasios Zachos
Published 2020-01-19Version 1
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.
Comments: 9 pages, 2 figures
A fundamental property of the Fermat-Torricelli point for tetrahedra in the three dimensional Euclidean Space
How to take shortcuts in Euclidean space: making a given set into a short quasi-convex set
On $m$-point homogeneous polyhedra in $3$-dimensional Euclidean space
![QR code for arXiv:2001.06866 [math.MG]](http://oss.arxitics.com/images/favicon.svg)