In this paper, an algorithm is presented that computes a region preserving grid embedding of G in the rectilinear grid that has planar representation isomorphic to P.Expand

We studyvisibility representations of graphs, which are constructed by mapping vertices to horizontal segments, and edges to vertical segments that intersect only adjacent vertex-segments.Expand

A directed graph is upward planar if it can be drawn in the plane such that every edge is a monotonically increasing curve in the vertical direction and no two edges cross.Expand

We present a collection of new techniques for designing and analyzing e cient external-memory algorithms for graph problems and illustrate how these techniques can be applied to a wide variety of speci c problems.Expand

From the Publisher: Using the power of technology to go beyond the borders of the printed page, Goodrich and Tamassia have created a book that is conceptually elegant and innovative.Expand

An efficient technique for on-line planarity testing of a graph is presented that uses $O(n) space and supports tests and insertions of vertices and edges of a planar graph in $O(\log n) time, where $n$ is the current number of vertice of $G$.Expand

PART I: FUNDAMENTAL TOOLS. Algorithm Analysis. Basic Data Structures. Search Trees and Skip Lists. Sorting, Sets, and Selection. Fundamental Techniques. PART II: GRAPH ALGORITHMS. Graphs. Weighted… Expand

We investigate the problem of representing acyclic digraphs in the plane in such a way that all edges flow in the same direction, e.g., from the left to the right or from the bottom to the top.Expand