Computer Science – Computational Geometry
Scientific paper
2008-06-08
Computer Science
Computational Geometry
Scientific paper
We have studied the Steiner tree problem using six-pin soap films in detail. We extend the existing method of experimental realisation of Steiner trees in $n$-terminal problem through soap films to observe new non-minimal Steiner trees. We also produced spanning tree configurations for the first time by our method. Experimentally, by varying the pin diameter, we have achieved these new stable soap film configurations. A new algorithm is presented for creating these Steiner trees theoretically. Exact lengths of these Steiner tree configurations are calculated using a geometrical method. An exact two-parameter empirical formula is proposed for estimating the lengths of these soap film configurations in six-pin soap film problem.
Dutta Prasun
Khastgir Pratik S.
Roy Anushree
No associations
LandOfFree
Steiner trees and spanning trees in six-pin soap films does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Steiner trees and spanning trees in six-pin soap films, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Steiner trees and spanning trees in six-pin soap films will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-65705