An Evolver program for weighted Steiner trees
Computational Geometry
2020-08-07 v1
Abstract
We present an algorithm to find near-optimal weighted Steiner minimal trees in the plane. The algorithm is implemented in Evolver programming language, which already contains many built-in energy minimisation routines. Some are invoked in the program, which enable it to consist of only 183 lines of source code. Our algorithm reproduces the physical experiment of a soap film detaching from connected pins towards a stable configuration. In the non-weighted case comparisons with GeoSteiner are drawn for terminals that form a pattern.
Keywords
Cite
@article{arxiv.2008.02398,
title = {An Evolver program for weighted Steiner trees},
author = {Henrique Botelho and Francisco Zampirolli and Valério Ramos Batista},
journal= {arXiv preprint arXiv:2008.02398},
year = {2020}
}