8 citations · 23 across the 8 of their papers we have counts for
8 papers
COAST: A Convex Optimization Approach to Stress-Based Embedding
Emden R. Gansner, Yifan Hu, Shankar Krishnan
Visualizing graphs using virtual physical models is probably the most heavily used technique for drawing graphs in practice. There are many algorithms that are efficient and produc…
Visualizing Streaming Text Data with Dynamic Maps
Emden Gansner, Yifan Hu, Stephen North
The many endless rivers of text now available present a serious challenge in the task of gleaning, analyzing and discovering useful information. In this paper, we describe a method…
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…
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…
On Touching Triangle Graphs
Emden R. Gansner, Yifan Hu, Stephen G. Kobourov
In this paper, we consider the problem of representing graphs by triangles whose sides touch. As a simple necessary condition, we show that pairs of vertices must have a small comm…
GMap: Drawing Graphs as Maps
Emden R. Gansner, Yifan Hu, Stephen G. Kobourov
Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through…