@article {IOPORT.05996747,
    author       = {Duncan, Christian A. and Eppstein, David and Goodrich, Michael T. and Kobourov, Stephen G. and N\"ollenburg, Martin},
    title        = {Lombardi drawings of graphs.},
    year         = {2012},
    journal      = {Journal of Graph Algorithms and Applications},
    volume       = {16},
    number       = {1},
    issn         = {1526-1719},
    pages        = {85-108},
    publisher    = {Brown University, Providence, RI; University of Texas, Dallas, TX},
    abstract     = {Summary: 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 equiangularly spaced around each vertex. We describe algorithms for finding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs.},
    identifier   = {05996747},
}