Date: Thu, 21 Nov 1996 19:54:18 GMT Server: NCSA/1.4 Content-type: text/html Last-modified: Fri, 09 Aug 1996 21:39:09 GMT Content-length: 3321
Ph.D., Cornell University
Associate Professor (on extended leave)
(510) 642-5250
seidel@cs.berkeley.edu
Co-editor
Journal of Symbolic Computation, Special Issue on
Computational Geometry Member
Editorial Board, Discrete and Computational Geometry
Member
Editorial Board, Journal of Symbolic Computation
Member
Editorial Board, Computational Geometry: Theory and Applications
Chair
6th Annual ACM Symposium on Computational Geometry, 1990
Member
Program Committee, ACM Symposium on Computational Geometry, 1992
Member
Program Committee, IEEE Symposium FOCS, 1991
Member
Program Committee, Workshop on Algorithms and Data Structures
(WADS)
1991
Member
Program Committee, Scandinavian Workshop on Algorithm Theory
(SWAT)
1990
Member
Program Committee, ACM Symposium on Computational Geometry, 1988
Member
Program Committee, IEEE Symposium FOCS, 1988
Small-Dimensional Linear Programming and Convex Hulls Made Easy
Discrete and Computational Geometry, Vol. 6, 1991, pp. 423-434.
A Single and Fast Randomized Algorithm for Computing Trapezoidal
Decompositions and for Triangulating Polygons
Computational Geometry: Theory and Applications, Vol. 1, 1991,
pp. 51-64.
Randomized Search Trees
(with C. Aragon), Proc. 30th IEEE Symp. on
Foundations of Computer Science, 1989, pp. 540-546.
The Ultimate Planar Convex Hull Algorithm?
(with D. G. Kirkpatrick),
SIAM J. Computing, Vol. 15, 1986, pp. 287-299.
Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per
Face
Proc. 16th ACM Symp. on Theory of Computing, 1986, pp. 404-413.