FArrangement2d::AttemptTriangulate

Attempts to triangulates the arrangement with a constrained delaunay triangulation

Not robust; generates invalid triangulations and fails to insert edges sometimes, even if the arrangement has no self-intersections But should always do something that at least covers the point set, if the point set is not degenerate TODO: Make a robust triangulation algo Triangles: Output triangles (as indices into Graph vertices) SkippedEdges: Output indices of edges that the algorithm failed to insert BoundaryEdgeGroupID: ID of edges corresponding to a boundary; if we have a closed loop of these boundary edges on output triangulation, will discard triangles outside this return: false if triangulation algo knows it failed (

triangulation may still be invalid when function returns true, as function is not robust)