On the complexity of polyhedral separability
暂无分享,去创建一个
[1] 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).
[2] Nimrod Megiddo,et al. Linear-Time Algorithms for Linear Programming in R^3 and Related Problems , 1982, FOCS.
[3] N. Megiddo. Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.
[4] Nimrod Megiddo,et al. On the complexity of locating linear facilities in the plane , 1982, Oper. Res. Lett..
[5] Chul E. Kim,et al. Digital disks and a digital compactness measure , 1984, STOC '84.
[6] Nimrod Megiddo,et al. Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.
[7] Alok Aggarwal,et al. Finding minimal convex nested polygons , 1985, SCG '85.
[8] N. Megiddo,et al. Computing circular separability , 1986 .
[9] David Haussler,et al. Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension , 1986, STOC '86.
[10] Herbert Edelsbrunner,et al. Minimum Polygonal Separation , 1988, Inf. Comput..