Method set_point_inside

src/svgfill/src/svgfill.cpp:273–300

	}

	void set_point_inside(const Polygon_wh_2& inpoly, svgfill::polygon_2& outpoly)
	{
		/*
		std::cout << std::endl;
		for (auto& p : inpoly.outer_boundary()) {
			std::cout << " " << p;
		}
		std::cout << std::endl;
		*/
		// create Delaunay triangulation and return the centroid of the largest triangle.
		CGAL::Polygon_triangulation_decomposition_2<Kernel> decompositor;
		std::list<Polygon_2> decom_polies;
		decompositor(inpoly, std::back_inserter(decom_polies));
		decom_polies.sort([](const Polygon_2& a, const Polygon_2& b) {
			return a.area() > b.area();
		});
		if (!decom_polies.empty()) {
			const Polygon_2& largest = decom_polies.front();
			auto triangle = poly_to_triangle(largest);
			/*
			for (auto& p : decom_polies) {
				std::cout << "a " << CGAL::to_double(poly_to_triangle(largest).area()) << std::endl;
			}
			std::cout << "triangle area " << CGAL::to_double(triangle.area()) << std::endl;
			*/
			outpoly.point_inside = create_point(CGAL::centroid(triangle));
		}
	}

	Arrangement_2 arr;
	float total, i;