ON THE EQUIVALENCE OF SOME RECTANGLE PROBLEMS

[1] MULTIDIMENSIONAL DIVIDE-AND-CONQUER [J]. COMMUNICATIONS OF THE ACM, 1980, 23 (04) : 214 - 229

[2] EDELSBRUNNER H, 1981, UNPUB EQUIVALENCES R

[3] EDELSBRUNNER H, 1980, F47 TU GRAZ I INF RE

[4] EDELSBRUNNER H, UNPUB INFORM PROCESS

[5] A LOWER BOUND ON THE COMPLEXITY OF ORTHOGONAL RANGE QUERIES [J]. JOURNAL OF THE ACM, 1981, 28 (04) : 696 - 705

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

[7] MCCREIGHT EM, 1981, CSL815 XEROX PARC RE

[8] MCCREIGHT EM, 1980, CSL809 XEROX PARC RE

[9] WORST-CASE OPTIMAL INSERTION AND DELETION METHODS FOR DECOMPOSABLE SEARCHING PROBLEMS [J]. INFORMATION PROCESSING LETTERS, 1981, 12 (04) : 168 - 173

[10] VAISHNAVI VK, 1980, 80CS8 MCMAST U UN CO

[1] MULTIDIMENSIONAL DIVIDE-AND-CONQUER [J]. COMMUNICATIONS OF THE ACM, 1980, 23 (04) : 214 - 229

[2] EDELSBRUNNER H, 1981, UNPUB EQUIVALENCES R

[3] EDELSBRUNNER H, 1980, F47 TU GRAZ I INF RE

[4] EDELSBRUNNER H, UNPUB INFORM PROCESS

[5] A LOWER BOUND ON THE COMPLEXITY OF ORTHOGONAL RANGE QUERIES [J]. JOURNAL OF THE ACM, 1981, 28 (04) : 696 - 705

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

[7] MCCREIGHT EM, 1981, CSL815 XEROX PARC RE

[8] MCCREIGHT EM, 1980, CSL809 XEROX PARC RE

[9] WORST-CASE OPTIMAL INSERTION AND DELETION METHODS FOR DECOMPOSABLE SEARCHING PROBLEMS [J]. INFORMATION PROCESSING LETTERS, 1981, 12 (04) : 168 - 173

[10] VAISHNAVI VK, 1980, 80CS8 MCMAST U UN CO