Herman Haverkort

December 2022: Coming up: a special issue of the Cartographic Journal about schematic maps! The scope includes algorithms for automatic layout of schematic maps, as well as the use of schematic maps beyond transit domains and historical, cultural, and psychological aspects. Brief abstracts (150 words) due 13 January 2023, full papers 9 April 2023. Check out the call for papers!

December 2022: I included some descriptions of lesser-known plane-filling curves under bycatch on the space-filling curve page.

• Additional material for readers of our text book Algorithmische Geometrie: Grundlagen, Methoden, Anwendungen (in German)
• Some advice on how to give a typical talk or lecture in an algorithms seminar.

• BA-INF051 Project group Computational Geometry (in German, every semester)
• BA-INF114 Grundlagen der algorithmischen Geometrie (Computational Geometry, in German, currently running)
• MA-INF1203 Discrete and Computational Geometry (in English, next taught in autumn 2023)
• MA-INF1304 Seminar Computational Geometry (in English, next taught: not before autumn 2023)
• MA-INF1315 Lab Computational Geometry (in English, every semester)
• Bachelor's and Master's graduation projects (in German or in English)

Individual projects: If you are interested in a topic that is related to my interests and that is not sufficiently covered by regular lectures, I may be able to coach you in studying your topic as a project in one of our project groups, seminars or labs (BA-INF051 and MA-INF1304, 1307, 1309, and 1315). You are welcome to contact me to discuss the possibilities. To get a feel for the type of topics I tend to study with my students, you may also check out my page on graduation projects.

Recognition of courses completed elsewhere: Courses that you have completed elsewhere could contribute, depending on their contents, to fulfilling the requirements for your degree in Computer Science or Cybersecurity from Bonn. To request that such courses are taken into account, you need to submit a request to the exam committee. In most cases I will then contact you to discuss the possibilities and/or ask for more information before the committee takes a decision. Of course you can also contact me for advice in advance.

• Vorosketch: draws small Voronoi diagrams for many different distance measures.
• AGB-QEDS: a C++ implementation of a quad-edge data structure for connected planar graphs
• AGB-DTVD: a C++ implementation of a randomised incremental construction algorithm and a divide-and-conquer algorithm for Voronoi diagrams and Delaunay triangulations for demonstration purposes.
• Pftrail: generates three-dimensional landscape models of plane-filling curves.
• Hilbex: generates and analyses three-dimensional Hilbert curves.

• Unsolved puzzles: a selection of combinatorial and/or algorithmic problems that, so far, remained unsolved in my publications
• The limit of Lp Voronoi diagrams as p → 0 is the bounding-box-area Voronoi diagram (2022), which is why we propose to define the geometric L₀ distance between two points as the product of the distances along each coordinate axis;
• Metaphorical metro maps: design challenges (2022)
• Plane-filling trails: unbiased visualisations of plane-filling curves (2020): illustrating the locality-preserving properties of plane-filling curves by picturing them as imaginary mountain landscapes or building complexes;
• Sixteen space-filling curves and traversals for d-dimensional cubes and simplices (2017)
• The sound of space-filling curves (2017)
• Terrain modeling for the geosciences (2014)
• Embedding cues about travel time in schematic maps (2014)
• Drawing metro maps using Bézier curves (2013)
• An edge quadtree for external memory (2013)
• Four-dimensional Hilbert curves for R-trees (2011) (also includes experiments with the Priority R-tree)
• Locality and bounding-box quality of two-dimensional space-filling curves (2010)

• Recursive tilings and space-filling curves: theory; applications; representations in writing, figures, or sound
• Automated cartography
• Combinatorics of distances (Voronoi diagrams, search algorithms, spanners)
• Algorithms for geographic elevation models (hydrological modelling, visibility computations)
• I/O-efficient graph algorithms
• Geometric data structures for sets of two- or higher-dimensional objects

I believe that the fruits of publicly funded research (such as my own) should be available to the public. However, commercial publishers of scientific journals charge prohibitively high fees. Therefore I prefer to publish in and review for non-profit journals whenever possible. I recommend submitting your best papers on computational geometry to the free, open-access Journal of Computational Geometry.

Negotiations with the commercial publisher Elsevier about its fees have been particularly difficult, resulting in many German scientists losing access to Elsevier journals. For this reason, I now avoid publishing in Elsevier journals, and I avoid reviewing papers submitted to those journals.

If you are a Bachelor or Master student looking for a graduation project, you may be interested in seeing what kind of projects I tend to supervise. You are welcome to make an appointment to discuss what kind of project you would like to do.

If you are a student looking for an internship in the summer vacation: sorry, I cannot accept any applications for summer internships.

If you would like to meet me in the office, please make an appointment by e-mail to make sure that I am there for you. I am usually in the office in the morning.