In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
Carla Binucci, Emilio Di Giacomo, Walter Didimo, A...
When a graph is drawn in a classical manner, its vertices are shown as small disks and its edges with a positive width; zero-width edges exist only in theory. Let r denote the rad...
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...