Fast Smallest-Enclosing-Ball Computation in High Dimensions
暂无分享,去创建一个
[1] Nimrod Megiddo,et al. Linear-Time Algorithms for Linear Programming in R^3 and Related Problems , 1982, FOCS.
[2] Bernd Gärtner,et al. An efficient, exact, and generic quadratic programming solver for geometric optimization , 2000, SCG '00.
[3] Joseph S. B. Mitchell,et al. Comuting Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions , 2003, ALENEX.
[4] N. Megiddo. Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.
[5] Hermann A. Maurer,et al. New Results and New Trends in Computer Science , 1991, Lecture Notes in Computer Science.
[6] Gene H. Golub,et al. Matrix computations (3rd ed.) , 1996 .
[7] Hava T. Siegelmann,et al. Support Vector Clustering , 2002, J. Mach. Learn. Res..
[8] T. Hopp,et al. An Algorithm for Computing the Minimum Covering Sphere in Any Dimension , 1989 .
[9] Emo Welzl,et al. Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.
[10] Ashish Goel,et al. Reductions among high dimensional proximity problems , 2001, SODA '01.
[11] Bernd Gärtner,et al. Fast and Robust Smallest Enclosing Balls , 1999, ESA.
[12] Martin E. Dyer,et al. A class of convex programs with applications to computational geometry , 1992, SCG '92.
[13] Kim-Chuan Toh,et al. Efficient Algorithms for the Smallest Enclosing Ball Problem , 2005, Comput. Optim. Appl..
[14] 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).
[15] Sachin Jambawalikar,et al. Hand Recognition Using Geometric Classifiers , 2004, ICBA.