38 citations · 77 across the 28 of their papers we have counts for
33 papers
An algorithm for accurate and simple-looking metaphorical maps
Eleni Katsanou, Tamara Mchedlidze, Antonios Symvonis +1
"Metaphorical maps" or "contact representations" are visual representations of vertex-weighted graphs that rely on the geographic map metaphor. The vertices are represented by coun…
Tangling and Untangling Trees on Point-sets
Giuseppe Di Battista, Giuseppe Liotta, Maurizio Patrignani +2
We study a question that lies at the intersection of classical research subjects in Topological Graph Theory and Graph Drawing: Computing a drawing of a graph with a prescribed num…
Planar Stories of Graph Drawings: Algorithms and Experiments
Carla Binucci, Sabine Cornelsen, Walter Didimo +5
We address the problem of computing a dynamic visualization of a geometric graph as a sequence of frames. Each frame shows only a portion of the graph but their union covers $G…
Internally-Convex Drawings of Outerplanar Graphs in Small Area
Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati +2
A well-known result by Kant [Algorithmica, 1996] implies that -vertex outerplane graphs admit embedding-preserving planar straight-line grid drawings where the internal faces ar…
Geometric realizations of dichotomous ordinal graphs
Patrizio Angelini, Sabine Cornelsen, Carolina Haase +5
A dichotomous ordinal graph consists of an undirected graph with a partition of the edges into short and long edges. A geometric realization of a dichotomous ordinal graph in a…
Minimum Monotone Spanning Trees
Emilio Di Giacomo, Walter Didimo, Eleni Katsanou +3
Given a finite set of points in the plane and a finite set of directions, a geometric spanning tree~ of~ is -monotone if every path in is m…