72 citations · 218 across the 15 of their papers we have counts for
4 papers · 1 filter
Quasiconvex Programming
David Eppstein
We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise maximum of a collection of quasiconvex functions.…
Algorithms for Drawing Media
David Eppstein
We describe algorithms for drawing media, systems of states, tokens and actions that have state transition graphs in the form of partial cubes. Our algorithms are based on two prin…
Single-Strip Triangulation of Manifolds with Arbitrary Topology
M. Gopi, David Eppstein
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many h…
The lattice dimension of a graph
David Eppstein
We describe a polynomial time algorithm for, given an undirected graph G, finding the minimum dimension d such that G may be isometrically embedded into the d-dimensional integer l…