Boost. Триангуляция произвольного набора точек

#include <boost/polygon/voronoi.hpp>
#include <iostream>
 
class Point {
public:
     Point(double x1 = 0, double y1 = 0, double z1 = 0) : x(x1), y(y1), z(z1) {}
     Point() : x(0), y(0), z(0) {}
     double x;
     double y;
     double z;
};
 
namespace boost {
namespace polygon {
 
template <>
struct geometry_concept<Point> {
  typedef point_concept type;
};
 
template <>
struct point_traits<Point> {
  typedef double coordinate_type;
 
  static inline coordinate_type get(
      const Point& point, orientation_2d orient) {
    return (orient == HORIZONTAL) ? point.x : point.y;
  }
};
}
}
//typedef boost::polygon::point_data<double> Point;
 
int main()
{
    std::vector<Point> vertices;
    vertices.push_back(Point(0.5,0.5));
    vertices.push_back(Point(0,0));
    vertices.push_back(Point(0,1));
    vertices.push_back(Point(1,1));
    vertices.push_back(Point(1,0));
 
    // add your input vertices
 
    boost::polygon::voronoi_diagram<double> vd;
    boost::polygon::construct_voronoi(vertices.begin(), vertices.end(), &vd);
 
    for (const auto& vertex: vd.vertices()) {
        std::vector<Point> triangle;
        auto edge = vertex.incident_edge();
        do {
            auto cell = edge->cell();
            //assert(cell->contains_point());
 
            triangle.push_back(vertices[cell->source_index()]);
            if (triangle.size() == 3) {
                // process output triangles
                //std::cout << "Got triangle:" << triangle << std::endl;
                std::cout << "1:" << triangle[0].x << " " <<  triangle[0].y << " " << triangle[0].z << std::endl;
                std::cout << "2:" << triangle[1].x << " " <<  triangle[1].y << " " << triangle[1].z << std::endl;
                std::cout << "3:" << triangle[2].x << " " <<  triangle[2].y << " " << triangle[2].z << std::endl;
                triangle.erase(triangle.begin() + 1);
                std::cout << std::endl;
            }
 
            edge = edge->rot_next();
        } while (edge != vertex.incident_edge());
    }
    return 0;
}