D
David Eppstein
Researcher at University of California, Irvine
Publications - 689
Citations - 21750
David Eppstein is an academic researcher from University of California, Irvine. The author has contributed to research in topics: Planar graph & Time complexity. The author has an hindex of 67, co-authored 672 publications receiving 20584 citations. Previous affiliations of David Eppstein include McGill University & University of Passau.
Papers
More filters
Proceedings ArticleDOI
Privacy-preserving data-oblivious geometric algorithms for geographic data
TL;DR: This work gives efficient data-oblivious algorithms for several fundamental geometric problems that are relevant to geographic information systems, including planar convex hulls and all-nearest neighbors, and is applicable to secure multiparty computation (SMC) protocols for geographic data used in location-based services.
Proceedings ArticleDOI
Dynamic three-dimensional linear programming
TL;DR: Linear programming optimizations on the intersection of k polyhedra in R/sup 3/, represented by their outer recursive decompositions, are performed in expected time O in order to derive efficient algorithms for dynamic linear programming problems ill which constraints are inserted and deleted, and queries must optimize specified objective functions.
Journal ArticleDOI
Improved Grid Map Layout by Point Set Matching
TL;DR: This work introduces a new approach to solve the association problem for grid maps by formulating it as a point set matching problem: Given two sets A and B of n points in the plane, compute an optimal one-to-one matching between B and A, and identifies three optimisation criteria that are important for grid map layout.
Book ChapterDOI
Optimal Möbius Transformations for Information Visualization and Meshing
Marshall Bern,David Eppstein +1 more
TL;DR: In this paper, the authors give linear-time quasiconvex programming algorithms for finding a Mobius transformation of a set of spheres in a unit ball or on the surface of a unit sphere that maximizes the minimum size of a transformed sphere.