![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Jeff Erickson 17 Pankaj K. Agarwal , Lars Arge , Jeff Erickson: Indexing Moving Points. PODS 2000 : 175-186 16 Jeff Erickson: Finite-resolution hidden surface removal. SODA 2000 : 901-909 15 Pankaj K. Agarwal , Lars Arge , Jeff Erickson, Paulo Giulio Franciosa , Jeffrey Scott Vitter : Efficient Searching with Linear Constraints. JCSS 61 (2): 194-216 (2000) 14 Jeff Erickson: Space-Time Tradeoffs for Emptiness Queries. SIAM J. Comput. 29 (6): 1968-1996 (2000) 13 Julien Basch , Jeff Erickson, Leonidas J. Guibas , John Hershberger , Li Zhang : Kinetic Collision Detection Between Two Simple Polygons. SODA 1999 : 102-111 12 Jeff Erickson, Leonidas J. Guibas , Jorge Stolfi , Li Zhang : Separation-Sensitive Collision Detection for Convex Objects. SODA 1999 : 327-336 11 Jeff Erickson: New Lower Bounds for Convex Hull Problems in Odd Dimensions. SIAM J. Comput. 28 (4): 1198-1214 (1999) 10 Pankaj K. Agarwal , Lars Arge , Jeff Erickson, Paolo Giulio Franciosa , Jeffrey Scott Vitter : Efficient Searching with Linear Constraints. PODS 1998 : 169-178 9 Pankaj K. Agarwal , Jeff Erickson, Leonidas J. Guibas : Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles (Extended Abstract). SODA 1998 : 107-116 8 David Eppstein , Jeff Erickson: Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. Symposium on Computational Geometry 1998 : 58-67 7 Jeff Erickson: Space-Time Tradeoffs for Emptiness Queries (Extended Abstract). Symposium on Computational Geometry 1997 : 304-313 6 Jeff Erickson: Better Lower Bounds for Halfspace Emptiness. FOCS 1996 : 472-481 5 Jeff Erickson: New Lower Bounds for Convex Hull Problems in Odd Dimensions. Symposium on Computational Geometry 1996 : 1-9 4 Jeff Erickson: Lower Bounds for Linear Satisfiability Problems. SODA 1995 : 388-395 3 Jeff Erickson: New Lower Bounds for Hopcroft's Problem (Extended Abstract). Symposium on Computational Geometry 1995 : 127-137 2 Jeff Erickson, Raimund Seidel : Better Lower Bounds on Detecting Affine and Spherical Degeneracies. FOCS 1993 : 528-536 1 David Eppstein , Jeff Erickson: Iterated Nearest Neighbors and Finding Minimal Polytopes. SODA 1993 : 64-73 DiSC'01 Copyright ©2002 ACM Inc. |