International Symposium on Graph Drawing and Network Visualization

Graph Drawing and Network Visualization pp 551-553 | Cite as

PED User Study

  • Till Bruckdorfer
  • Michael Kaufmann
  • Simon Leibßle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9411)


Partial edge drawing (PED) is a model for a straight-line drawing of a graph, where edges are subdivided into three parts in order to drop the middle part.




  1. 1.
    Burch, M., Vehlow, C., Konevtsova, N., Weiskopf, D.: Evaluating partially drawn links for directed graph edges. In: Speckmann, B. (ed.) GD 2011. LNCS, vol. 7034, pp. 226–237. Springer, Heidelberg (2011) CrossRefGoogle Scholar
  2. 2.
    Bruckdorfer, T., Cornelsen, S., Gutwenger, C., Kaufmann, M., Montecchiani, F., Nöllenburg, M., Wolff, A.: Progress on partial edge drawings. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 67–78. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  3. 3.
    Bruckdorfer, T., Kaufmann, M.: Mad at edge crossings? break the edges!. In: Kranakis, E., Krizanc, D., Luccio, F. (eds.) FUN 2012. LNCS, vol. 7288, pp. 40–50. Springer, Heidelberg (2012) CrossRefGoogle Scholar
  4. 4.
    Barabasi, A.-L., Albert, R.: Emergence of scaling in random networks. Sci. 286(5439), 509–512 (1999)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Lee, B., Plaisant, C., Parr, C.S., Fekete, J.-D., Henry, N.: Task taxonomy for graph visualization. In: BELIV 2006, pp. 1–5. ACM (2006)Google Scholar
  6. 6.
    yWorks GmbH, yFiles graph library. Accessed February 2015

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Till Bruckdorfer
    • 1
  • Michael Kaufmann
    • 1
  • Simon Leibßle
    • 1
  1. 1.Wilhelm-Schickard-Institut für InformatikUniversität TübingenTübingenGermany

Personalised recommendations