Computing NodeTrix Representations of Clustered Graphs

NodeTrix representations are a popular way to visualize clustered graphs; they represent clusters as adjacency matrices and inter-cluster edges as curves connecting the matrix boundaries. We study the complexity of constructing NodeTrix representations focusing on planarity testing problems, and we show several NP-completeness results and some polynomial-time algorithms. Building on such algorithms we develop a JavaScript library for NodeTrix representations aimed at reducing the crossings between edges incident to the same matrix.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016

Transonic small disturbances equation applied to the solution of two-dimensional nonsteady flows

Transonic nonsteady flows are of large practical interest. Aeroelastic instability prediction, control figured vehicle techniques or rotary wings in forward flight are some examples justifying the effort undertaken to improve knowledge of these problems is described. The numerical solution of these problems under the potential flow hypothesis is described. The use of an alternating direction implicit scheme allows the efficient resolution of the two dimensional transonic small perturbations equation

Scan to BIM for 3D reconstruction of the papal basilica of saint Francis in Assisi In Italy

The historical building heritage, present in the most of Italian cities centres, is, as part of the construction sector, a working potential, but unfortunately it requires planning of more complex and problematic interventions. However, policies to support on the existing interventions, together with a growing sensitivity for the recovery of assets, determine the need to implement specific studies and to analyse the specific problems of each site. The purpose of this paper is to illustrate the methodology and the results obtained from integrated laser scanning activity in order to have precious architectural information useful not only from the cultural heritage point of view but also to construct more operative and powerful tools, such as BIM (Building Information Modelling) aimed to the management of this cultural heritage. The Papal Basilica and the Sacred Convent of Saint Francis in Assisi in Italy are, in fact, characterized by unique and complex peculiarities, which require a detailed knowledge of the sites themselves to ensure visitor’s security and safety. For such a project, we have to take in account all the people and personnel normally present in the site, visitors with disabilities and finally the needs for cultural heritage preservation and protection. This aim can be reached using integrated systems and new technologies, such as Internet of Everything (IoE), capable of connecting people, things (smart sensors, devices and actuators; mobile terminals; wearable devices; etc.), data/information/knowledge and processes to reach the desired goals. The IoE system must implement and support an Integrated Multidisciplinary Model for Security and Safety Management (IMMSSM) for the specific context, using a multidisciplinary approach

Hierarchical Partial Planarity

In this paper we consider graphs whose edges are associated with a degree of {\em importance}, which may depend on the type of connections they represent or on how recently they appeared in the scene, in a streaming setting. The goal is to construct layouts of these graphs in which the readability of an edge is proportional to its importance, that is, more important edges have fewer crossings. We formalize this problem and study the case in which there exist three different degrees of importance. We give a polynomial-time testing algorithm when the graph induced by the two most important sets of edges is biconnected. We also discuss interesting relationships with other constrained-planarity problems.Comment: Conference version appeared in WG201

X-ray view of four high-luminosity Swift/BAT AGN: Unveiling obscuration and reflection with Suzaku

The Swift/BAT nine-month survey observed 153 AGN, all with ultra-hard X-ray BAT fluxes in excess of 10^-11 erg cm^-2 s^-1 and an average redshift of 0.03. Among them, four of the most luminous BAT AGN (44.73 < Log L(BAT) < 45.31) were selected as targets of Suzaku follow-up observations: J2246.0+3941 (3C 452), J0407.4+0339 (3C 105), J0318.7+6828, and J0918.5+0425. The column density, scattered/reflected emission, the properties of the Fe K line, and a possible variability are fully analyzed. For the latter, the spectral properties from Chandra, XMM-Newton and Swift/XRT public observations were compared with the present Suzaku analysis. Of our sample, 3C 452 is the only certain Compton-thick AGN candidate because of i) the high absorption and strong Compton reflection; ii) the lack of variability; iii) the "buried" nature, i.e. the low scattering fraction (<0.5%) and the extremely low relative [OIII] luminosity. In contrast 3C 105 is not reflection-dominated, despite the comparable column density, X-ray luminosity and radio morphology, but shows a strong long-term variability in flux and scattering fraction, consistent with the soft emission being scattered from a distant region (e.g., the narrow emission line region). The sample presents high (>100) X-to-[OIII] luminosity ratios, confirming the [OIII] luminosity to be affected by residual extinction in presence of mild absorption, especially for "buried" AGN such as 3C 452. Three of our targets are powerful FRII radio galaxies, making them the most luminous and absorbed AGN of the BAT Seyfert survey despite the inversely proportional N_H - L_X relation.Comment: A&A paper in press, 17 page

Simultaneous Orthogonal Planarity

We introduce and study the $\textit{OrthoSEFE}-k$ problem: Given $k$ planar graphs each with maximum degree 4 and the same vertex set, do they admit an OrthoSEFE, that is, is there an assignment of the vertices to grid points and of the edges to paths on the grid such that the same edges in distinct graphs are assigned the same path and such that the assignment induces a planar orthogonal drawing of each of the $k$ graphs? We show that the problem is NP-complete for $k \geq 3$ even if the shared graph is a Hamiltonian cycle and has sunflower intersection and for $k \geq 2$ even if the shared graph consists of a cycle and of isolated vertices. Whereas the problem is polynomial-time solvable for $k=2$ when the union graph has maximum degree five and the shared graph is biconnected. Further, when the shared graph is biconnected and has sunflower intersection, we show that every positive instance has an OrthoSEFE with at most three bends per edge.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016