Papers
Topics
Authors
Recent
2000 character limit reached

Steiner trees and spanning trees in six-pin soap films

Published 8 Jun 2008 in cs.CG, cond-mat.other, and physics.class-ph | (0806.1340v1)

Abstract: 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.

Citations (13)

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.