In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
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...
: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....