Some Analytics for Steiner Minimal Tree Problem for Four Terminals
Alexei Yu. Uteshev

TL;DR
This paper derives explicit formulas for the Steiner points in the minimal tree connecting four terminals in the Euclidean plane, enabling analysis of how terminal positions affect Steiner point locations.
Contribution
It provides the first explicit formulas for Steiner point coordinates in the four-terminal Euclidean Steiner minimal tree problem.
Findings
Formulas for Steiner point coordinates are explicitly derived.
Terminal positions influence Steiner point locations significantly.
The formulas facilitate analysis of Steiner tree configurations.
Abstract
Given the coordinates of four terminals in the Euclidean plane we present explicit formulas for Steiner point coordinates for Steiner minimal tree problem. We utilize the obtained formulas for evaluation of the influence of terminal coordinates on the loci of Steiner points.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVLSI and FPGA Design Techniques · Computational Geometry and Mesh Generation · Interconnection Networks and Systems
