User Tools

Site Tools


start

I am a scientist in the institute of computer science in the University of Bonn, where I have an office in the theory group.

I specialize in algorithms (procedures for doing computations) and data structures (how to organize data so that algorithms can process them efficiently). Usually, I focus on algorithms that process geometric data or geometric networks, such as found in geographic information systems—this also leads me to study mathematical properties of tessellations and space-filling curves. Sometimes the goal of my algorithm design work is that a computer constructs a representation of the data, efficiently and correctly, that is optimized for efficient interpretation by humans.

On this website, you will find information about the courses I teach, the graduation projects I supervise, the research I do, some academic matters I care about, and contact information. There is also a short biography.

Teaching material

Current and recurrent teaching activities

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.

Research

Software

  • 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.

Selected publications

Publications by topic

Academic matters

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.

Internships

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.

Contact information

Mail Herman Haverkort
Universität Bonn
Institut für Informatik Abt. V
Friedrich-Hirzebruch-Allee 5
53115 Bonn
Germany
Office 2.067
E-mail haverkort@uni-bonn.de
Phone +49 228 73 69 686
Dept. website http://tcs.cs.uni-bonn.de/

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.

start.txt · Last modified: 2022/08/27 09:49 by administrator