#include "convex_partition.h"

//
// given a polygon and a list of triangulation diagonals
// output a list of convex polygons
//
void HertelMehlhorn(c_polygon& input_poly, vector<diagonal>& diagonals, list<c_polygon>& output )
{
	// step 1. remove inessential diagonals one by one until no diagonal can be removed, i.e. all diagonals are essential

	// Extra credit: Come up with a strategy that allow you to redunce the number of convex components 

	// step 2. setup c_polygon for each convex component using the essential diagonals
}
