Geometric range searching and its relatives PK Agarwal, J Erickson Contemporary Mathematics 223, 1-56, 1999 | 697 | 1999 |
Indexing moving points PK Agarwal, L Arge, J Erickson Journal of Computer and System Sciences 66 (1), 207-243, 2003 | 471 | 2003 |
Greedy optimal homotopy and homology generators J Erickson, K Whittlesey Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005 | 284 | 2005 |
Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions D Eppstein, J Erickson Discrete & Computational Geometry 22 (4), 569-592, 1999 | 284 | 1999 |
Output-sensitive algorithms for computing nearest-neighbour decision boundaries D Bremner, E Demaine, J Erickson, J Iacono, S Langerman, P Morin, ... Discrete & Computational Geometry 33 (4), 593-604, 2005 | 274 | 2005 |
Optimally cutting a surface into a disk J Erickson, S Har-Peled Discrete & Computational Geometry 31 (1), 37-59, 2004 | 258 | 2004 |
Iterated nearest neighbors and finding minimal polytopes D Eppstein, J Erickson Discrete & Computational Geometry 11, 321-350, 1994 | 179 | 1994 |
Minimum-cost coverage of point sets by disks H Alt, EM Arkin, H Brönnimann, J Erickson, SP Fekete, C Knauer, ... Proceedings of the twenty-second annual symposium on Computational geometry …, 2006 | 137 | 2006 |
Homotopic Fréchet distance between curves< i> or, walking your dog in the woods in polynomial time</i> EW Chambers, É Colin de Verdière, J Erickson, S Lazard, F Lazarus, ... Computational Geometry 43 (3), 295-311, 2010 | 132* | 2010 |
Efficient searching with linear constraints PK Agarwal, L Arge, J Erickson, PG Franciosa, JS Vitter Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on …, 1998 | 130 | 1998 |
Nice point sets can have nasty Delaunay triangulations J Erickson Proceedings of the seventeenth annual symposium on Computational geometry …, 2001 | 129 | 2001 |
Necklaces, Convolutions, and X + Y D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ... Algorithms–ESA 2006: 14th Annual European Symposium, Zurich, Switzerland …, 2006 | 126* | 2006 |
Lower bounds for linear satisfiability problems J Erickson Chicago J. Comput. Sci 1999, 1999 | 112* | 1999 |
Kinetic collision detection between two simple polygons J Basch, J Erickson, LJ Guibas, J Hershberger, L Zhang Computational Geometry 27 (3), 211-235, 2004 | 111* | 2004 |
New lower bounds for Hopcroft's problem J Erickson Discrete & Computational Geometry 16 (4), 389-418, 1996 | 108 | 1996 |
Spacetime meshing with adaptive refinement and coarsening R Abedi, SH Chung, J Erickson, Y Fan, M Garland, D Guoy, R Haber, ... Proceedings of the twentieth annual symposium on Computational geometry, 300-309, 2004 | 107 | 2004 |
Algorithms J Erickson | 105 | 2023 |
Vietoris–rips complexes of planar point sets EW Chambers, V De Silva, J Erickson, R Ghrist Discrete & Computational Geometry 44 (1), 75-90, 2010 | 102 | 2010 |
Kinetic binary space partitions for intersecting segments and disjoint triangles PK Agarwal, J Erickson, LJ Guibas Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms …, 1998 | 99 | 1998 |
Algorithmic issues in modeling motion PK Agarwal, LJ Guibas, H Edelsbrunner, J Erickson, M Isard, S Har-Peled, ... ACM Computing Surveys (CSUR) 34 (4), 550-572, 2002 | 95 | 2002 |