Every Graph Admits an Unambiguous Bold Drawing
Let r and w be a fixed positive numbers, w < r. In a bold drawing of a graph, every vertex is represented by a disk of radius r, and every edge by a narrow rectangle of width w. We solve a problem of van Kreveld [K09] by showing that every graph admits a bold drawing in which the region occupied by the union of the disks and rectangles representing the vertices and edges does not contain any disk of radius r other than the ones representing the vertices.
KeywordsMaximum Radius Convex Curve Planar Partition Graph Drawing Tional Geometry
- [K09]van Kreveld, M.: Bold graph drawings. In: Proc. Canadian Conference on Computational Geometry, CCCG 2009 (2009), http://cccg.ca/proceedings/2009/cccg09_31.pdf; Also Computational Geometry: Theory & Applications (to appear)
- [M88]Mulmuley, K.: A fast planar partition algorithm, I. In: Proc. 29th FOCS, pp. 580–589 (1988)Google Scholar
- [N04]North, S.C.: Drawing Graphs with Neato (2004), http://www.graphviz.org/Documentation/neatoguide.pdf