Implementing High-Performance Delaunay Triangulation In Java

The project is all about the design, documentation and implementation of a program to perform Delaunay triangulation. The program is written in Java and is focused on performance both with regard to run-time and memory usage. A goal for the program is to triangulate at least 10 million points within a reasonable amount of time. The program is designed for the development and testing of new sequential and parallel algorithms and data structures to be used when performing Delaunay triangulation