Proc. 4th Symp. Discrete Algorithms
Iterated nearest neighbors and finding minimal polytopes, EppEri-SODA-93
A data structure for dynamically maintaining rooted trees, Fre-SODA-93
A Delaunay refinement algorithm for 2-dimensional mesh generation, Rup-SODA-93
[
D. Eppstein publications
] [
Citation database
] [
Locations
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
