Drawing slicing graphs with face areas


We consider orthogonal drawings of a plane graph Gwith specified face areas. For a natural number k, a k-gonal drawing of G is an orthogonal drawing such that the boundary of G is drawn as a rectangle and each inner face is drawn as a polygon with at most k corners whose area is equal to the specified value. In this paper, we show that every slicing graph G… (More)
DOI: 10.1016/j.tcs.2008.10.038


10 Figures and Tables

Slides referencing similar topics