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
Book ChapterDOI
Succinct Greedy Graph Drawing in the Hyperbolic Plane
TL;DR: A method for producing a greedy embedding of any n -vertex simple graph G in the hyperbolic plane, so that a message M between any pair of vertices may be routed by having each vertex that receives M pass it to a neighbor that is closer to M 's destination.
Journal ArticleDOI
Quadrilateral meshing by circle packing
Marshall Bern,David Eppstein +1 more
TL;DR: This work uses circle-packing methods to generate quadrilateral meshes for polygonal domains, with guaranteed bounds both on the quality and the number of elements.
Journal ArticleDOI
Dynamic Three-Dimensional Linear Programming
TL;DR: This work performs linear programming optimizations on the intersection of k polyhedra in R 3, represented by their outer recursive decompositions, in expected time O, to derive efficient algorithms for dynamic linear programming problems in which constraints are inserted and deleted, and queries must optimize specified objective functions.
Journal ArticleDOI
Parameterized Complexity of 1-Planarity
TL;DR: The parameterized complexity of the problem of finding a 1-planar drawing for a general graph is investigated with respect to the vertex cover number, tree-depth, and cyclomatic number, and fixed-parameter tractable algorithms are constructed.
Proceedings ArticleDOI
UOBPRM: A uniformly distributed obstacle-based PRM
TL;DR: UOBPRM is shown to have nodes more uniformly distributed near C-obstacle surfaces and also requires the fewest nodes and edges to solve challenging motion planning problems with varying narrow passages.