4 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.DS2009★ 4 cited
Optimal Angular Resolution for Face-Symmetric Drawings
David Eppstein, Kevin A. Wortman
Let G be a graph that may be drawn in the plane in such a way that all internal faces are centrally symmetric convex polygons. We show how to find a drawing of this type that maxim…
cs.DS2009★ 1 cited
Optimal Embedding Into Star Metrics
David Eppstein, Kevin A. Wortman
We present an O(n^3 log^2 n)-time algorithm for the following problem: given a finite metric space X, create a star-topology network with the points of X as its leaves, such that t…