<--- Back to Details
First PageDocument Content
Discrete geometry / Year of birth missing / Michael T. Goodrich / David Eppstein / Journal of Graph Algorithms and Applications / Straight skeleton / Algorithm / Randomized algorithm / Voronoi diagram / Mathematics / Geometry / Computational geometry
Date: 2015-05-08 17:28:58
Discrete geometry
Year of birth missing
Michael T. Goodrich
David Eppstein
Journal of Graph Algorithms and Applications
Straight skeleton
Algorithm
Randomized algorithm
Voronoi diagram
Mathematics
Geometry
Computational geometry

CURRICULUM VITAE Michael T. Goodrich Dept. of Computer Science Bren School of Info. & Computer Sciences University of California, Irvine Irvine, CA

Add to Reading List

Source URL: www.ics.uci.edu

Download Document from Source Website

File Size: 197,91 KB

Share Document on Facebook

Similar Documents

Young Researcher Forum ‣ Rodrigo Silveira (chair) ‣ Benjamin Burton ‣ David Eppstein ‣ Matthew Katz ‣ Matias Korman

Young Researcher Forum ‣ Rodrigo Silveira (chair) ‣ Benjamin Burton ‣ David Eppstein ‣ Matthew Katz ‣ Matias Korman

DocID: 1uliw - View Document

Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon David Eppstein∗   arXiv:1108.4675v1 [cs.SI] 23 Aug 2011

Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon David Eppstein∗ arXiv:1108.4675v1 [cs.SI] 23 Aug 2011

DocID: 1rg13 - View Document

Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein∗ Abstract dynamic closest pair problem. It can be solved by brute force 2 We develop data structures for dynamic closest pair

Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein∗ Abstract dynamic closest pair problem. It can be solved by brute force 2 We develop data structures for dynamic closest pair

DocID: 1rdUy - View Document

Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

DocID: 1qXBI - View Document

Colloquium Department of Computer Science Dr. Darren Strash Darren graduated in 2011 with a PhD in Computer Science from University of California, Irvine, with Mike Goodrich and David Eppstein as advisors. After graduati

Colloquium Department of Computer Science Dr. Darren Strash Darren graduated in 2011 with a PhD in Computer Science from University of California, Irvine, with Mike Goodrich and David Eppstein as advisors. After graduati

DocID: 1p6k0 - View Document