Algorithms Group at Eindhoven University of Technology
November 29, 2015
I recently stumbled across the webpage for the (spatial/geometric/cartograhic) Algorithms Group at Technische Universiteit Eindhoven (Eindhoven University of Technology). I highly recommend browsing through some of the manuscripts included on Herman Haverkort’s (and students’) projects page.
In particular, I found one entitled Embedding cues about travel time in schematic maps. This is an interesting paper on schematic public transport maps, where it is first established that although excellent at allowing users to avoid unnecessary transfers, schematic maps of public transport pay the price of preventing people from determining how long a particular trips are, in both absolute and relative terms.
Haverkort presents a range of ideas for getting the best of both worlds, leading to a portfolio of intriguing ideas about hybridised schematic maps with travel time. I’ve included three of them here, and really encourage you to read the full paper.
I think it’d be a brilliant challenge to employ some of these ideas for a local network. There are also some interesting papers on automated graph drawing on the TUE webpage; if you’re anything like me, while you can appreciate the necessity and beauty of a one-off piece of cartography, the true Holy Grail is in abstracting and automating the procedure, giving space for updating source information or changing the extent of your geographic focus with minimal to no additional work.
There are also a bunch of PhD theses that might make some good holiday reading… for uh, weird people like me.
Do you have any other interesting theses or manuscripts to read over the summer? Having completed mine in March this year, I feel I’m in a good space to really appreciate the hard work of others in producing one, so I’m looking to read a few.
All images © Herman Haverkort, 2014