Rex A. Dwyer

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:51/6902 · DBLP profile ↗

← Back

10ranked-venue papers

10as first author

0since 2021 · last 2000

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 5 · 5 first-authorTheory of computation · 5 · 5 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

3 papers

Computational geometry · 91% Algorithms and data structures · 9%

Topics — the 6 heaviest of 6, each with the papers that count most for it

Topic	Papers	Last	Evidence papers
Computational geometry geometric data structures	3	1994	Maximal Empty Ellipsoids · SODA 1994 Higher-Dimensional Voronoi Diagrams in Linear Expected Time · SCG 1989 A Simple Divide-and-Conquer Algorithm for Computing Delaunay Triangulations in O(n log log n) Expected Time · SCG 1986
Computational geometry geometric optimization	1	1994	Maximal Empty Ellipsoids · SODA 1994
Computational geometry voronoi diagram	1	1989	Higher-Dimensional Voronoi Diagrams in Linear Expected Time · SCG 1989
Computational geometry › triangulation delaunay triangulation	1	1986	A Simple Divide-and-Conquer Algorithm for Computing Delaunay Triangulations in O(n log log n) Expected Time · SCG 1986
Algorithms and data structures randomized algorithms	2	1989	Higher-Dimensional Voronoi Diagrams in Linear Expected Time · SCG 1989 A Simple Divide-and-Conquer Algorithm for Computing Delaunay Triangulations in O(n log log n) Expected Time · SCG 1986
Algorithms and data structures › analysis of algorithms expected complexity	1	1986	A Simple Divide-and-Conquer Algorithm for Computing Delaunay Triangulations in O(n log log n) Expected Time · SCG 1986

Methods — techniques the papers use, named apart from their topics

computational geometry · 0.0uniform distribution · 0.0probabilistic analysis · 0.0divide-and-conquer · 0.0distribution-sensitive analysis · 0.0

Year	Publication	Venue	Position
2000	Voronoi Diagrams and Convex Hulls of Random Moving Points Rex A. Dwyer	Discret. Comput. Geom.	1
1997	Voronoi Diagrams of Random Lines and Flats Rex A. Dwyer	Discret. Comput. Geom.	1
1995	The Expected Size of the Sphere-of-influence Graph Rex A. Dwyer	Comput. Geom.	1
1994	Maximal Empty Ellipsoids Rex A. Dwyer, William F. Eddy	SODA	1
1993	Maximal and Minimal Balls Rex A. Dwyer	Comput. Geom.	1
1991	Convex hulls of samples from spherically symmetric distributions Rex A. Dwyer	Discret. Appl. Math.	1
1991	Higher-Dimensional Voronoi Diagrams in Linear Expected Time Rex A. Dwyer	Discret. Comput. Geom.	1
1989	Higher-Dimensional Voronoi Diagrams in Linear Expected Time abstract This work is the first to validate theoretically the suspicions of many researchers — that the “average” Voronoi diagram is combinatorially quite simple and can be constructed quickly. Specifically, assuming that dimension d is fixed, and that n input points are chosen independently from the uniform distribution on the unit d-ball, it is proved that Rex A. Dwyer	SCG	1
1987	A Faster Divide-and-Conquer Algorithm for Constructing Delaunay Triangulations Rex A. Dwyer	Algorithmica	1
1986	A Simple Divide-and-Conquer Algorithm for Computing Delaunay Triangulations in O(n log log n) Expected Time abstract We present a modification to the divide-and-conquer algorithm of Guibas & Stolfi [GS] for computing the Delaunay triangulation of n sites in the plane. The change reduces its T(n log n) expected running time to O(n log n) for a large class of distributions which includes the uniform distribution in the unit square. The modified algorithm is significantly easier to implement than the optimal linear-expected-time algorithm of Bentley, Weide & Yao [BWY]. Unlike the incremental methods of Ohya, Iri & Murota [OIM] and Maus [M] it has optimal O(n log log n) worst-case performance. The improvement extends to the composition of the Delaunay triangulation in the Lp metric for 1 Rex A. Dwyer	SCG	1