Dr. Thomas van Dijk

Lehrstuhl für Informatik I
Universität Würzburg
Am Hubland
D-97074 Würzburg
Raum: 01.002, Gebäude M4
Tel.: +49 (0) 931-31-89040
Fax: +49 (0) 931-31-825200
Email: thomas.van.dijk@uni-wuerzburg.de
Twitter: | @tvdmaps | GitHub: | tcvdijk |
Youtube: | ![]() |
Forschung
- Algorithmically-guided user interaction
- Algorithms for Geographic Information Systems
- Implementation; computational experiments
- Exact algorithms (exponential-time / parameterised ...)
Awards
- 2. Platz aus 15 ($300), ACM SIGSPATIAL Cup 2018. For “Wüpstream: efficient enumeration of upstream features (GIS cup),’’ with Tobias Greiner, Bas den Heijer, Nadja Henning, Felix Klesen, and Andre Löffler.
- Best Fast-forward Presentation at ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems 2018. For “Realtime linear cartograms and metro maps,” with Dieter Lutz.
- Shortlist Junges Kolleg (Bayerische Akademie der Wissenschaften), Jahrgang 2017.
- ACM Computing Review’s “Best of Computing” list of notable publications, 2016. For ”Matching Labels and Markers in Historical Maps: An Algorithm with
Interactive Postprocessing,” with Benedikt Budig and Alexander Wolff. - Best Paper award, theory track, at the International Conference on Graph Drawing and Network Visualization. For “Block Crossings in Storyline Visualizations.” with Martin Fink, Norbert Fischer, Fabian Lipp, Peter Markfelder, Alex Ravsky, Subhash Suri, Alexander Wolff.
- Best Poster Award Runners up at ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems 2015 (ACMGIS) for "There and Back Again: Using Fréchet-Distance Diagrams to Find Trajectory Turning Points." with Lukas Beckmann, Benedikt Budig and Johannes Schamel.
- Best Applied Paper Award at Discovery Science 2015 for "Active Learning for Classifying Template Matches in Historical Maps." [PDF] [
Video] with Benedikt Budig.
- Best student contribution at Schematic Mapping 2014 for "An automated method for circular-arc metro maps." [PDF] with Arthur van Goethem and Wouter Meulemans.
- Best paper at MapInteract 2014 for "Matching Labels and Markers in Historical Maps: an Algorithm with Interactive Postprocessing." with Benedikt Budig and Alexander Wolff.
- Best Fast-forward Presentation and Runner-up Best Poster at ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems 2013 (ACMGIS) for "Accentuating Focus Maps via Partial Schematization." [PDF] with Arthur van Goethem, Jan-Henrik Haunert, Wouter Meulemans and Bettina Speckmann.
- Best Short Presentation at Web and Wireless GIS 2013 (W2GIS) for "A Probabilistic Model for Road Selection in Mobile Maps" [PPT] with Jan-Henrik Haunert.
Betreuung
Doktorarbeit
- Benedikt Budig. Extracting Spatial Information from Historical Maps: Algorithms and Interaction [Link beim Verlag] [digitale Version]
Masterarbeit
- Maximilian Schmitt: Tourenplanung unter Berücksichtigung heterogener Metriken.
- Andre Löffler: Snapping Graph Drawings to the Grid
- Benedikt Budig: Algorithmische Analyse historischer Landkarten
- Dieter Lutz: Realtime Linear Cartograms using Least-Squares Optimisation
Bachelorarbeit
- Fabian Sieper: Zuweisen von Kantenrichtungen in Metronetzen
- Julian Walter: Rotation and scale invariant template matching for historical maps
- Peter Markfelder: Optimale Zeichnungen von Storylines mit Blockkreuzungen
- Martin Becker: String Matching von historischen Toponymen
- Fabian Feitsch: From Many User-Contributed Polygons to One Polygon Consensus
- Lukas Beckmann: Analyse von Umkehrpunkten auf GPS-Trajektorien unter Verwendung der Fréchet-Distanz
Lehrveranstaltungen
| |
SS20 | Vorlesung Algorithmen für geographische Informationssysteme |
Seminar Algorithmen für Programmierwettbewerbe | |
WS19 | Vorlesung Algorithmische Geometrie |
SS19 | Vorlesung Algorithmen für geographische Informationssysteme |
Seminar Algorithmen für Programmierwettbewerbe | |
SS18 | Vorlesung Algorithmen für geographische Informationssysteme |
Seminar Visualisierung von Graphen | |
WS17 | Vorlesung Exakte Algorithmen (vollständige Überarbeitung des Inhalts) |
SS17 | Vorlesung Algorithmen für geographische Informationssysteme |
Seminar Algorithmen für Programmierwettbewerbe (inkl. Konzeption) | |
WS16 | Seminar Algorithmen zur Extraktion von Daten aus alten Landkarten |
SS16 | Vorlesung Algorithmen für geographische Informationssysteme |
SS15 | Vorlesung Algorithmen für geographische Informationssysteme |
WS14 | Seminar Visualisierung von geografischen Netzwerken |
SS14 | Vorlesung Algorithmen für geographische Informationssysteme |
WS13 | Übungen zu Approximationsalgorithmen |
WS12 | Übungen zu Algorithmen für geografische Informationssysteme |
SS12 | Übungen zu Exakte Algorithmen |
Veröffentlichungen
- [ 2020 ]
- [ 2019 ]
- [ 2018 ]
- [ 2017 ]
- [ 2016 ]
- [ 2015 ]
- [ 2014 ]
- [ 2013 ]
- [ 2011 ]
- [ 2010 ]
- [ 2009 ]
- [ 2008 ]
- [ 2007 ]
2020[ to top ]
-
Bundled Crossings Revisited in Journal of Graph Algorithms \& Applications (2020). 35 pages.
2019[ to top ]
-
Practical Topologically Safe Rounding of Geographic Networks in Proceedings of the 27th {ACM} {SIGSPATIAL} International Conference on Advances in Geographic Information Systems, F. B. Kashani, G. Trajcevski, R. H. Güting, L. Kulik, S. D. Newsam (eds.) (2019). 239–248.
-
Algorithmically-Assisted Metro Map Design in Proc. 2nd Schematic Mapping Workshop (SMW 2019), M. Roberts, M. Nöllenburg (eds.) (2019).
- [ BibTeX ]
-
Bundled Crossings Revisited. in 35th European Workshop on Computational Geometry (EuroCG 19) (2019).
2018[ to top ]
-
Stabbing Rectangles by Line Segments – How Decomposition Reduces the Shallow-Cell Complexity in Proc. 29th Ann. Int. Symp. Algorithms Comput. (ISAAC’18), LIPIcs (2018). (Vol. 123) 61:1–61:13.
-
Aktives Lernen f{\"u}r Informationsextraktion aus historischen Karten in Flächennutzungsmonitoring X, IOER, G. Meinel, U. Schumacher, M. Behnisch, T. Kr{\"u}ger (eds.) (2018). (Vol. 76) 181–186.
-
Realtime linear cartograms and metro maps. in SIGSPATIAL/GIS, F. Banaei-Kashani, E. G. Hoel, R. H. Güting, R. Tamassia, L. Xiong (eds.) (2018). 488–491.
-
Wüpstream: efficient enumeration of upstream features (GIS cup). in SIGSPATIAL/GIS, F. Banaei-Kashani, E. G. Hoel, R. H. Güting, R. Tamassia, L. Xiong (eds.) (2018). 626–629.
-
Putting User Reputation on the Map: Unsupervised Quality Control for Crowdsourced Historical Data in 2nd ACM SIGSPATIAL Workshop on Geospatial Humanities (2018).
2017[ to top ]
-
Journeys of the Past: A Hidden Markov Approach to Georeferencing Historical Itineraries. in GIR’17 Proceedings of the 11th Workshop on Geographic Information Retrieval, C. B. Jones, R. S. Purves (eds.) (2017). 7:1–7:10.
-
Algorithmically-Guided User Interaction in SIGSPATIAL’17 Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, E. Hoel, S. D. Newsam, S. Ravada, R. Tamassia, G. Trajcevski (eds.) (2017). 11:1–11:4.
-
Block Crossings in Storyline Visualizations in Journal of Graph Algorithms \& Applications, (Y. Hu; M. Nöllenburg, eds.) (2017). 21(5) 873–913.
-
Computing Storyline Visualizations with Few Block Crossings. in Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization, (F. Frati; K.-L. Ma, eds.) (2017).
2016[ to top ]
-
Location-dependent generalization of road networks based on equivalent destinations. in Comput. Graph. Forum (2016). 35(3) 451–460.
-
Block Crossings in Storyline Visualizations in Proc. 24nd Int. Sympos. Graph Drawing (2016).
-
Snapping Graph Drawings to the Grid Optimally in Proc. 24nd Int. Sympos. Graph Drawing (2016).
-
Matching Labels and Markers in Historical Maps: an Algorithm with Interactive Postprocessing in Transactions on Spatial Algorithms and Systems (2016).
-
Glyph Miner: A System for Efficiently Extracting Glyphs from Early Prints in the Context of OCR. in Proceedings of the 16th ACM/IEEE-CS on Joint Conference on Digital Libraries, JCDL ’16, N. R. Adam, L. (Boots) Cassel, Y. Yesha, R. Furuta, M. C. Weigle (eds.) (2016). 31–34.
2015[ to top ]
-
There and Back Again: Using Fréchet-Distance Diagrams to Find Trajectory Turning Points in Proceedings of the 23rd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL 2015) (2015). 238–241.
-
Active Learning for Classifying Template Matches in Historical Maps in Discovery Science, Lecture Notes in Computer Science, N. Japkowicz, S. Matwin (eds.) (2015). (Vol. 9356) 33–47.
2014[ to top ]
-
Map Schematization with Circular Arcs in Geographic Information Science, (M. Duckham; E. Pebesma; K. Stewart; A. Frank, eds.) (2014). 8728 1–17.
-
Inclusion/Exclusion Meets Measure and Conquer in Algorithmica (2014). 69(3) 685–740.
-
An Automated Method for Circular-Arc Metro Maps in Schematic Mapping (2014).
- [ BibTeX ]
-
Improved Approximation Algorithms for Box Contact Representations in Proc. 22th Annual European Symposium on Algorithms (ESA’14) (2014). 87–99.
-
Matching Labels and Markers in Historical Maps: an Algorithm with Interactive Postprocessing in Proceedings of the 2nd ACM SIGSPATIAL International Workshop on MapInteraction (2014).
-
How to Eat a Graph: Computing Selection Sequences for the Continuous Generalization of Road Networks in Proceedings of the 22st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (2014). (Vol. 28) 243–252.
-
Interactive focus maps using least-squares optimization in International Journal of Geographical Information Science (2014). 28(10) 2052–2075.
2013[ to top ]
-
Accentuating Focus Maps via Partial Schematization in Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL’13 (2013). 428–431.
-
Road Segment Selection with Strokes and Stability in Proceedings of the 1st ACM SIGSPATIAL International Workshop on MapInteraction, MapInteract ’13 (2013). 72–77.
-
A Probabilistic Model for Road Selection in Mobile Maps in Web and Wireless Geographical Information Systems, S. H. Liang, X. Wang, C. Claramunt (eds.) (2013). (Vol. 7820) 214–222.
2011[ to top ]
-
Optimizing Wireless Sensor Network Flow by Column Generation in Conference of the European Chapter on Combinatorial Optimization (2011).
- [ BibTeX ]
2010[ to top ]
-
A Cubic Kernel for Feedback Vertex Set and Loop Cutset in Theory of Computing Systems (2010). 46(3) 566–597.
2009[ to top ]
-
Inclusion/Exclusion Meets Measure and Conquer in Algorithms - ESA 2009, A. Fiat, P. Sanders (eds.) (2009). (Vol. 5757) 554–565.
2008[ to top ]
-
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint in Algorithm Theory - SWAT 2008, J. Gudmundsson (ed.) (2008). (Vol. 5124) 102–113.
2007[ to top ]
-
Kernelization for Loop Cutset (M. D. Edwin de Jong, ed.) (2007).