P. K. Agarwal, B. Aronov, M. Van-kreveld, M. Löffler, and R. Silveira, Computing similarity between piecewise-linear functions, Proceedings of the 2010 annual symposium on Computational geometry, SoCG '10, pp.375-383, 2010.
DOI : 10.1145/1810959.1811020

D. Ajwani, S. Ray, R. Seidel, and H. Tiwary, On Computing the Centroid of the Vertices of an Arrangement and Related Problems, Proc. Symp. Algo. Data Structures (WADS'07), pp.519-528, 2007.
DOI : 10.1007/978-3-540-73951-7_45

B. Chazelle, H. Edelsbrunner, L. J. Guibas, and M. Sharir, Algorithms for bichromatic line-segment problems and polyhedral terrains, Algorithmica, vol.2, issue.1, pp.116-132, 1994.
DOI : 10.1007/BF01182771

. Gy, H. Elekes, M. Kaplan, and . Sharir, On lines, joints, and incidences in three dimensions, J. Combinat. Theory, Ser. A, vol.118, pp.962-977, 2011.

. Gy, M. Elekes, and . Sharir, Incidences in three dimensions and distinct distances in the plane, Proc. 26th Annu. ACM Sympos, pp.413-422, 2010.

L. Guth and N. H. Katz, Algebraic methods in discrete analogs of the Kakeya problem, Advances in Mathematics, vol.225, issue.5, pp.2828-2839, 2010.
DOI : 10.1016/j.aim.2010.05.015

L. Guth and N. H. Katz, On the Erd? os distinct distance problem in the plane, 2011.

H. Kaplan, M. Matou?ek, and . Sharir, Simple Proofs of Classical Theorems in Discrete Geometry via the Guth???Katz Polynomial Partitioning Technique, Discrete & Computational Geometry, vol.133, issue.70
DOI : 10.1007/s00454-012-9443-3

J. Matou?ek, The dawn of an algebraic era in discrete geometry, 27th European Workshop on Computational Geometry extended abstract, 2011.

R. Quilodrán, The joints problem in R n

J. Solymosi and T. Tao, An Incidence Theorem in Higher Dimensions, Discrete & Computational Geometry, vol.4, issue.2
DOI : 10.1007/s00454-012-9420-x

K. Haim, S. Micha, and E. Shustin, On lines and joints, Discrete Comput. Geometry, vol.44, issue.4, pp.838-843, 2010.