BATCHED DYNAMIC SOLUTIONS TO DECOMPOSABLE SEARCHING PROBLEMS

[1] BENTLEY JL, 1979, INFORM PROCESS LETT, V8, P133

[2] BENTLEY JL, 1980, IEEE T COMPUT, V29, P571, DOI 10.1109/TC.1980.1675628

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

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

[5] ON THE EQUIVALENCE OF SOME RECTANGLE PROBLEMS [J]. INFORMATION PROCESSING LETTERS, 1982, 14 (03) : 124 - 127

[6] ON THE INTERSECTION OF ORTHOGONAL OBJECTS [J]. INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) : 177 - 181

[7] EDELSBRUNNER H, 1980, F59 TU I INF REP

[8] OPTIMAL SEARCH IN PLANAR SUBDIVISIONS [J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (01) : 28 - 35

[9] FINDING INTERSECTION OF RECTANGLES BY RANGE SEARCH [J]. JOURNAL OF ALGORITHMS, 1981, 2 (04) : 337 - 347

[10] AN IMPROVED ALGORITHM FOR THE RECTANGLE ENCLOSURE PROBLEM [J]. JOURNAL OF ALGORITHMS, 1982, 3 (03) : 218 - 224

[1] BENTLEY JL, 1979, INFORM PROCESS LETT, V8, P133

[2] BENTLEY JL, 1980, IEEE T COMPUT, V29, P571, DOI 10.1109/TC.1980.1675628

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

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

[5] ON THE EQUIVALENCE OF SOME RECTANGLE PROBLEMS [J]. INFORMATION PROCESSING LETTERS, 1982, 14 (03) : 124 - 127

[6] ON THE INTERSECTION OF ORTHOGONAL OBJECTS [J]. INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) : 177 - 181

[7] EDELSBRUNNER H, 1980, F59 TU I INF REP

[8] OPTIMAL SEARCH IN PLANAR SUBDIVISIONS [J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (01) : 28 - 35

[9] FINDING INTERSECTION OF RECTANGLES BY RANGE SEARCH [J]. JOURNAL OF ALGORITHMS, 1981, 2 (04) : 337 - 347

[10] AN IMPROVED ALGORITHM FOR THE RECTANGLE ENCLOSURE PROBLEM [J]. JOURNAL OF ALGORITHMS, 1982, 3 (03) : 218 - 224