Graphs are commonly used to encode relationships among entities, yet, their abstractness makes them incredibly difficult to analyze. Node-link diagrams are a popular method for drawing graphs. Classical techniques for the node-link diagrams include various layout methods that rely on derived information to position points, which often lack interactive exploration functionalities; and force-dire...

We present a method for modifying a force-directed graph drawing algorithm into an algorithm for drawing graphs with curved lines. Our method is based on embedding control points as dummy vertices so that edges can be drawn as splines. Our experiments show that our method yields aesthetically pleasing curvilinear drawing with improved angular resolution. Applying our method to the GEM algorithm...

Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. However, practical methods for producing such drawings ubiquitously use iterative numerical approximations rather than constructing and then solving algebraic expressions representing their exact solutions. To explain th...

Complex software systems are often modeled using data flow diagrams, in which nodes are connected to each other through dedicated connection points called ports. The influence a layout algorithm has on the placement of ports is determined by port constraints defined on the corresponding node. In this paper we present approaches for integrating port constraints into the layer-based approach to g...

$ Diagrams are an integral part of many visual languages. For diagrams to be an effective and efficient means of communication and visualisation, a layout often has to be produced from data sets that include little or no geometric information. The resulting layout has significant impact on the ability of users to accurately interpret the information contained in the diagrams. Moreover, the choi...

The study of evolution of networks has received increased interest with the recent discovery that many real-world networks possess many things in common, in particular the manner of evolution of such networks. By adding a dimension of time to graph analysis, evolving graphs present opportunities and challenges to extract valuable information. This paper introduces the Evolving Graph Markup Lang...

In this article, a mathematical model has been developed for calculating the energy-power parameters of drawing process in monolithic dies on straight-line machines, and its adequacy validated experimental wire laboratory automated machine. The program allows us to calculate stress, force, tensile strength yield alloy after drawing, safety factor, power. differs that it evaluate uniformity defo...

visualizes large graphs 2D drawing assumes the existence of complete or almost complete subgraphs in the graph to be visualized use of two type of techniques: force directed orthogonal drawing Levels of Abstraction total abstraction proximity abstraction explicit proximity abstraction interactive abstraction Force Directed Layout Technique with Node Grouping 1. find node grouping (by using the ...