A Simple Divide-and-Conquer Algorithm for Computing Delaunay Triangulations in O(n log log n) Expected Time. - Rex A. Dwyer (SCG, 1986)

Convex Hull of Randomly Chosen Points from A Polytope. - Rex A. Dwyer; Ravi Kannan (Parallel Algorithms and Architectures, 1987)

A Faster Divide-and-Conquer Algorithm for Constructing Delaunay Triangulations. - Rex A. Dwyer (Algorithmica, 1987)

Kinder, gentler average-case analysis for convex hulls and maximal vectors. - Rex A. Dwyer (SIGACT News, 1990)

Convex hulls of samples from spherically symmetric distributions. - Rex A. Dwyer (Discret. Appl. Math., 1991)

Higher-Dimensional Voronoi Diagrams in Linear Expected Time. - Rex A. Dwyer (Discret. Comput. Geom., 1991)

Maximal and Minimal Balls. - Rex A. Dwyer (Comput. Geom., 1993)

The Expected Size of the Sphere-of-influence Graph. - Rex A. Dwyer (Comput. Geom., 1995)

Maximal empty ellipsoids. - Rex A. Dwyer; William F. Eddy (Int. J. Comput. Geom. Appl., 1996)

Voronoi Diagrams of Random Lines and Flats. - Rex A. Dwyer (Discret. Comput. Geom., 1997)

Voronoi Diagrams and Convex Hulls of Random Moving Points. - Rex A. Dwyer (Discret. Comput. Geom., 2000)