8 citations · 23 across the 8 of their papers we have counts for
Showing 2011 · cs.CGShow all
2 papers · 2 filters
cs.CG2011★ 4 cited
Approximating Minimum Manhattan Networks in Higher Dimensions
Aparna Das, Emden R. Gansner, Michael Kaufmann +3
We study the minimum Manhattan network problem, which is defined as follows. Given a set of points called \emph{terminals} in , find a minimum-length network such that each p…
cs.CG2011★ 2 cited
Optimal Polygonal Representation of Planar Graphs
Christian A. Duncan, Emden R. Gansner, Yifan Hu +2
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl…