Computational Geometry

Course Project -Voronoi diagram and Delaunay Triangulations

In this project we would implement both Voronoi diagram and Delaunay Triangulations. The principal goal of the project is to get an intuitive understanding of how these algorithms work and how Voronoi diagrams and Delaunay Triangulations look.

Our implementation is based on the explanation given in the book. More specifically, given n points on a 2−d plane, we are to compute their Voronoi diagrams and Delaunay Triangulations on the plane. We would also facilitate visualization of the algorithms by creating a user friendly interface. Users would be allowed to add new sites, delete or modify existing sites and get the corresponding changes on the screen simultaneously.

Report (download)

Demo video (download)

Program package (download)