An Efficient Geometric Solution to the Minimum Spanning Circle Problem
暂无分享,去创建一个
[1] Donald W. Hearn,et al. Efficient Algorithms for the (Weighted) Minimum Circle Problem , 1982, Oper. Res..
[2] Chrystal. On the problem to construct the minimum circle enclosing n given points in a plane , 1884 .
[3] D. Hearn,et al. The Minimum Covering Sphere Problem , 1972 .
[4] Richard L. Francis,et al. Letter to the Editor - Some Aspects of a Minimax Location Problem , 1967, Oper. Res..
[5] P. K. Chaudhuri,et al. Letter to the Editor---Note on Geometrical Solution for Some Minimax Location Problems , 1981 .
[6] N. Megiddo. Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.
[7] D. Hearn,et al. Geometrical Solutions for Some Minimax Location Problems , 1972 .
[8] Soren Kruse Jacobsen. An algorithm for the minimax weber problem , 1981 .
[9] L. M. Blumenthal,et al. On the spherical surface of smallest radius enclosing a bounded subset of $n$-dimensional euclidean space , 1941 .
[10] J. Sylvester. XXVII. On Poncelet's approximate linear Valuation of surd forms , 1860 .
[11] Nimrod Megiddo,et al. Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).