Artist Talk with Tamara Mchedlidze

In this lecture we will discuss contact representations of graphs, the representation where each vertex is depicted by a polygon and each edge by a contact of two polygons. 

We will outline an efficient algorithm to construct such representations for a special family of planar graphs. From the application perspective, we will see how contact representations enhance the readability of a given graph clustering on the example of »Open Codes« exhibit »OpinionMap: What Should One Eat?« and discuss the heuristic algorithm behind the exhibit.