David Eppstein
From Wikipedia, the free encyclopedia
| David Arthur Eppstein | |
| Born | 1963 England |
|---|---|
| Residence | USA |
| Nationality | US citizen |
| Fields | computer scientist |
| Institutions | Computer Science Department, Donald Bren School of Information and Computer Sciences, University of California, Irvine |
| Alma mater | Stanford University, Columbia University |
| Doctoral advisor | Zvi Galil |
| Known for | Computational geometry Graph algorithms Recreational mathematics |
| Notable awards | NSF Young Investigator award, 1992 – 1999; NSF graduate fellowship, 1984 – 1987; National Merit scholarship, 1981 – 1984. |
David Arthur Eppstein (born 1963) is a computer scientist at the Computer Science Department, Donald Bren School of Information and Computer Sciences, University of California, Irvine. His work is in computational geometry, graph algorithms, and recreational mathematics.
Contents |
[edit] Biography
Born in England, he was originally a British subject from New Zealand but is now a United States citizen. Eppstein received a B.S. in Mathematics with distinction from Stanford University in 1984, and later an M.S. (1985) and Ph.D. (1989) in Computer Science from Columbia University, after which he took a postdoctorate at Xerox's Palo Alto Research Center.[1] He joined the UC Irvine faculty in 1990, and was co-chair of the Computer Science Department there from 2002 to 2005.[1] Eppstein is married and has two children. He describes his status and ancestry on his website, explaining the "Eppstein" name, especially its atypical spelling, as well as referencing others who bear the name. He is one of the few "California/New Zealand Eppsteins." [2] His avocation is amateur photography.[3]
[edit] Research interests
According to Eppstein's CV, [1] his research is focused mostly in finite element meshing, minimum spanning trees, shortest paths, dynamic graph data structures, graph colouring, graph drawing, computational robust statistics, and geometric optimisation.
Eppstein maintains and edits the content of his own web site called the Geometry Junkyard. It mainly provides annotated lists of hyperlinks to other web sites on a range of geometry topics from circles, spheres, and spirals to tilings, polyhedra, and origami.[4]
[edit] Selected publications
- D. Eppstein, Finding the k shortest paths, SIAM J. Comput. 28 (1999), no. 2, 652--673
- D. Eppstein, Z Galil, GF Italiano, A Nissenzweig, Sparsification—a technique for speeding up dynamic graph algorithms, J. ACM 44 (1997), no. 5, 669--696.
- N. Amenta, M. Bern, D. Eppstein, The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction Graphical Models and Image Processing, 1998
- M. Bern and D. Eppstein, Mesh generation and optimal triangulation, Tech. Rep. CSL-92-1, Xerox PARC, 1992. Computing in Euclidean Geometry, D.-Z. Du and F.K. Hwang, eds., World Scientific, 1992, pp. 23-90.
[edit] Awards
Eppstein received the NSF Young Investigator award (1992 – 1999), and has been accepted to the NSF graduate fellowship (1984 – 1987) and the National Merit scholarship (1981 – 1984).[1]
[edit] See also
- Eppstein point
[edit] References
- ^ a b c d David Eppstein's Online Curriculum Vitae. Retrieved on 2008-04-09.
- ^ Eppstein on his Name and Relatives. Retrieved on 2008-04-23.
- ^ Eppstein on the Web. Retrieved on 2008-04-23.
- ^ Ivars Peterson. "Return of the Mathematical Tourist", Science News Online, Science Service, 1998-05-09.
