Computing Steiner points for gradient-constrained minimum networks

@article{Thomas2010ComputingSP,
  title={Computing Steiner points for gradient-constrained minimum networks},
  author={D. Thomas and J. Weng},
  journal={Discret. Optim.},
  year={2010},
  volume={7},
  pages={21-31}
}
Let T"g be a gradient-constrained minimum network, that is, a minimum length network spanning a given point set in 3-dimensional space with edges that are constrained to have gradients no more than an upper bound m. Such networks occur in underground mines where the slope of the declines (tunnels) cannot be too steep due to haulage constraints. Typically the gradient is less than 1/7. By defining a new metric, the gradient metric, the problem of finding T"g can be approached as an unconstrained… Expand
3 Citations

References

SHOWING 1-10 OF 23 REFERENCES
Gradient-constrained minimum networks. I. Fundamentals
Locally minimal uniformly oriented shortest networks
Minimum Networks for Four Points in Space
Minimum cost flow-dependent communication networks
A variational approach to the Steiner network problem
Steiner Tree Problems in VLSI Layout Designs
Steiner Minimal Trees in E 3 : Theory, Algorithms, and Applications
On the problem of Steiner
...
1
2
3
...