| On the shape of a set of points in the plane H Edelsbrunner, D Kirkpatrick, R Seidel IEEE Transactions on information theory 29 (4), 551-559, 2003 | 2571 | 2003 |
| Constructing arrangements of lines and hyperplanes with applications H Edelsbrunner, J O’Rourke, R Seidel SIAM Journal on Computing 15 (2), 341-363, 1986 | 703 | 1986 |
| The ultimate planar convex hull algorithm? DG Kirkpatrick, R Seidel SIAM journal on computing 15 (1), 287-299, 1986 | 622 | 1986 |
| Voronoi diagrams and arrangements H Edelsbrunner, R Seidel Proceedings of the first annual symposium on Computational geometry, 251-262, 1985 | 568 | 1985 |
| A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons R Seidel Computational Geometry 1 (1), 51-64, 1991 | 566 | 1991 |
| How good are convex hull algorithms? D Avis, D Bremner Proceedings of the eleventh annual symposium on Computational geometry, 20-28, 1995 | 513 | 1995 |
| Randomized search trees R Seidel, CR Aragon Algorithmica 16 (4), 464-497, 1996 | 448 | 1996 |
| On the all-pairs-shortest-path problem in unweighted undirected graphs R Seidel Journal of computer and system sciences 51 (3), 400-403, 1995 | 410 | 1995 |
| Small-dimensional linear programming and convex hulls made easy R Seidel Discrete & Computational Geometry 6 (3), 423-434, 1991 | 360 | 1991 |
| Randomized search trees CR Aragon, RG Seidel 30th Annual Symposium on Foundations of Computer Science, 540-545, 1989 | 349 | 1989 |
| Efficiently computing and representing aspect graphs of polyhedral objects Z Gigus, J Canny, R Seidel IEEE Transactions on Pattern Analysis and Machine Intelligence 13 (6), 542-551, 1991 | 332 | 1991 |
| Linear programming and convex hulls made easy R Seidel Proceedings of the sixth annual symposium on Computational geometry, 211-215, 1990 | 252 | 1990 |
| Constructing higher-dimensional convex hulls at logarithmic cost per face R Seidel Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986 | 237 | 1986 |
| Four results on randomized incremental constructions KL Clarkson, K Mehlhorn, R Seidel Comput. Geom. 3 (4), 185-212, 1993 | 236 | 1993 |
| Computing convolutions by reciprocal search L Guibas, R Seidel Proceedings of the second annual symposium on Computational geometry, 90-99, 1986 | 228 | 1986 |
| On the difficulty of triangulating three-dimensional nonconvex polyhedra J Ruppert, R Seidel Discrete & Computational Geometry 7 (3), 227-253, 1992 | 211 | 1992 |
| Backwards analysis of randomized geometric algorithms R Seidel New trends in discrete and computational geometry, 37-67, 1993 | 183 | 1993 |
| Approximating the d-dimensional complete Euclidean graph J Ruppert, R Seidel Proceedings of the 3rd Canadian Conference on Computational Geometry (CCCG …, 1991 | 175 | 1991 |
| On the all-pairs-shortest-path problem R Seidel Proceedings of the twenty-fourth annual ACM symposium on Theory of computing …, 1992 | 171 | 1992 |
| The nature and meaning of perturbations in geometric computing R Seidel Discrete & Computational Geometry 19 (1), 1-17, 1998 | 163 | 1998 |
David KirkpatrickProfessor of Computer Science, University of British ColumbiaVerified email at cs.ubc.ca
