Linear programming and convex hulls made easy
暂无分享,去创建一个
[1] Martin E. Dyer,et al. A randomized algorithm for fixed-dimensional linear programming , 1989, Math. Program..
[2] Donald R. Chand,et al. An Algorithm for Convex Polytopes , 1970, JACM.
[3] F. P. Preparata,et al. Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.
[4] Kenneth L. Clarkson,et al. Linear Programming in O(n * (3_d)_2) Time , 1986, Inf. Process. Lett..
[5] Nimrod Megiddo,et al. Linear-Time Algorithms for Linear Programming in R^3 and Related Problems , 1982, FOCS.
[6] Raimund Seidel,et al. Constructing higher-dimensional convex hulls at logarithmic cost per face , 1986, STOC '86.
[7] R. Seidel. A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions , 1981 .
[8] 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).
[9] Martin E. Dyer,et al. Linear Time Algorithms for Two- and Three-Variable Linear Programs , 1984, SIAM J. Comput..
[10] N. Megiddo. Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.
[11] Kenneth L. Clarkson,et al. Applications of random sampling in computational geometry, II , 1988, SCG '88.
[12] GARRET SWART,et al. Finding the Convex Hull Facet by Facet , 1985, J. Algorithms.
[13] Nimrod Megiddo,et al. Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.
[14] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.