CONSTRUCTING BELTS IN TWO-DIMENSIONAL ARRANGEMENTS WITH APPLICATIONS

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

[2] BENTLEY JL, 1979, COMPUT SURV, V11, P397, DOI 10.1145/356789.356797

[3] DECOMPOSABLE SEARCHING PROBLEMS [J]. INFORMATION PROCESSING LETTERS, 1979, 8 (05) : 244 - 251

[4] BROWN KQ, 1980, CMUCS80101 CARN U DE

[5] Chazelle B., 1983, 24th Annual Symposium on Foundations of Computer Science, P217, DOI 10.1109/SFCS.1983.75

[6] COLE R, 1984, 117 NEW YORK U DEP C

[7] COLE R, 1984, 16TH P ANN SIGACT S, P154

[8] DOBKIN DP, COMMUNICATION

[9] POLYGONAL INTERSECTION SEARCHING [J]. INFORMATION PROCESSING LETTERS, 1982, 14 (02) : 74 - 79

[10] ON THE NUMBER OF LINE SEPARATIONS OF A FINITE-SET IN THE PLANE [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 1985, 38 (01) : 15 - 29

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

[2] BENTLEY JL, 1979, COMPUT SURV, V11, P397, DOI 10.1145/356789.356797

[3] DECOMPOSABLE SEARCHING PROBLEMS [J]. INFORMATION PROCESSING LETTERS, 1979, 8 (05) : 244 - 251

[4] BROWN KQ, 1980, CMUCS80101 CARN U DE

[5] Chazelle B., 1983, 24th Annual Symposium on Foundations of Computer Science, P217, DOI 10.1109/SFCS.1983.75

[6] COLE R, 1984, 117 NEW YORK U DEP C

[7] COLE R, 1984, 16TH P ANN SIGACT S, P154

[8] DOBKIN DP, COMMUNICATION

[9] POLYGONAL INTERSECTION SEARCHING [J]. INFORMATION PROCESSING LETTERS, 1982, 14 (02) : 74 - 79

[10] ON THE NUMBER OF LINE SEPARATIONS OF A FINITE-SET IN THE PLANE [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 1985, 38 (01) : 15 - 29