Image 01 Image 02

Posted on 18th August 2014 by Sebastian

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.

Download PDF here

The dispositions cover the following topics:

  1. Polygon triangulation
  2. Range searching
  3. Point location
  4. Voronoi diagrams
  5. Delaunay triangulations
  6. Geometric data structures
  7. 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.

Posted on 8th January 2012 by Sebastian

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