I followed the course Computational Geometry at DIKU in the beginning of the year. For the exam, I prepared a number of exam topic dispositions.
The dispositions cover the following topics:
- Polygon triangulation
- Range searching
- Point location
- Voronoi diagrams
- Delaunay triangulations
- Geometric data structures
- Robot motion planning and visibility graphs
The notes are primarily intended for other curious students at DIKU. If you wish to learn about the subjects, I can recommend the book Computational Geometry: Algorithms and Applications, which was used during the course.
Quines are a wonderful thing. A quine is a program, that when run produces its own code as output. Now, in most interpreted languages you can read your own code through means of I/O — I’d consider that cheating: We can do much better than that. We’ll do it without anything but a clever theoretical result. (And maybe a little bit of code to make it work in practice.)