2 citations · 4 across the 3 of their papers we have counts for
1 paper · 1 filter
Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of…