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
Posted Content
Single-Strip Triangulation of Manifolds with Arbitrary Topology
TL;DR: This video illustrates a new method for subdividing the surface of a triangulated 3d polyhedron, without changing the geometry of the model, so that the triangles of the subdivided mesh can be ordered into a single triangle strip.
Journal ArticleDOI
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
TL;DR: These algorithms are based on a planarization method that “zeros in” on edge crossings, together with methods for applying planar separator decompositions to geometric graphs with sublinearly many crossings.
Book ChapterDOI
Trees with convex faces and optimal angles
Josiah Carlson,David Eppstein +1 more
TL;DR: This work considers drawings of trees in which all edges incident to leaves can be extended to infinite rays without crossing, partitioning the plane into infinite convex polygons, and finds linear time algorithms for solving this problem.
Journal ArticleDOI
Metric Dimension Parameterized by Max Leaf Number
TL;DR: This paper shows that this graph invariant may be calculated by an algorithm whose running time is linear in the input graph size, added to a function of the largest possible number of leaves in a spanning tree of the graph.
Journal ArticleDOI
Recognizing Partial Cubes in Quadratic Time
TL;DR: In this article, the authors show how to test whether a graph with n vertices and m edges is a partial cube, and if so how to find a distance-preserving embedding of the graph into a hypercube, in the near-optimal time bound O(n^2).