POLYGON RETRIEVAL

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

[2] EFFICIENT WORST-CASE DATA-STRUCTURES FOR RANGE SEARCHING [J]. ACTA INFORMATICA, 1980, 13 (02) : 155 - 168

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

[4] MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (09) : 509 - 517

[5] BENTLEY JL, 1980, J ALGORITHMS, V0001, P00301

[6] Bently J. L., 1975, Information Processing Letters, V3, P170, DOI 10.1016/0020-0190(75)90034-4

[7] CHAZELLE B, 1979, 11TH P ANN ACM S THE, P38

[8] Dobkin D., 1976, SIAM Journal on Computing, V5, P181, DOI 10.1137/0205015

[9] Finkel R. A., 1974, Acta Informatica, V4, P1, DOI 10.1007/BF00288933

[10] Fredman M. L., 1980, 21st Annual Symposium on Foundations of Computer Science, P191, DOI 10.1109/SFCS.1980.47

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

[2] EFFICIENT WORST-CASE DATA-STRUCTURES FOR RANGE SEARCHING [J]. ACTA INFORMATICA, 1980, 13 (02) : 155 - 168

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

[4] MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (09) : 509 - 517

[5] BENTLEY JL, 1980, J ALGORITHMS, V0001, P00301

[6] Bently J. L., 1975, Information Processing Letters, V3, P170, DOI 10.1016/0020-0190(75)90034-4

[7] CHAZELLE B, 1979, 11TH P ANN ACM S THE, P38

[8] Dobkin D., 1976, SIAM Journal on Computing, V5, P181, DOI 10.1137/0205015

[9] Finkel R. A., 1974, Acta Informatica, V4, P1, DOI 10.1007/BF00288933

[10] Fredman M. L., 1980, 21st Annual Symposium on Foundations of Computer Science, P191, DOI 10.1109/SFCS.1980.47