In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the a...
C. C. Cheng, Christian A. Duncan, Michael T. Goodr...
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
We consider the problem of drawing Venn diagrams for which each region’s area is proportional to some weight (e.g., population or percentage) assigned to that region. These area-...
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
In this paper, we propose the wireframe representation of nD object, which is a single 2D line drawing. A wireframe model of an nD object is composed of a set of edges connecting a...
Hongbo Li, Quan Wang, Lina Zhao, Ying Chen, Lei Hu...