A NEW O(N.LOG-N) ALGORITHM FOR COMPUTING THE INTERSECTION OF CONVEX POLYGONS

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] THE ELLIPSOID METHOD - A SURVEY [J]. OPERATIONS RESEARCH, 1981, 29 (06) : 1039 - 1091

[3] A FAST ALGORITHM FOR THE 2-VARIABLE INTEGER PROGRAMMING PROBLEM [J]. JOURNAL OF THE ACM, 1984, 31 (01) : 99 - 113

[4] Graham R. L., 1972, Information Processing Letters, V1, P132, DOI 10.1016/0020-0190(72)90045-2

[5] LEE DT, 1984, IEEE T COMPUT, V33, P1072, DOI 10.1109/TC.1984.1676388

[6] MATHEISS TH, 1980, MATH PROGRAMMING, V18, P308

[7] LINEAR-TIME ALGORITHMS FOR LINEAR-PROGRAMMING IN R3 AND RELATED PROBLEMS [J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (04) : 759 - 776

[8] LINEAR-PROGRAMMING IN LINEAR TIME WHEN THE DIMENSION IS FIXED [J]. JOURNAL OF THE ACM, 1984, 31 (01) : 114 - 127

[9] CONVEX HULLS OF FINITE SETS OF POINTS IN 2 AND 3 DIMENSIONS [J]. COMMUNICATIONS OF THE ACM, 1977, 20 (02) : 87 - 93

[10] SHAMOS MI, 1975, 7TH P ANN ACM S THEO, P224

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] THE ELLIPSOID METHOD - A SURVEY [J]. OPERATIONS RESEARCH, 1981, 29 (06) : 1039 - 1091

[3] A FAST ALGORITHM FOR THE 2-VARIABLE INTEGER PROGRAMMING PROBLEM [J]. JOURNAL OF THE ACM, 1984, 31 (01) : 99 - 113

[4] Graham R. L., 1972, Information Processing Letters, V1, P132, DOI 10.1016/0020-0190(72)90045-2

[5] LEE DT, 1984, IEEE T COMPUT, V33, P1072, DOI 10.1109/TC.1984.1676388

[6] MATHEISS TH, 1980, MATH PROGRAMMING, V18, P308

[7] LINEAR-TIME ALGORITHMS FOR LINEAR-PROGRAMMING IN R3 AND RELATED PROBLEMS [J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (04) : 759 - 776

[8] LINEAR-PROGRAMMING IN LINEAR TIME WHEN THE DIMENSION IS FIXED [J]. JOURNAL OF THE ACM, 1984, 31 (01) : 114 - 127

[9] CONVEX HULLS OF FINITE SETS OF POINTS IN 2 AND 3 DIMENSIONS [J]. COMMUNICATIONS OF THE ACM, 1977, 20 (02) : 87 - 93

[10] SHAMOS MI, 1975, 7TH P ANN ACM S THEO, P224