# Graduation Talks

## title

*Spatially Constrained Network Visualization*

## speaker

## date & place

Wednesday, 15.05.2013, 15:15 h

Room G 309

## abstract

We deal with visualization of spatially constrained
networks. While graph drawing uses graphs as a
starting point, cartography uses a spatial map as
basis for visual analysis end exploration.
There are dierent types of spatial constraints. A
proximity constraint is given by hierarchy on top of
a graph structure. In the context of geographic net-
works, e.g. cities, the hierarchy could represent the
inclusion of cities into states, countries, and conti-
nents. Other types of spatial constraints, e.g., as
a result of a mental map or geography can be: co-
ordinate, regional, shape, adjacency, separation or
obstacle constraints.
As a start we consider the following spatial con-
straints:
proximity constraints: Hierarchy denes
proximity on top of a graph.
coordinate constraints: Reference map
with coordinates is considered as soft or hard
constraint.
A major challenge is to nd layouts that display
the combinatorial structure of the network while
preserving its spatial constraints, which may or may
not be linked to the structure.