… even very simple graphs such as cycle graphs cannot be … We define a Lombardi drawing of
a graph G to be a drawing … the drawings are free of crossings; the drawings of Lombardi had …

… We define a Lombardi drawing of a graph G to be a drawing of G in the plane in which … We
do not necessarily insist that the drawings are free of crossings; the drawings of Lombardi had …

… In Figure 7, we provide a scan of a drawing of Lombardi and the result of our method
applied to the same graph. In Figure 8, we show the evolution of our algorithm through various …

… traditional straightline drawings of graphs with near-Lombardi drawings. In Section 2 we …
our drawings for the visual stimuli. We designed a user study comparing drawings for graphs …

… graph admits a Lombardi drawing … Lombardi drawings for different graph classes, our
result is the first on the computational complexity of finding Lombardi drawings of general graphs…

… of previous work on Lombardi drawings is that (as we prove here) not every graph has a
Lombardi drawing. In this paper we attempt to remedy this by considering drawings in which …

… of vertices that admits a plane Lombardi drawing, we call it a plane Lombardi knot (link). We
… plane Lombardi drawing plane Lombardiness. If two vertices in a plane Lombardi drawing of …

… graphs, the medial graphs of polyhedral graphs, and we show that not every 4-regular planar
graph has a planar Lombardi drawing. … our algorithm for 3-connected planar cubic graphs. …

… that takes as input a random drawing of a graph and provides its Lombardi drawing. … for
creating a Lombardi drawing of a graph, given a random drawing of the graph. However, the …

… Indeed, we might accept that the more compelling motivation behind Lombardi’s citation is
based on … However, he does align Lombardi’s ‘graphs’ within a structuralist paradigm in which …