A proximity drawing of a graph is a straight-line drawing where adjacent vertices are represented by points that are deemed to be close according to some proximity measure. A rectangle of innuence drawing is a proximity drawing where the measure is based on the concept of rectangle of innuence. Given two points u and v, the rectangle of innuence of u and v is the axis-aligned rectangle having u...

This paper is referred to the experiences run at Iuav since 2004 in the framework of the EU-FSE founded Courses of Collaborative Composition. In these courses we built up some work/game thought as meaning of a distance collaborative game. Rally around these games, we delivered specific knowledge and portions of technical knowledge referred to the issue of formal structure, shape grammar, and co...

We show that each quadrangulation on n vertices has a closed rectangle of influence drawing on the (n − 2) × (n − 2) grid. Further, we present a simple algorithm to obtain a straight-line drawing of a quadrangulation on the ⌈ n 2 ⌉ × ⌈ 3n 4 ⌉ grid. This is not optimal but has the advantage over other existing algorithms that it is not needed to add edges to the quadrangulation to make it 4-conn...

The Machine Drawing Understanding System (MDUS) is an experimental CAD conversion system aimed at realizing the entire process of understanding mechanical engineering drawings, from scanning to three-dimensional (3-D) reconstruction. This paper describes the structure, algorithms and current performance of MDUS. The modular structure of the system provides for further improvements and makes it ...

Recent cognitive experiments have shown that the negative impact of an edge crossing on the human understanding of a graph drawing, tends to be eliminated in the case where the crossing angles are greater than 70 degrees. This motivated the study of RAC drawings, in which every pair of crossing edges intersects at right angle. In this work, we demonstrate a class of graphs with unique RAC combi...

Graph drawing addresses the problem of constructing geometric representation of information and finds applications in almost every branch of science and technology. Efficient algorithms are essential for automatic drawings of graphs, and hence a lot of research has been carried out in the last decade by many researchers over the world to develop efficient algorithms for drawing graphs. In this ...

Recent empirical research has indicated that human graph reading performance improves when crossing angles increase. However, crossing angle has not been used as an aesthetic criterion for graph drawing algorithms so far. In this paper, we introduce a force-directed method that aims to construct graph drawings with large crossing angles. Experiments indicate that our method significantly increa...