226 citations · 762 across the 90 of their papers we have counts for
5 papers · 1 filter
Computing Cartograms with Optimal Complexity
Md. Jawaherul Alam, Therese Biedl, Stefan Felsner +3
In a rectilinear dual of a planar graph vertices are represented by simple rectilinear polygons and edges are represented by side-contact between the corresponding polygons. A rect…
Circular-Arc Cartograms
Jan-Hinrich Kämper, Stephen G. Kobourov, Martin Nöllenburg
We present a new circular-arc cartogram model in which countries are drawn as polygons with circular arcs instead of straight-line segments. Given a political map and values associ…
Planar and Poly-Arc Lombardi Drawings
Christian A. Duncan, David Eppstein, Michael T. Goodrich +2
In Lombardi drawings of graphs, edges are represented as circular arcs, and the edges incident on vertices have perfect angular resolution. However, not every graph has a Lombardi…
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…