22 citations · 24 across the 3 of their papers we have counts for
4 papers
The Geometric Thickness of Low Degree Graphs
Christian A. Duncan, David Eppstein, Stephen G. Kobourov
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. All of our algorithms run in O(n) time, where n is the number of vertices in the g…
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid
C. Erten, S. G. Kobourov
Traditional representations of graphs and their duals suggest the requirement that the dual vertices be placed inside their corresponding primal faces, and the edges of the dual gr…
On Simultaneous Graph Embedding
C. A. Duncan, A. Efrat, C. Erten +2
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given…
Computing Homotopic Shortest Paths Efficiently
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
This paper addresses the problem of finding shortest paths homotopic to a given disjoint set of paths that wind amongst point obstacles in the plane. We present a faster algorithm…