Approximate Steiner tree
- Konrad Swanepoel
The root is at the bottom. There are 2^3+1 terminals, including the root. Going away from the root, you can move the right neighbour of each Steiner point with your mouse to create an approximate Steiner tree (shown in blue). The Steiner minimal tree for the same topology is constructed using the Melzak algorithm. If the errors become too large, the Steiner tree will break down.