Symmetric drawings of triconnected planar graphs
Seok-Hee Hong, Brendan D. McKay, Peter Eades · 2002
Abstract: This paper proves that every internally triconnected hierarchical plane graph with the outer facial cycle drawn as a convex polygon admits a convex drawing. We present an algorithm which constructs such a drawing. This extends the previous known result that every hierarchical plane graph admits a straight-line drawing.