Algorithms for Geovisualisation

Publications

Journal articles

  1. Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, and Ignaz Rutter.
    On d-regular Schematization of Embedded Paths.
    Computational Geometry: Theory and Applications, 47(3A):381-406, 2014.
    [ html ][ pdf ]
  2. Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, and Dorothea Wagner.
    Generalizing Geometric Graphs.
    Journal of Graph Algorithms and Applications, 18(1):35-76, 2014.
  3. Martin Nöllenburg, and Alexander Wolff.
    Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming.
    IEEE Transactions on Visualization and Computer Graphics, 17(5):626-641, May 2011.
    [ html ][ pdf ]
  4. Michael Bekos, Michael Kaufmann, Martin Nöllenburg, and Antonios Symvonis.
    Boundary Labeling with Octilinear Leaders.
    Algorithmica, 57(3):436-461, 2010.
    Special issue of SWAT 2008
    [ html ][ pdf ]
  5. Ken Been, Martin Nöllenburg, Sheung-Hung Poon, and Alexander Wolff.
    Optimizing Active Ranges for Consistent Dynamic Map Labeling.
    Computational Geometry: Theory and Applications, 43(3):312-328, 2010.
    Special issue of SoCG 2008
    [ html ][ pdf ]
  6. Marc Benkert, Herman Haverkort, Moritz Kroll, and Martin Nöllenburg.
    Algorithms for Multi-Criteria Boundary Labeling.
    Journal of Graph Algorithms and Applications, 13(3):289-317, 2009.
    Special issue of GD 2007
    [ html ][ pdf ]

Conference articles

  1. Andreas Gemsa, D.T. Lee, Chih-Hung Liu, and Dorothea Wagner.
    Higher Order City Voronoi Diagrams .
    In: Proceedings of the 13th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'12) volume 7357 of Lecture Notes in Computer Science, pages 59-70. Springer, July 2012.
  2. Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, and Dorothea Wagner.
    Generalizing Geometric Graphs.
    In: Proceedings of the 19th International Symposium on Graph Drawing (GD'11), Lecture Notes in Computer Science, pages 179-190. Springer, 2012.
    [ html ]
  3. Andreas Gemsa, D.T. Lee, Chih-Hung Liu, and Dorothea Wagner.
    Higher Order City Voronoi Diagrams.
    In: Proceedings of the 28th European Workshop on Computational Geometry (EuroCG'12), pages 245-248. 2012.
  4. Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, and Rodrigo I. Silveira.
    Adjacency-Preserving Spatial Treemaps.
    In: Algorithms and Data Structures, 12th International Symposium (WADS'11) volume 6844 of Lecture Notes in Computer Science, pages 159-170. Springer, 2011.
    [ html ][ pdf ]
  5. Andreas Gemsa, Jan-Henrik Haunert, and Martin Nöllenburg.
    Boundary-Labeling Algorithms for Panorama Images.
    In: Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 289-298. ACM Press, 2011.
    [ html ][ pdf ]
  6. Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, and Ignaz Rutter.
    Automatic Generation of Route Sketches.
    In: Proceedings of the 18th International Symposium on Graph Drawing (GD'10) volume 6502 of Lecture Notes in Computer Science, pages 391-392. Springer, 2011.
    [ html ][ pdf ]
  7. Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, and Ignaz Rutter.
    On d-regular Schematization of Embedded Paths.
    In: Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'11) volume 6543 of Lecture Notes in Computer Science, pages 260-271. Springer, January 2011.
    [ html ][ pdf ]
  8. Andreas Gemsa, Martin Nöllenburg, and Ignaz Rutter.
    Consistent Labeling of Rotating Maps.
    In: Algorithms and Data Structures, 12th International Symposium (WADS'11) volume 6844 of Lecture Notes in Computer Science, pages 451-462. Springer, 2011.
    [ html ][ pdf ]
  9. Andreas Gemsa, Martin Nöllenburg, and Ignaz Rutter.
    Sliding Labels for Dynamic Point Labeling.
    In: Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG '11), pages 205-210. University of Toronto Press, 2011.
    [ pdf ]
  10. Martin Nöllenburg, Valentin Polishchuk, and Mikko Sysikaski.
    Dynamic One-Sided Boundary Labeling.
    In: Proceedings of the 18th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 310-319. ACM Press, November 2010.
    [ html ][ pdf ]
  11. Daniel Delling, Andreas Gemsa, Martin Nöllenburg, and Thomas Pajor.
    Path Schematization for Route Sketches.
    In: Proceedings of the 12th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'10) volume 6139 of Lecture Notes in Computer Science, pages 285-296. Springer, June 2010.
    [ html ][ pdf ]
  12. Maarten Löffler, and Martin Nöllenburg.
    Shooting Bricks with Orthogonal Laser Beams: A First Step towards Internal/External Map Labeling .
    In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG '10), pages 203-206. University of Manitoba, 2010.
    [ html ][ pdf ]
  13. Martin Nöllenburg.
    An Improved Algorithm for the Metro-Line Crossing Minimization Problem.
    In: Proceedings of the 17th International Symposium on Graph Drawing (GD'09) volume 5849 of Lecture Notes in Computer Science, pages 381-392. Springer, 2010.
    [ html ][ pdf ]
  14. Marc Benkert, Herman Haverkort, Moritz Kroll, and Martin Nöllenburg.
    Algorithms for Multi-Criteria One-Sided Boundary Labeling.
    In: Proceedings of the 15th International Symposium on Graph Drawing (GD'07) volume 4875 of Lecture Notes in Computer Science, pages 243-254. Springer, January 2008.
    [ html ][ pdf ]
  15. Michael Bekos, Michael Kaufmann, Martin Nöllenburg, and Antonios Symvonis.
    Boundary Labeling with Octilinear Leaders.
    In: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT'08) volume 5124 of Lecture Notes in Computer Science, pages 234-245. Springer, 2008.
    [ html ][ pdf ]
  16. Martin Nöllenburg, and Alexander Wolff.
    A Mixed-Integer Program for Drawing High-Quality Metro Maps.
    In: Proceedings of the 13th International Symposium on Graph Drawing (GD'05) volume 3843 of Lecture Notes in Computer Science, pages 321-333. Springer, January 2006.
    [ html ][ pdf ]

Dissertation

  1. Martin Nöllenburg.
    Network Visualization: Algorithms, Applications, and Complexity.
    PhD thesis, Fakultät für Informatik, Universität Karlsruhe (TH), February 2009.
    [ html ][ pdf ]

Master's Thesis

  1. Schematized Visualization of Shortest Paths in Road Networks.
    Andreas Gemsa.
    Master's thesis, Universität Karlsruhe (TH), Fakultät für Informatik, November 2009.
    [ pdf ]

Technical reports

  1. Edith Brunel, Andreas Gemsa, Marcus Krug, Ignaz Rutter, and Dorothea Wagner.
    Generalizing Geometric Graphs.
    Technical Report 2011-27, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2011.
    [ html ]
  2. Daniel Delling, Andreas Gemsa, Martin Nöllenburg, and Thomas Pajor.
    Path Schematization for Route Sketches.
    Technical Report 2010-02, Faculty of Informatics, Karlsruhe Institute of Technology, 2010.
    [ html ][ pdf ]
  3. Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, and Ignaz Rutter.
    On d-regular Schematization of Embedded Paths.
    Technical Report 2010-21, Faculty of Informatics, Karlsruhe Institute of Technology, 2010.
    [ html ][ pdf ]