2000 | ||
---|---|---|
12 | EE | Rex A. Dwyer: Voronoi Diagrams and Convex Hulls of Random Moving Points. Discrete & Computational Geometry 23(3): 343-365 (2000) |
1997 | ||
11 | EE | Rex A. Dwyer: Voronoi Diagrams of Random Lines and Flats. Discrete & Computational Geometry 17(2): 123-136 (1997) |
1996 | ||
10 | Rex A. Dwyer, William F. Eddy: Maximal empty ellipsoids. Int. J. Comput. Geometry Appl. 6(2): 169-186 (1996) | |
1995 | ||
9 | Rex A. Dwyer: The Expected Size of the Sphere-of-influence Graph. Comput. Geom. 5: 155-164 (1995) | |
1994 | ||
8 | Rex A. Dwyer, William F. Eddy: Maximal Empty Ellipsoids. SODA 1994: 98-102 | |
1993 | ||
7 | Rex A. Dwyer: Maximal and Minimal Balls. Comput. Geom. 3: 261-275 (1993) | |
1991 | ||
6 | Rex A. Dwyer: Higher-Dimensional Voronoi Diagrams in Linear Expected Time. Discrete & Computational Geometry 6: 343-367 (1991) | |
5 | EE | Rex A. Dwyer: Convex hulls of samples from spherically symmetric distributions. Discrete Applied Mathematics 31(2): 113-132 (1991) |
1989 | ||
4 | EE | Rex A. Dwyer: Higher-Dimensional Voronoi Diagrams in Linear Expected Time. Symposium on Computational Geometry 1989: 326-333 |
1987 | ||
3 | Rex A. Dwyer, Ravi Kannan: Convex Hull of Randomly Chosen Points from A Polytope. Parallel Algorithms and Architectures 1987: 16-24 | |
2 | Rex A. Dwyer: A Faster Divide-and-Conquer Algorithm for Constructing Delaunay Triangulations. Algorithmica 2: 137-151 (1987) | |
1986 | ||
1 | EE | Rex A. Dwyer: A Simple Divide-and-Conquer Algorithm for Computing Delaunay Triangulations in O(n log log n) Expected Time. Symposium on Computational Geometry 1986: 276-284 |
1 | William F. Eddy | [8] [10] |
2 | Ravi Kannan (Ravindran Kannan) | [3] |