On rectilinear duals for vertex-weighted plane graphs (Q1011760)

The authors show that every vertex-weighted plane triangulated graph admits a cartogram of constant complexity, that is, a cartogram where the number of vertices of each region is constant. Furthermore, such a rectilinear cartogram can be constructed in \(O(n\log n)\) time where \(n\) is the number of vertices. It is regrettable that the contents of this paper seems to overlap much with a previous published paper of the authors [``On rectilinear duals for vertex-weighted plane graphs'', Graph drawing. 13th international symposium, GD 2005, Limerick, Ireland, September 12--14, 2005. Revised papers. Berlin: Springer. Lecture Notes in Computer Science 3843, 61--72 (2006; Zbl 1171.68654)], but any remark on this or any citation is not found in the text.