Abstract: A computer-implemented method of drawing an undirected graph in which multiple nodes are connected by multiple edges is provided using a computer system in which a computer is coupled to the computer display. The computer includes a processor and memory. A representation is received of a graph having multiple nodes and multiple edges, in which positions of the nodes relative to one another have been previously determined. The representation is modified so as to: 1) preserve the positions of the nodes relative to one another; and 2) simplify the visual representation of the graph by sharing drawn lines between different distinct edges in such a way as to enable the different distinct edges, despite such sharing, to still be recognized by a user. In one embodiment, the processor places the nodes in unique positions with integer coordinates.

Abstract: A computer-implemented method of drawing an undirected graph in which multiple nodes are connected by multiple edges is provided using a computer system in which a computer is coupled to the computer display. The computer includes a processor and memory. A representation is received of a graph having multiple nodes and multiple edges, in which positions of the nodes relative to one another have been previously determined. The representation is modified so as to: 1) preserve the positions of the nodes relative to one another; and 2) simplify the visual representation of the graph by sharing drawn lines between different distinct edges in such a way as to enable the different distinct edges, despite such sharing, to still be recognized by a user. In one embodiment, the processor places the nodes in unique positions with integer coordinates.

Abstract: A computer-implemented method is provided for drawing a graph in which multiple nodes are connected by multiple edges. An image is displayed representing a node, and the image is processed to distinguish image foreground pixels and image background pixel. An edge is displayed incident to the node, the edge extending over selected background pixels and stopping short of selected foreground pixels. There results a graph drawing that is more aesthetically pleasing.

Abstract: A computer-implemented method is provided of drawing a graph in which nodes are connected by edges, with the edges having a specified minimum spacing. A shape or image representing a node is displayed, and a bounding box enclosing the node is determined, the bounding box being sized to satisfy the specified minimum spacing in relation to the bounding box. Outside the bounding box, placement of edges incident to the node is determined so as to satisfy the specified minimum spacing. Inside the bounding box, the edges are extended nearer to the image without requiring that the specified minimum spacing be observed, and the edges incident to the node are displayed.

Abstract: A system for arranging a plurality of nodes into graphical layout form partitions the nodes into a set of clusters from which a cluster graph is created. The cluster partitioning is based on the inter-nodal relationships, and cluster size depends on the number of nodes associated with each cluster. The clusters are laid out to avoid overlap, and cluster boundaries, within which nodes in a cluster are constrained, are generated. Nodes of each cluster as classified as either internal or boundary nodes, with boundary nodes being projected outward towards the boundary of the cluster. As an optional step, connection edges between nodes are routed to avoid overlap.

Abstract: A system for arranging a plurality of nodes into graphical layout form partitions the nodes into a set of clusters from which a cluster graph is created. The cluster partitioning is based on the inter-nodal relationships, and cluster size depends on the number of nodes associated with each cluster. The clusters are laid out to avoid overlap, and cluster boundaries, within which nodes in a cluster are constrained, are generated. Nodes of each cluster as classified as either internal or boundary nodes, with boundary nodes being projected outward towards the boundary of the cluster. As an optional step, connection edges between nodes are routed to avoid overlap.

Abstract: A system for arranging a plurality of nodes into graphical layout form partitions the nodes into a set of clusters from which a cluster graph is created. The cluster partitioning is based on the inter-nodal relationships, and cluster size depends on the number of nodes associated with each cluster. The clusters are laid out to avoid overlap, and cluster boundaries, within which nodes in a cluster are constrained, are generated. Nodes of each cluster as classified as either internal or boundary nodes, with boundary nodes being projected outward towards the boundary of the cluster. As an optional step, connection edges between nodes are routed to avoid overlap.