An efficient algorithm for the Euclidean two-center problem
暂无分享,去创建一个
[1] Nimrod Megiddo,et al. Linear-Time Algorithms for Linear Programming in R^3 and Related Problems , 1982, FOCS.
[2] C. O. Oakley,et al. The Enjoyment of Mathematics. , 1957 .
[3] Micha Sharir,et al. An expander-based approach to geometric optimization , 1993, SCG '93.
[4] N. Megiddo. Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.
[5] Zvi Drezner,et al. The Planar Two-Center and Two-Median Problems , 1984, Transp. Sci..
[6] M. Keil,et al. A Simple Algorithm for Determining the Envelope of a Set of Lines , 1991, Inf. Process. Lett..
[7] Subhash Suri,et al. Finding tailored partitions , 1989, SCG '89.
[8] Otto Nurmi,et al. Algorithms for computational geometry , 1987 .
[9] Pitu B. Mirchandani,et al. Location on networks : theory and algorithms , 1979 .
[10] Richard L. Francis,et al. Letter to the Editor - Some Aspects of a Minimax Location Problem , 1967, Oper. Res..
[11] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[12] Michael Ian Shamos,et al. Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).