Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …

A complete, self-contained introduction to a powerful and resurging mathematical discipline
Combinatorial Geometry presents and explains with complete proofs some of the most …

Among the intuitively appealing aspects of graph theory is its close connection to drawings
and geometry. The development of computer technology has become a source of motivation …

The existing literature gives efficient algorithms for mapping trees or less restrictively
outerplanar graphs on a given set of points in a plane, so that the edges are drawn planar …

Let G be a planar graph of n vertices, v 1,…, vn, and let {p 1,…, pn} be a set of n points in the
plane. We present an algorithm for constructing in O (n 2) time a planar embedding of G …

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 an n-vertex outer-planar graph G and a set P of n points in the plane, we present an O
(nlog3n) time and O (n) space algorithm to compute a straight-line embedding of G in P …

The paper presents self-organizing graphs, a novel approach to graph layout based on a
competitive learning algorithm. This method is an extension of self-organization strategies …

A geometric graph is a graph drawn in the plane such that its vertices are points in general
position and its edges are straight-line segments. The study of geometric graphs is a fairly …

Abstract Let G=(V, E) be a graph with n vertices and let P be a set of n points in the plane.
We show that deciding whether there is a planar straight-line embedding of G such that the …