graph drawing contest 2019 report
play

GRAPH DRAWING CONTEST 2019 report CONTEST COMMITTEE Philipp - PowerPoint PPT Presentation

Apr 19, 2023 •122 likes •1.08k views

GRAPH DRAWING CONTEST 2019 report CONTEST COMMITTEE Philipp Kindermann University of Wrzburg Tamara Mchedlidze Karlsruhe Institute of Technology Ignaz Rutter University of Passau GRAPH DRAWING CONTEST historic perspective GRAPH DRAWING

  1. GRAPH DRAWING CONTEST 2019 report CONTEST COMMITTEE Philipp Kindermann University of Würzburg Tamara Mchedlidze Karlsruhe Institute of Technology Ignaz Rutter University of Passau

  2. GRAPH DRAWING CONTEST historic perspective

  3. GRAPH DRAWING CONTEST historic perspective 45 40 35 30 25 number of categories 20 number of winners number of submissions 15 10 5 0 1995 1997 1999 2001 2003 2005 2007 2009 2011 2013 2015 2017 2019 1994 1996 1998 2000 2002 2004 2006 2008 2010 2012 2014 2016 2018

  4. GRAPH DRAWING CONTEST historic perspective 1994 Uwe Wuerker • Stefan Hougardy • Petra 2007 Wolfgang Brunner & Jens Schmidt • Robert 2018 Evmorfia Argyriou, Michael Baur, Anne Mutzel & Thomas Odenthal • Georg Sander Theron, Rodrigo Santamaria, Juan Garcia, Diego Eberle & Armin Gufler • Florian Grötschla, Tamar Gomez & Vadim Paz-Madrid • Felix Heinen Mirbach, Christian Ortlieb, Tamara Mchedlidze & 1995 Falk Schreiber & Carsten Friedrich • Vladimir Marcel Radermacher • Myroslav Kryven & Batagelj & Andrej Mrvar • Paulis Kikusts & Peteris 2008 Yifan Hu & Emden Gansner • Melanie Johannes Zink • Amadäus Spallek, Christian Rucevskis • Georg Sander Badent & Pietro Palladino • Melanie Badent, Geckeler, Henry Förster & Michael Bekos Martin Mader & Christian Piech • Hoi-Ming Wong, 1996 Ulrich Fößmeier & Michael Kaufmann • 2019 ? Markus Chimani & Karsten Klein Vladimir Batagelj & Andrej Mrvar • Falk Schreiber & Carsten Friedrich • Thomas Kamps, Jörg Kleinz 2009 Hui Liu • Nicholas Jefferson • Melanie Badent & Thomas Reichenberger & Michael Baur • Hoi-Ming Wong & Karsten Klein • Joe Fowler 1997 B. Bascary, B. Cattan, A. Cohen-Solal, M. Philip & H. Szigeti • Vladimir Batagelj & Andrej 2010 Quan Nguyen • Sergey Pupyrev • M. Baur, Mrvar • Michael Kaufmann & Gunnar Klau • M. Siebenhaller, R. Wiese & Thomas Wurst • Petra Thomas Ziegler & Petra Mutzel • Cristian Ghezzi • Mutzel & Hoi-Ming Wong • Maarten Löffler & Falk Schreiber & Carsten Friedrich Martin Nöllenburg 1998 Vladimir Batagelj & Andrej Mrvar • Petrus 2011 Hanley Weng • M. Löffler, D. Eppstein, M. Abri Santoso & Andi Surjanto • Roland Wiese Goodrich & S. Kobourov • R. Zelina, S. Bota, S. 1999 Vladimir Batagelj & Andrej Mrvar • Ulrik Houtman & R. Ban • Sergey Pupyrev • Maarten Brandes • Karlis Freivalds & Paulis Kikusts • Rowena Löffler & Martin Nöllenburg Mankelow 2012 Roman Prutkin • Sergey Pupyrev • Remus 2000 Nikola S. Nikolov • Vladimir Batagelj & Andrej Zelina, S. Bota, S. Houtman & R. Balaban • Tobias Mrvar • Jan Adamec • C. Duncan, P . Gajer, M. Brinkjost • A. Bauer, I. Rutter, J. Vordermeier & M. Goodrich & S. Kobourov • Robby Schönfeld & Kaufmann Nikola S. Nikolov 2001 Ulrik Brandes & Marco Gärtler • C. 2013 Jos de Jong & Giovanni Pazienza • Remus Gutwenger, K. Klein, J. Kupke & S. Leipert • Roland Zelina, Sebastian Bota, Siebren Houtman & Radu Wiese • Carsten Friedrich • Merijam Percan Balaban • Thomas Bläsius & Ignaz Rutter 2002 Daniel Gmach • Paul Holleis & Thomas 2014 Martin Nöllenburg • Remus Zelina, Sebastian Zimmermann • Nikola S. Nikolov & Patrick Healey Bota, Siebren Houtman & Radu Balaban • Tamara • Christoph Vogt Mchedlidze, Martin Nöllenburg, Alexander 2003 Daniel Gmach, Paul Holleis & Thomas Khomenko, Igor Karlinsky & Denis Knöpfle • Philipp Zimmermann • Christian Kuklas, Dirk Koschützki & Kindermann, Fabian Lipp & Wadim Reimche Falk Schreiber 2015 Tamara Mchedlidze • Jennifer Hood & Pat 2004 Andrei Grecu & Gunnar Klau • Ulrik Brandes, Morin • Boris Klemz, Ulf Rüegg & Fabian Lipp • Daniel Fleischer & Thomas Puppe Josef Cibulka 2005 Markus Chimani, Carsten Gutwenger & 2016 Fabian Klute • Jonathan Klawitter & Tamara Karsten Klein • V . Batagelj, A. Mrvar, A. Ahmed, X. Mchedlidze • Michael Bekos, Thanasis Lianeas & Fu, S. Hong & D. Merrick • Marco Gärtler & Markus Chrysanthi Raftopoulou • Johan de Ruiter Krug 2006 Michael McGuffin • Adel Admed, Seok-Hee 2017 Steven Shangzhou Wang • Fabian Klute & Hong, Quan Nguyen & Donald Taylor • Adel Irene Parada • Theresa Fröschl, Jonathan Admed, Xiaoyan Fu, Seok-Hee Hong, Quan Klawitter & Darren Strash • Almut Demel, Dominik Nguyen & Kai Xu • Fabrizio Frati & Markus Geyer • Dürrschnabel, Tamara Mchedlidze, Marcel Andreas Gerasch & team Radermacher & Lasse Wulf

  5. 2019 CONTEST overview

  6. 2019 CONTEST overview CREATIVE TOPICS LIVE CHALLENGE In one hour, draw a number of directed Marvel Cinematic graphs as straight-line upwards embeddings in the plane, minimizing Universe the number of crossings. Draw the graph of appearances of manual category superheroes in the Marvel Cinematic Universe movies as of 2018. Meal Ingredients automatic category Draw the graph of occurences of ingredients in popular meals.

  7. 2019 CONTEST overview CREATIVE TOPICS LIVE CHALLENGE In one hour, draw a number of directed Marvel Cinematic graphs as straight-line upwards embeddings in the plane, minimizing Universe the number of crossings. Draw the graph of appearances of manual category superheroes in the Marvel Cinematic Universe movies as of 2018. 6 submissions 15 submissions Meal Ingredients automatic category Draw the graph of occurences of ingredients in popular meals. 4 submissions 4 submissions

  8. 2019 CONTEST overview Participating individuals per country creative topics live challenge Germany 26 Austria 18 Australia 12 Italy 6 Czech Republic 5 United Kingdom 3 United States 3 Canada 2 France 1 Cyprus 1 New Zealand 1

  9. CREATIVE TOPICS Marvel Cinematic Universe

  10. CREATIVE TOPICS Marvel Cinematic Universe Marvel Cinematic Universe Graph • vertices are superheroes and movies • an edge between a hero and a movie if the hero appeared in the movie • 28 heroes, 24 movies • 152 edges

  11. CREATIVE TOPICS Marvel Cinematic Universe Marvel Cinematic Universe Graph • vertices are superheroes and movies • an edge between a hero and a movie if the hero appeared in the movie • 28 heroes, 24 movies • 152 edges

  12. CREATIVE TOPICS Marvel Cinematic Universe Marvel Cinematic Universe Graph • vertices are superheroes and movies • an edge between a hero and a movie if the hero appeared in the movie • 28 heroes, 24 movies • 152 edges

  13. CREATIVE TOPICS Marvel Cinematic Universe 3rd Place Velitchko Filipov, Alessio Arleo, Davice Ceneda, and Silvia Miksch

  14. CREATIVE TOPICS Marvel Cinematic Universe 2nd Place Markus Wallinger

  15. CREATIVE TOPICS Marvel Cinematic Universe 1st Place Evmorfia Argyriou Christian Brunnermeier Anne Eberle Johannes Rössel

  16. CREATIVE TOPICS Meal Ingredients

  17. CREATIVE TOPICS Meal Ingredients TheMealDB database • vertices are ingredients and meals • an edge if an ingredient is part of a meal • meals have a category (e.g. desert) and an area (e.g. Indian) • 151 meals and 297 ingredients • 2115 edges

  18. CREATIVE TOPICS Meal Ingredients TheMealDB database • vertices are ingredients and meals • an edge if an ingredient is part of a meal • meals have a category (e.g. desert) and an area (e.g. Indian) • 151 meals and 297 ingredients • 2115 edges

  19. CREATIVE TOPICS Meal Ingredients 3rd Place James Wood Marni Torkel Ereina Gomez Amyra Meidiana Peter Eades Seok-Hee Hong

  20. CREATIVE TOPICS Meal Ingredients 2nd Place Elektra Kypridemou Christos Rodosthenous

  21. CREATIVE TOPICS Meal Ingredients 1st Place Guangping Li Soeren Nickel Martin Nöllenburg Ivan Viola Hsiang-Yun Wu

  22. LIVE CHALLENGE

  23. LIVE CHALLENGE Crossing Minimization in Upward Drawings • input: directed graph and grid size • output: straight-line upward embedding with vertices on grid • must be a proper drawing • objective: minimize the number of crossings

  24. LIVE CHALLENGE Crossing Minimization in Upward Drawings • input: directed graph and grid size • output: straight-line upward embedding with vertices on grid 3 4 • must be a proper drawing • objective: minimize 1 2 the number of crossings 0

  25. LIVE CHALLENGE Crossing Minimization in Upward Drawings • input: directed graph and grid size • output: straight-line upward embedding with vertices on grid 4 • must be a proper drawing • objective: minimize 1 2 the number of crossings 3 0

  26. LIVE CHALLENGE Crossing Minimization in Upward Drawings • input: directed graph and grid size • output: straight-line upward embedding with vertices on grid 3 4 • must be a proper drawing • objective: minimize 1 2 the number of crossings 0

  27. LIVE CHALLENGE

  28. LIVE CHALLENGE

  29. LIVE CHALLENGE

  30. LIVE CHALLENGE

  31. LIVE CHALLENGE

  32. LIVE CHALLENGE

  33. LIVE CHALLENGE

  34. LIVE CHALLENGE

  35. LIVE CHALLENGE

  36. LIVE CHALLENGE

  37. LIVE CHALLENGE

  38. LIVE CHALLENGE

  39. LIVE CHALLENGE

  40. LIVE CHALLENGE the graphs

  41. LIVE CHALLENGE the graphs input best manual best automatic Aaaaaah 0 crossings 0 crossings graph 1

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Multi-Level Graph Layout on the GPU Frishman et al 2007 Interactive Visualization of Small

Multi-Level Graph Layout on the GPU Frishman et al 2007 Interactive Visualization of Small

Graph Drawing In General Graph Drawing In General Graph Drawing Using Physical Models Graph Drawing Using Physical Models Four Papers Drawing on Physical Analogies Brandes 2001 Drawing large graphs with a potential-field-based multilevel

72 views • 3 slides
Graph Drawing Tutorial Isabel F. Cruz Worcester Polytechnic Institute Roberto Tamassia Brown

Graph Drawing Tutorial Isabel F. Cruz Worcester Polytechnic Institute Roberto Tamassia Brown

Graph Drawing Tutorial Isabel F. Cruz Worcester Polytechnic Institute Roberto Tamassia Brown University Graph Drawing 0 Introduction Graph Drawing 1 Graph Drawing models, algorithms, and systems for the visualization of graphs and

1.19k views • 107 slides
This Is Time in Graph Drawing Giuseppe Di Battista Universit degli Studi Roma Tre 27th

This Is Time in Graph Drawing Giuseppe Di Battista Universit degli Studi Roma Tre 27th

01/10/2019 This Is Time in Graph Drawing Giuseppe Di Battista Universit degli Studi Roma Tre 27th International Symposium on Graph Drawing and Network Visualization GD2019 Prhonice /Prague, September 17-20, 2019 1 BGPlay My

1.01k views • 66 slides
Graph Stories in Small Area 27th Int. Symposium on Graph Drawing and Network Visualization (GD

Graph Stories in Small Area 27th Int. Symposium on Graph Drawing and Network Visualization (GD

Graph Stories in Small Area 27th Int. Symposium on Graph Drawing and Network Visualization (GD 2019) Manuel Borrazzo, Giordano Da Lozzo , Fabrizio Frati, Maurizio Patrignani D EPARTMENT OF E NGINEERING R OMA T RE U NIVERSITY GD19 - Graph

819 views • 44 slides
Graph Drawing in Ti k Z Till Tantau Graph Drawing Conference 2012 The Problem: Integrating Graph

Graph Drawing in Ti k Z Till Tantau Graph Drawing Conference 2012 The Problem: Integrating Graph

Graph Drawing in Ti k Z Till Tantau Graph Drawing Conference 2012 The Problem: Integrating Graph Drawings Into Documents 3 5 6 7 8 9 2 4 f 1 f 2 h 3 h f 6 c 2 h 4 p f 3 c 1 h 1 h h 2 f 5 f 4 1 5 6 3 0 1 2 4 (b) A realization

634 views • 26 slides
Graph Drawing Embedding Embedding For a given graph G = ( V , E ) , an embedding (into R 2 )

Graph Drawing Embedding Embedding For a given graph G = ( V , E ) , an embedding (into R 2 )

Graph Drawing Embedding Embedding For a given graph G = ( V , E ) , an embedding (into R 2 ) assigns each vertex a coordinate and each edge a (not necessarily straight) line connecting the corresponding coordinates. 0 1 3 4 1 1 0 2 5 2

541 views • 18 slides
Seok-Hee Hong (University of Sydney) Research Interests - Graph Drawing - Algorithm/Theory -

Seok-Hee Hong (University of Sydney) Research Interests - Graph Drawing - Algorithm/Theory -

Seok-Hee Hong (University of Sydney) Research Interests - Graph Drawing - Algorithm/Theory - Information Visualisation - Visual Analytics Research Projects - Graph Drawing algorithm - New Criteria for Graph Drawing - Evaluation of

202 views • 4 slides
Graph Drawing 2019 Pr uhonice, September 17-19 On the 2-Colored Crossing Number Oswin

Graph Drawing 2019 Pr uhonice, September 17-19 On the 2-Colored Crossing Number Oswin

Graph Drawing 2019 Pr uhonice, September 17-19 On the 2-Colored Crossing Number Oswin Aichholzer 1 , Ruy Fabila-Monroy 2 , Adrian Fuchs 1 , Carlos Hidalgo-Toscano 2 , Irene Parada 1 , Birgit Vogtenhuber 1 , and Francisco Zaragoza 3 1 Graz

882 views • 50 slides
Martin Fink University of California Santa Barbara research interests: Graph Drawing

Martin Fink University of California Santa Barbara research interests: Graph Drawing

Martin Fink University of California Santa Barbara research interests: Graph Drawing Information Visualization Computational Geometry Experimental Graph Drawing Algorithms Marcus Schaefer Markus Chimani Sebastian Leipert Seok-Hee Hong

227 views • 4 slides
Balanced Schnyder woods for planar triangulations: an experimental study with applications to

Balanced Schnyder woods for planar triangulations: an experimental study with applications to

Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators v 2 sept. 18th, Graph Drawing 2019 Luca Castelli Aleardi v 1 v 0 Planar graphs are ubiquitous (from computational

292 views • 14 slides
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition Fabian Lipp

Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition Fabian Lipp

Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition Fabian Lipp Alexander Wolff Johannes Zink Julius-Maximilians-Universitt Wrzburg September 24, Graph Drawing 2015 Introduction Classical force-directed

625 views • 60 slides
Quality Ratios of Measures for Graph Drawing Styles Michael Hoffmann - Zurich Marc van

Quality Ratios of Measures for Graph Drawing Styles Michael Hoffmann - Zurich Marc van

Quality Ratios of Measures for Graph Drawing Styles Michael Hoffmann - Zurich Marc van Kreveld - Utrecht Vincent Kusters - Zurich Gnter Rote - Berlin V = {1,2,3,4,5} Graph Drawing E = { (1,2), (1,3), (1,4), (1,5), (2,3), (2,4), (3,4)

637 views • 38 slides
Open Problems Workshop on Graph Drawing and Graph Algorithms 2013 Department of Computer Science

Open Problems Workshop on Graph Drawing and Graph Algorithms 2013 Department of Computer Science

Open Problems Workshop on Graph Drawing and Graph Algorithms 2013 Department of Computer Science and Engineering Bangladesh University of Engineering and Technology Coin-graph Recognition Q. What are the graphs that come up by touching coins?

103 views • 7 slides
Stories from the Field 2019 Photo Contest Winner: Johanna Thalmann 2019 Photo Contest 2nd

Stories from the Field 2019 Photo Contest Winner: Johanna Thalmann 2019 Photo Contest 2nd

Stories from the Field 2019 Photo Contest Winner: Johanna Thalmann 2019 Photo Contest 2nd Runner: Victoria Van Mierlo Advancing research and learning with trusted guidance and tools High Risk and Common Incidents from the Field Select Alberta

399 views • 12 slides
Quality Ratios Workshop in CGI Graph Drawing Marc van Kreveld - Utrecht University

Quality Ratios Workshop in CGI Graph Drawing Marc van Kreveld - Utrecht University

Graduate Quality Ratios Workshop in CGI Graph Drawing Marc van Kreveld - Utrecht University Quality Ratios Largely based on: of Measures for Graph Drawing Styles Michael Hoffmann - Zurich Marc van Kreveld - Utrecht Vincent

969 views • 60 slides
Carving-width, tree-width and area-optimal planar graph drawing Therese Biedl University of

Carving-width, tree-width and area-optimal planar graph drawing Therese Biedl University of

Carving-width, tree-width and area-optimal planar graph drawing Therese Biedl University of Waterloo biedl@uwaterloo.ca May 5, 2014 Therese Biedl Carving-width, tree-width and graph drawing 1 / 19 Graph Drawing Given: A graph G = ( V , E

1.04k views • 70 slides
CTSRD CRASH-worthy Trustworthy Systems Research and Development The CHERI CPU RISC in the

CTSRD CRASH-worthy Trustworthy Systems Research and Development The CHERI CPU RISC in the

CTSRD CTSRD CRASH-worthy Trustworthy Systems Research and Development The CHERI CPU RISC in the age of risk David Chisnall University of Cambridge Approved for public release; distribution is unlimited. This research is sponsored by the

803 views • 41 slides
Analysis of Numerical Shock Instability and Cure by HLLC-FORCE Hybrid Scheme Li Yuan Institute of

Analysis of Numerical Shock Instability and Cure by HLLC-FORCE Hybrid Scheme Li Yuan Institute of

SGS on ANMCFMRP, May 21-27 2014, Beijing Analysis of Numerical Shock Instability and Cure by HLLC-FORCE Hybrid Scheme Li Yuan Institute of Computational Mathematics and Scientific/Engineering Computing, AMSS, Chinese Academy of Sciences Joint

614 views • 27 slides
Amenability and coarse embeddings of warped cones . Damian Sawicki Institute of Mathematics

Amenability and coarse embeddings of warped cones . Damian Sawicki Institute of Mathematics

. Amenability and coarse embeddings of warped cones . Damian Sawicki Institute of Mathematics Polish Academy of Sciences EPFL, 6 August 2015 . . . . . . Damian Sawicki Amenability and coarse embeddings of warped cones . Amenability

370 views • 10 slides
Amas de galaxies Etat gnral des ac2vits S.

Amas de galaxies Etat gnral des ac2vits S.

Amas de galaxies Etat gnral des ac2vits S. Maurogordato Laboratoire J.L. Lagrange, OCA, Nice On behalf of the Euclid SGS/OU-LE3 WPs

591 views • 12 slides
Schedulability Analysis and Software Synthesis for Graph-based Task Models with Resource Sharing

Schedulability Analysis and Software Synthesis for Graph-based Task Models with Resource Sharing

Schedulability Analysis and Software Synthesis for Graph-based Task Models with Resource Sharing Jakaria Abdullah , Gaoyang Dai, Morteza Mohaqeqi, Wang Yi Uppsala University April 13, 2018 Outline Problem Problem 1 Algorithm Evaluation

1.08k views • 48 slides
Manipulation 2 Overview, Concepts, Types Homework 2 out Project milestone 1 due right after

Manipulation 2 Overview, Concepts, Types Homework 2 out Project milestone 1 due right after

3/3/20 Bookkeeping Manipulation 2 Overview, Concepts, Types Homework 2 out Project milestone 1 due right after spring break Make sure you make arrangements with your group for spring break A little tiny bit of stern stuff: Do not

540 views • 6 slides
Introducing OpenWordnet-PT: a open Portuguese wordnet for reasoning Alexandre Rademaker 1 , 3

Introducing OpenWordnet-PT: a open Portuguese wordnet for reasoning Alexandre Rademaker 1 , 3

Introducing OpenWordnet-PT: a open Portuguese wordnet for reasoning Alexandre Rademaker 1 , 3 Valeria de Paiva 2 Fabricio Chalub 1 Livy Real 1 Claudia Freitas 4 1 IBM Research, Brazil 2 Nuance Communications, USA 3 FGV/EMAp, Brazil 4 PUC-Rio,

524 views • 23 slides
ClowdFlows Essentials Janez Kranjc, Nada Lavrac, Anze Vavpetic What is ClowdFlows A platform

ClowdFlows Essentials Janez Kranjc, Nada Lavrac, Anze Vavpetic What is ClowdFlows A platform

ClowdFlows Essentials Janez Kranjc, Nada Lavrac, Anze Vavpetic What is ClowdFlows A platform for: composition, execution, and sharing of interactive data mining workflows Most important features: A web based user interface

377 views • 34 slides

More recommend