---
abstract: 'We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line segments or polylines, and the vertices have *perfect angular resolution*: the edges are equally spaced around each vertex. We describe algorithms for finding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs.'
author:
- 'Christian A. Duncan'
- David Eppstein
- 'Michael T. Goodrich'
- |
    \
    Stephen G. Kobourov
- Martin Nöllenburg
bibliography:
- 'lombardi.bib'
title: Lombardi Drawings of Graphs
---

=1

Acknowledgments {#acknowledgments .unnumbered}
---------------

This research was supported in part by the National Science Foundation under grant 0830403, by the Office of Naval Research under MURI grant N00014-08-1-1015, and by the German Research Foundation under grant NO 899/1-1.

Additional Proofs and Figures
=============================
