852 search results - page 14 / 171 » Using graph parsing for automatic graph drawing |
GD
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. In this paper we consider the problem of simultaneous drawing of two graphs. The goal is to produce aesthetically pleasing drawings for the two graphs by means of a heuri...
GD
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. As the number of devices connected to the internet continues to grow rapidly and software systems are being increasingly deployed on the web, security and privacy have be...
ENDM
2008
13 years 7 months ago
2008
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...
IV
2002
IEEE
14 years 8 days ago
2002
IEEE
We propose a force-directed approach for drawing graphs in a nearly symmetric fashion. Our algorithm is built upon recent theoretical results on maximum symmetric subgraphs. Knowi...
CCCG
2007
13 years 8 months ago
2007
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph uses a polynomial ...