Planar Drawings of Higher-Genus Graphs
In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface \(\cal S\) of genus g and produce a planar drawing of G in R 2, with a bounding face defined by a polygonal schema \(\cal P\) for \(\cal S\). Our drawings are planar, but they allow for multiple copies of vertices and edges on \(\cal P\)’s boundary, which is a common way of visualizing higher-genus graphs in the plane. As a side note, we show that it is NP-complete to determine whether a given graph embedded in a genus-g surface has a set of 2g fundamental cycles with vertex-disjoint interiors, which would be desirable from a graph-drawing perspective.
- 3.Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Planar drawings of higher-genus graphs. Technical report (August 2009), http://arxiv.org/abs/0908.1608
- 5.Erickson, J., Har-Peled, S.: Optimally cutting a surface into a disk. In: Proc. of the 18th ACM Symp. on Computational Geometry (SCG), pp. 244–253 (2002)Google Scholar
- 8.Lazarus, F., Pocchiola, M., Vegter, G., Verroust, A.: Computing a canonical polygonal schema of an orientable triangulated surface. In: Proc. of the 17th ACM Symp. on Computational Geometry (SCG), pp. 80–89 (2001)Google Scholar