Bulatovic, Pavle2020-09-292020-09-292020-09-292020-09-25http://hdl.handle.net/10012/16400We study area-efficient drawings of planar graphs: embeddings of graphs on an integer grid so that the bounding box of the drawing is minimized. Our focus is on the class of outer-1-planar graphs: the family of planar graphs that can be drawn on the plane with all vertices on the outer-face so that each edge is crossed at most once. We first present two straight-line drawing algorithms that yield small-area straight-line drawings for the subclass of complete outer-1-planar graphs. Further, we give an algorithm that produces an orthogonal drawing of any outer-1-plane graph in O(n log n) area while keeping the number of bends per edge relatively small.engraph drawingouter-1-planarsmall areaorthogonalstraight-lineMaster Thesis