Orthogonal cartograms with few corners per face

Abstract

We give an algorithm to create orthogonal drawings of 3-connected 3-regular planar graphs such that each interior face of the graph is drawn with a prescribed area. This algorithm produces a drawing with at most 12 corners per face and four bends per edge, which improves the previous known result of 34 corners per face.