Function join_segment_runs

src/svgfill/src/arrange_polygons.cpp:1545–1582

}

Graph2D<K> join_segment_runs(
    DebugWriter& debug,
    const std::map<Point_2, std::vector<Point_2>>& line_graph,
    const std::map<Point_2, double>& midpoint_to_edge_length)
{
    auto graph = make_center_line_graph_data(line_graph, midpoint_to_edge_length);
    auto runs = runs_from_graph(graph);
    runs.erase(std::remove_if(runs.begin(), runs.end(), [](const LineRun& run) {
        return run.vertex_count <= 5;
    }), runs.end());

    std::vector<Polygon_2> run_polygons;
    for (auto& r : runs) {
        auto ps = rectangle_corners(r.start, r.end, r.avg_width);
        std::array<Point_2, 4> exact_corners;
        std::transform(ps.begin(), ps.end(), exact_corners.begin(), [](const DPoint& p) {
            return to_exact_point(p);
        });
        run_polygons.emplace_back(exact_corners.begin(), exact_corners.end());
    }
    debug.write_polygons(run_polygons, "initial_runs");
    run_polygons.clear();

    auto boxes = merge_intersecting_parallel_boxes_iterative(runs);

    for (auto& r : boxes) {
        auto ps = rectangle_corners(r.start, r.end, r.avg_width);
        std::array<Point_2, 4> exact_corners;
        std::transform(ps.begin(), ps.end(), exact_corners.begin(), [](const DPoint& p) {
            return to_exact_point(p);
        });
        run_polygons.emplace_back(exact_corners.begin(), exact_corners.end());
    }
    debug.write_polygons(run_polygons, "merged_boxes");

    auto snapped_graph = snap_points_to_box_axes(graph, boxes);
    return Graph2D<K>(snapped_graph);
}

std::set<Triangle<K>> find_triangles(const std::map<Point_2, std::vector<Point_2>>& line_graph) {
    // Find triangles in this network often occuring at junctions in the corridor mesh