TR98-15

Graph Multidrawing: Finding Nice Drawings Without Defining Nice


    •  T. Biedl, J. Marks, K. Ryall, S. Whitesides, "Graph Multidrawing: Finding Nice Drawings Without Defining Nice", Tech. Rep. TR98-15, Mitsubishi Electric Research Laboratories, Cambridge, MA, October 1998.
      BibTeX TR98-15 PDF
      • @techreport{MERL_TR98-15,
      • author = {T. Biedl, J. Marks, K. Ryall, S. Whitesides},
      • title = {Graph Multidrawing: Finding Nice Drawings Without Defining Nice},
      • institution = {MERL - Mitsubishi Electric Research Laboratories},
      • address = {Cambridge, MA 02139},
      • number = {TR98-15},
      • month = oct,
      • year = 1998,
      • url = {https://www.merl.com/publications/TR98-15/}
      • }
Abstract:

This report proposes a \"multidrawing\" approach to graph drawing. Current graph-drawing systems typically produce only one drawing of a graph. By contrast, the multidrawing approach calls for systematically producing many drawings of the same graph, where the drawings presented to the user represent a balance between aesthetics and diversity. This addresses a fundamental problem in graph drawing, namely, how to avoid requiring the user to specify formally and precisely all the characteristics of a single nice drawing. We present a proof-of-concept implementation with which we produce diverse selections of symmetric-looking drawings for small graphs.