Arbre de portée (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "Arbre de portée" in French language version.

refsWebsite

Global rank French rank

2^nd place

3^rd place

741^st place

1,215^th place

124^th place

14^th place

bnf.fr

(en) Mark de Berg, Otfried Cheong, Marc van Kreveld et Mark Overmars, Computational Geometry : algorithms and applications, Berlin, Springer, 2008, 386 p. (ISBN 978-3-540-77973-5, BNF 41264669, DOI 10.1007/978-3-540-77974-2)

(en) J. L. Bentley, « Decomposable searching problems », Information Processing Letters, vol. 8, n^o 5,‎ 1979, p. 244–251 (DOI 10.1016/0020-0190(79)90117-0)
(en) G. S. Lueker, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978), 1978, 28–21 p. (DOI 10.1109/SFCS.1978.1), « A data structure for orthogonal range queries »
(en) D. T. Lee et C. K. Wong, « Quintary trees: A file structure for multidimensional database systems », ACM Transactions on Database Systems, vol. 5, n^o 3,‎ 1980, p. 339 (DOI 10.1145/320613.320618)
(en) Mark de Berg, Otfried Cheong, Marc van Kreveld et Mark Overmars, Computational Geometry : algorithms and applications, Berlin, Springer, 2008, 386 p. (ISBN 978-3-540-77973-5, BNF 41264669, DOI 10.1007/978-3-540-77974-2)

(en) Bernard Chazelle, « Lower Bounds for Orthogonal Range Searching: I. The Reporting Case », ACM, vol. 37,‎ 1990, p. 200-212 (lire en ligne)
(en) Bernard Chazelle, « Lower Bounds for Orthogonal Range Searching: II. The Arithmetic Model », ACM, vol. 37,‎ 1990, p. 439-463 (lire en ligne)