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
On the Biplanarity of Blowups
TL;DR: In this paper , the authors disproved the conjecture that 2-blowups of planar graphs are biplanar, showing that iterated Kleetopes are counterexamples.
Journal ArticleDOI
Inapproximability of Orthogonal Compaction
TL;DR: In this article, it was shown that several problems of compacting orthogonal graph drawings to use the minimum number of rows, area, length of longest edge or total edge length cannot be approximated better than within a polynomial factor of optimal in polynomially time unless P = NP.
Posted Content
Cubic Partial Cubes from Simplicial Arrangements
TL;DR: In this article, the authors show how to construct a cubic partial cube from any simplicial arrangement of lines or pseudolines in the projective plane, and give infinite families of cubic partial cubes as well as many sporadic examples.
Posted Content
Angles of Arc-Polygons and Lombardi Drawings of Cacti
TL;DR: In this paper, it was shown that a given cyclic sequence of angles can be realized by a non-self-crossing polygon with circular-arc sides whenever all angles are at most pi.
Proceedings ArticleDOI
Reflections in an octagonal mirror maze
TL;DR: In this article , an environment consisting of axis-parallel and diagonal line segments with integer endpoints, each of which may be reflective or non-reective, was given, and an initial position for a light ray passing through points of the integer grid.