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
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
Algorithms for bichromatic line-segment problems and polyhedral terrains, Algorithmica, vol.2, issue.1, pp.116-132, 1994. ,
DOI : 10.1007/BF01182771
On lines, joints, and incidences in three dimensions, J. Combinat. Theory, Ser. A, vol.118, pp.962-977, 2011. ,
Incidences in three dimensions and distinct distances in the plane, Proc. 26th Annu. ACM Sympos, pp.413-422, 2010. ,
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
On the Erd? os distinct distance problem in the plane, 2011. ,
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
The dawn of an algebraic era in discrete geometry, 27th European Workshop on Computational Geometry extended abstract, 2011. ,
The joints problem in R n ,
An Incidence Theorem in Higher Dimensions, Discrete & Computational Geometry, vol.4, issue.2 ,
DOI : 10.1007/s00454-012-9420-x
On lines and joints, Discrete Comput. Geometry, vol.44, issue.4, pp.838-843, 2010. ,