We consider orthogonal drawings of a plane graph with specified face areas. For a natural number , a -gonal drawing of is an orthogonal drawing such that the boundary of is drawn as a rectangle and each inner face is drawn as a polygon with at most corners whose area is equal to the specified value. In this paper, we show that every slicing graph with a slicing tree and a set of specified face areas admits a 10-gonal drawing such that the boundary of each slicing subgraph that appears in is also drawn as a polygon with at most 10 corners. Such a drawing can be found in linear time.