Constructing Minimal Spanning Steiner Trees with Bounded Path Length
Steiner Minimal Trees
description
Transcript of Steiner Minimal Trees
![Page 1: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/1.jpg)
Steiner Tree Applications
Presented by T. N. Badri
![Page 2: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/2.jpg)
The Steiner problem dates back to Pierre Fermat. Even Napolean has worked on this problem. Consider three points V1, V2, and V3. The shortest network interconnecting these three points is the sum of the two shortest sides of the triangle.
If one includes a fourth point S1 in the plane of the triangle, one can find a much shorter interconnecting network.
V1
V2 V3
V1
V2 V3
S1
![Page 3: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/3.jpg)
If the three points in question are vertices of an equilateral triangle with side of length 2 kms, one can make some simple calculations such as:
Length = 4 kms
2/3 (3)
Length = 3(2/3)3 = 3.4641 kms
a saving of about 13.4%
3
V1
V2 V3
V1
V2 V3
S1
![Page 4: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/4.jpg)
If it costs about Rs. 3 lakhs to lay one km of road this is a saving of 0.134 * 300,000 * 4 = Rs. 160,800 on an initial total cost of Rs. 12 lakhs.
![Page 5: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/5.jpg)
Steiner points have some properties
• Exactly three edges meet at every Steiner vertex.
• The angles between the edges meeting at a Steiner vertex is 120 degrees.
• If there are N vertices then we can use a maximum of N-2 Steiner vertices.
![Page 6: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/6.jpg)
MST length = 1 + 3
SMT length is 2.6458
A saving of 3.1588%
1
32
(-0.2857, 0.2474)
![Page 7: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/7.jpg)
Some triangles are such that a Steiner point does not help
2
2
MST length = SMT length = 4No savings!
![Page 8: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/8.jpg)
Geometric Construction using compass and straight edge
![Page 9: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/9.jpg)
Four terminal sites in 3d with one Steiner point
Four terminal sites in 3d with two Steiner points
![Page 10: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/10.jpg)
Steiner trees with the rectilinear metric appear when laying down conductive pathways on a printed circuit board.
![Page 11: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/11.jpg)
HANAN GRID
![Page 12: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/12.jpg)
Development of Path Topology in 2d(Counter-clockwise from top right)
![Page 13: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/13.jpg)
Planar-Sausage with 8 terminal sites
Conjectured infinite 2d structure with best Steiner Ratio 3/2
![Page 14: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/14.jpg)
Planar-Sausage with 9 terminal sites
Conjectured infinite 2d structure with best Steiner Ratio 3/2
![Page 15: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/15.jpg)
Planar-Sausage with 10 terminal sites
Conjectured 2d structure with best Steiner Ratio 3/2
![Page 16: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/16.jpg)
Planar-Sausage with 11 terminal sites
Conjectured infinite 2d structure with best Steiner Ratio = 3/2
![Page 17: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/17.jpg)
Steiner Ratio in 2d falls to 3/2 as the number of terminal sites increase
![Page 18: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/18.jpg)
R-Sausage
Minimum Spanning Tree
![Page 19: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/19.jpg)
R-Sausage
Conjectured infinite 3d structure with best Steiner Ratio
![Page 20: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/20.jpg)
Another view of 3d sausage
Minimum SpanningTree
Steiner MinimalTree
![Page 21: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/21.jpg)
Steiner Ratio in 3d falls to 0.784 as the number of terminal sites increase
![Page 22: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/22.jpg)
Four types of Steiner points -according to neighbouring vertices
![Page 23: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/23.jpg)
R-Sausage structure is preserved under composition.It is a semi-group.
![Page 24: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/24.jpg)
Topology for Even and Odd SizedR-Sausages in 3d
![Page 25: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/25.jpg)
d1
d2
d3
(x2,y2)
(x1, y1)
(x3,y3)
(x,y)
321
3
3
2
2
1
1
111ddd
dx
dx
dx
x
321
3
3
2
2
1
1
111ddd
dy
dy
dy
y
The average of the vertex coordinates weighted by their reciprocal distances from the Steiner point.
![Page 26: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/26.jpg)
Depth First Search of point set
Heuristic for largepoint set
![Page 27: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/27.jpg)
Depth First Search of point set –The first Steiner point
Heuristic for largepoint set
![Page 28: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/28.jpg)
Depth First Search of point set –The second Steiner point
Heuristic for largepoint set
![Page 29: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/29.jpg)
Depth First Search of point set –The third Steiner point
Heuristic for largepoint set
![Page 30: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/30.jpg)
Depth First Search of point set –The fourth Steiner point
Heuristic for largepoint set
![Page 31: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/31.jpg)
Depth First Search of point set –Return to root node
Heuristic for largepoint set
![Page 32: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/32.jpg)
Depth First Search of point set – First Steiner vertex
Heuristic for largepoint set
![Page 33: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/33.jpg)
Depth First Search of point set – Second Steiner vertex
Heuristic for largepoint set
![Page 34: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/34.jpg)
Depth First Search of point set – Third Steiner vertex
Heuristic for largepoint set
![Page 35: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/35.jpg)
Depth First Search of point set – Fourth Steiner vertex
Heuristic for largepoint set
![Page 36: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/36.jpg)
Depth First Search of point set – Fifth Steiner vertex
Heuristic for largepoint set
![Page 37: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/37.jpg)
Steiner Tree and Minimum Spanning Tree fora small random point set in unit cube
Minimal Interconnecting Tree for data without any structure
![Page 38: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/38.jpg)
Steiner Tree and Minimum Spanning Tree fora medium sized random point set in unit cube
Minimal Interconnecting Tree for data without any structure
![Page 39: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/39.jpg)
Steiner Tree and Minimum Spanning Tree forHundred random points in unit cube
Minimal Interconnecting Tree for data without any structure
![Page 40: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/40.jpg)
Steiner Tree and Minimum Spanning Tree for500 random points in unit cube
Minimal Interconnecting Tree for data without any structure
![Page 41: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/41.jpg)
Amino AcidSequence of aProtein (Lysozyme)
![Page 42: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/42.jpg)
Network of Amide Planes in a Protein
![Page 43: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/43.jpg)
Three DimensionalStructure of TwoAmide Planes
![Page 44: Steiner Minimal Trees](https://reader036.fdocuments.net/reader036/viewer/2022062406/559138cd1a28ab07498b46f1/html5/thumbnails/44.jpg)
THANK YOU