\input zb-basic \input zb-ioport \iteman{io-port 06112206} \itemau{Chambers, Erin W.; Eppstein, David; Goodrich, Michael T.; L\"offler, Maarten} \itemti{Drawing graphs in the plane with a prescribed outer face and polynomial area.} \itemso{J. Graph Algorithms Appl. 16, No. 2, 243-259 (2012).} \itemab Summary: We study the classic graph drawing problem of drawing a planar graph using straight-line edges with a prescribed convex polygon as the outer face. Unlike previous algorithms for this problem, which may produce drawings with exponential area, our method produces drawings with polynomial area. In addition, we allow for collinear points on the boundary, provided such vertices do not create overlapping edges. Thus, we solve an open problem of {\it C. A. Duncan}, {\it M. T. Goodrich} and {\it S. G. Kobourov} [J. Graph Algorithms Appl. 15, No. 1, 7--32 (2011; Zbl 1217.05071)], which, when combined with their work, implies that we can produce a planar straight-line drawing of a combinatorially-embedded genus-$g$ graph with the graph's canonical polygonal schema drawn as a convex polygonal external face. \itemrv{~} \itemcc{} \itemut{drawings with polynomial area} \itemli{doi:10.7155/jgaa.00257} \end