We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...
We introduce the notion of Lombardi graph drawings, named after the abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line seg...
Christian A. Duncan, David Eppstein, Michael T. Go...
Computer-assisted animation production tools have an important role in animation production industries. They could reduce the production cost and time. In this paper, a new compute...
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
Graphical user interfaces rely heavily on the tool metaphor. In most drawing systems, for example, functions are organized as they might be on a workbench; buttons associated with...