Journal of Undergraduate Research
Keywords
length minimizing network, n points, k-torus
College
Physical and Mathematical Sciences
Department
Mathematics
Abstract
Our project consisted of several components with the end goal being: given n points on the ktorus (a donut with k number of holes), what would the shortest path network be to connect all the n points (network meaning a network of paths connecting each of the n-points).
Recommended Citation
Petersen, W. Lauritz and Halverson, Dr. Denise
(2014)
"Length Minimizing Network for n points on the k-torus,"
Journal of Undergraduate Research: Vol. 2014:
Iss.
1, Article 1215.
Available at:
https://scholarsarchive.byu.edu/jur/vol2014/iss1/1215