Computing cartograms with optimal complexity
Md. Jawaherul Alam, Thérèse Biedl, Stefan Felsner, Michael Kaufmann, Stephen Kobourov, Torsten Ueckerdt · 2012
In a rectilinear dual of a planar graph vertices are represented by simple rectilinear polygons, while edges are represented by side-contact between the corresponding polygons. A rectilinear dual is called a cartogram if the area of each region is equal to a pre-specified weight.