Matched Drawings of Planar Graphs ⋆ (2008)
Emilio Di Giacomo, Walter Didimo, Marc Van Kreveld, Bettina Speckmann
Abstract. A natural way to draw two planar graphs whose vertex sets are matched is to assign each matched pair a unique y-coordinate. In this paper we introduce the concept of such matched drawings,...
Emilio Di Giacomo, Henk Meijer, Stephen K. Wismath, Emilio Di Giacomo, Henk Meijer, Stephen K. Wismath
This paper studies the problem of drawing directed acyclic graphs in three dimensions in the straight-line grid model, and so that all directed edges are oriented in a common (upward) direction. We...
Drawing Colored Graphs on Colored Points ⋆ (Extended Abstract) (2008)
Melanie Badent, Emilio Di Giacomo
Abstract. Let G be a planar graph with n vertices whose vertex set is partitioned into subsets V0,..., Vk−1 for a positive integer 1 ≤ k ≤ n and let S be a set of n distinct points in the plane...
Track drawings of graphs with constant queue number (2008)
Emilio Di Giacomo, Henk Meijer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing is called the track...
Emilio Di Giacomo, Henk Meijer
This paper studies the problem of computing 3D crossing-free straight-line grid drawings of graphs such that the overall volume is small. We show that every 2-tree (and therefore every...
Visualizing Geometric Algorithms with WAVE: System Demonstration (Short Abstract) (2007)
Camil Demetrescu, Emilio Di Giacomo, Irene Finocchi
The visual nature of geometric applications makes them a natural area for designing systems which describe relevant aspects of the algorithm behaviour by using animation. Namely, the animation of...
The k-lines Drawability Problem for Series-Parallel Digraphs (2007)
Emilio Di Giacomo, Stephen K. Wismath
1
Visualizing Geometric Algorithms with WAVE: System Demonstration (Short Abstract) (2007)
Camil Demetrescu, Emilio Di Giacomo, Irene Finocchi
The visual nature of geometric applications makes them a natural area for designing systems which describe relevant aspects of the algorithm behaviour by using animation. Namely, the animation of...
A topology-driven approach to the design of web meta-search clustering engines (2005)
Emilio Di Giacomo, Emilio Di Giacomo, Walter Didimo, Walter Didimo, Luca Grilli, Luca Grilli
The paradigm adopted by classical Web search engines to output the results of a query is often inadequate. It typically consists of a ranked list of URLs, which may be very long and difficult to...
On embedding a graph on two sets of points (2005)
Emilio Di Giacomo, Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta, Francesco Trotta
Let R and B be two sets of points such that the points of R are colored red and the points of B are colored blue. Let G be a planar graph such that |R | vertices of G are red and |B | vertices of G...
On Orthogonal 3D Shapes of Theta Graphs (2002)
Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani
The recent interest in three dimensional graph drawing has been motivating studies on how to extend two dimensional techniques to higher dimensions. A common 2D approach for computing an orthogonal...
Drawing Series-Parallel Graphs on a Box (1997)
Emilio Di Giacomo, Giuseppe Liotta, Stephen K. Wismath
A box is a restricted portion of the three-dimensional integer grid consisting of four parallel lines of in nite length placed one grid unit apart. A box-drawing of a graph is a straight-line...