For this assignment, you should create a module that involves processing meshes or triangulations. Follow the same instructions as before.
Incremental delaunay triangulation by edge flipping
Author: Mikola Lysenko
Computes a Delaunay triangulation for a collection of points
Author: Mikola Lysenko
Constructs a Voronoi diagram for a collection of points
Author: Mikola Lysenko
The half-edge data structure. This data structure provides efficient manipulation of the topological information associated with the objects in question (vertices, edges, faces).
Author: Daniel Melanz
- Half edge data structure
- Point location in planar triangulation by jump and walk
- Point location with independent set data structures
- Convex hull in 3D and higher (can be done using delaunay triangulation or by porting O'Rourke)