17 search results - page 2 / 4 » On Nearly Symmetric Drawings of Graphs |
ALGORITHMICA
2011
13 years 2 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
ICNC
2005
Springer
14 years 26 days ago
2005
Springer
This paper proposes an improved genetic algorithm for producing aesthetically pleasing drawings of general undirected graphs. Previous undirected graph drawing algorithms draw larg...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We consider linear systems arising from the use of the finite element method for solving a certain class of linear elliptic problems. Our main result is that these linear systems, ...
IV
2005
IEEE
14 years 28 days ago
2005
IEEE
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
PAMI
2007
13 years 6 months ago
2007
—A novel patch-based correspondence model is presented in this paper. Many segment-based correspondence approaches have been proposed in recent years. Untextured pixels and bound...