# 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}
}
• Published 2010
• Computer Science, Mathematics
• Discret. Optim.
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