Hexagonal Coordinate Systems and Steiner Minimal Trees
01 January 1986
The hexagonal coordinate system consists of three axes going through a point forming six 60degree angles. The hexagonal coordinate system is natural to the Euclidean Steiner tree problem since the lines of a full Steiner minimal tree always form 120degree angles. In this paper we develop the calculus of hexagonal coordinates and show how it can be applied to the Steiner tree problem.