321 citations · 2k across the 200 of their papers we have counts for
7 papers · 1 filter
Optimized Color Gamuts for Tiled Displays
Marshall Bern, David Eppstein
We consider the problem of finding a large color space that can be generated by all units in multi-projector tiled display systems. Viewing the problem geometrically as one of find…
Dynamic Generators of Topologically Embedded Graphs
David Eppstein
We provide a data structure for maintaining an embedding of a graph on a surface (represented combinatorially by a permutation of edges around each vertex) and computing generators…
Moebius-Invariant Natural Neighbor Interpolation
Marshall Bern, David Eppstein
We propose an interpolation method that is invariant under Moebius transformations; that is, interpolation followed by transformation gives the same result as transformation follow…
Algorithms for Media
David Eppstein, Jean-Claude Falmagne
Falmagne recently introduced the concept of a medium, a combinatorial object encompassing hyperplane arrangements, topological orderings, acyclic orientations, and many other famil…
Fat 4-polytopes and fatter 3-spheres
David Eppstein, Greg Kuperberg, Günter M. Ziegler
We introduce the fatness parameter of a 4-dimensional polytope P, defined as ϕ(P)=(f_1+f_2)/(f_0+f_3). It arises in an important open problem in 4-dimensional combinatorial geometr…
Separating Thickness from Geometric Thickness
David Eppstein
We show that graph-theoretic thickness and geometric thickness are not asymptotically equivalent: for every t, there exists a graph with thickness three and geometric thickness >=…