Slic3r::Geometry::VoronoiUtilsCgal Class Reference

#include </home/runner/work/OrcaSlicer/OrcaSlicer/src/libslic3r/Geometry/VoronoiUtilsCgal.hpp>

Public Member Functions
template<typename SegmentIterator>
boost::polygon::enable_if< typenameboost::polygon::gtl_if< typenameboost::polygon::is_segment_concept< typenameboost::polygon::geometry_concept< typenamestd::iterator_traits< SegmentIterator >::value_type >::type >::type >::type, bool >::type	is_voronoi_diagram_planar_angle (const VD &voronoi_diagram, const SegmentIterator segment_begin, const SegmentIterator segment_end)

Static Public Member Functions
static bool	is_voronoi_diagram_planar_intersection (const VoronoiDiagram &voronoi_diagram)
template<typename SegmentIterator>
static boost::polygon::enable_if< typenameboost::polygon::gtl_if< typenameboost::polygon::is_segment_concept< typenameboost::polygon::geometry_concept< typenamestd::iterator_traits< SegmentIterator >::value_type >::type >::type >::type, bool >::type	is_voronoi_diagram_planar_angle (const VoronoiDiagram &voronoi_diagram, SegmentIterator segment_begin, SegmentIterator segment_end)

Detailed Description

Member Function Documentation

is_voronoi_diagram_planar_angle() [1/2]

template<typename SegmentIterator>

boost::polygon::enable_if< typenameboost::polygon::gtl_if< typenameboost::polygon::is_segment_concept< typenameboost::polygon::geometry_concept< typenamestd::iterator_traits< SegmentIterator >::value_type >::type >::type >::type, bool >::type Slic3r::Geometry::VoronoiUtilsCgal::is_voronoi_diagram_planar_angle	(	const VD &	voronoi_diagram,
		const SegmentIterator	segment_begin,
		const SegmentIterator	segment_end )

{
    for (const VD::vertex_type &vertex : voronoi_diagram.vertices()) {
        std::vector<const VD::edge_type *> edges;
        const VD::edge_type               *edge = vertex.incident_edge();
 
        do {
            if (edge->is_finite() && edge->vertex0() != nullptr && edge->vertex1() != nullptr && VoronoiUtils::is_finite(*edge->vertex0()) && VoronoiUtils::is_finite(*edge->vertex1()))
                edges.emplace_back(edge);
 
            edge = edge->rot_next();
        } while (edge != vertex.incident_edge());
 
        // Checking for CCW make sense for three and more edges.
        if (edges.size() > 2) {
            for (auto edge_it = edges.begin() ; edge_it != edges.end(); ++edge_it) {
                const VD::edge_type *prev_edge = edge_it == edges.begin() ? edges.back() : *std::prev(edge_it);
                const VD::edge_type *curr_edge = *edge_it;
                const VD::edge_type *next_edge = std::next(edge_it) == edges.end() ? edges.front() : *std::next(edge_it);
 
                if (!check_if_three_edges_are_ccw(*prev_edge, *curr_edge, *next_edge, segment_begin, segment_end))
                    return false;
            }
        }
    }
 
    return true;
}

References Slic3r::Geometry::check_if_three_edges_are_ccw(), Slic3r::Geometry::VoronoiUtils::is_finite(), and Slic3r::Geometry::VoronoiDiagram::vertices().

Here is the call graph for this function:

is_voronoi_diagram_planar_angle() [2/2]

template<typename SegmentIterator>

template bool Slic3r::Geometry::VoronoiUtilsCgal::is_voronoi_diagram_planar_angle ( const VoronoiDiagram & voronoi_diagram, SegmentIterator segment_begin, SegmentIterator segment_end )

static

Referenced by Slic3r::Geometry::VoronoiDiagram::detect_known_issues().

Here is the caller graph for this function:

is_voronoi_diagram_planar_intersection()

bool Slic3r::Geometry::VoronoiUtilsCgal::is_voronoi_diagram_planar_intersection ( const VoronoiDiagram & voronoi_diagram )

static

{
    using CGAL_E_Point   = CGAL::Exact_predicates_exact_constructions_kernel::Point_2;
    using CGAL_E_Segment = CGAL::Arr_segment_traits_2<CGAL::Exact_predicates_exact_constructions_kernel>::Curve_2;
    auto to_cgal_point   = [](const VD::vertex_type &pt) -> CGAL_E_Point { return {pt.x(), pt.y()}; };
 
    assert(std::all_of(voronoi_diagram.edges().cbegin(), voronoi_diagram.edges().cend(),
                       [](const VD::edge_type &edge) { return edge.color() == 0; }));
 
    std::vector<CGAL_E_Segment> segments;
    segments.reserve(voronoi_diagram.num_edges());
 
    for (const VD::edge_type &edge : voronoi_diagram.edges()) {
        if (edge.color() != 0)
            continue;
 
        if (edge.is_finite() && edge.is_linear() && edge.vertex0() != nullptr && edge.vertex1() != nullptr &&
            VoronoiUtils::is_finite(*edge.vertex0()) && VoronoiUtils::is_finite(*edge.vertex1())) {
            segments.emplace_back(to_cgal_point(*edge.vertex0()), to_cgal_point(*edge.vertex1()));
            edge.color(1);
            assert(edge.twin() != nullptr);
            edge.twin()->color(1);
        }
    }
 
    for (const VD::edge_type &edge : voronoi_diagram.edges())
        edge.color(0);
 
    std::vector<CGAL_E_Point> intersections_pt;
    CGAL::compute_intersection_points(segments.begin(), segments.end(), std::back_inserter(intersections_pt));
    return intersections_pt.empty();
}

References Slic3r::Geometry::VoronoiDiagram::edges(), Slic3r::Geometry::VoronoiUtils::is_finite(), Slic3r::Geometry::VoronoiDiagram::num_edges(), and Slic3r::Geometry::to_cgal_point().

Referenced by Slic3r::Arachne::SkeletalTrapezoidation::constructFromPolygons().

Here is the call graph for this function:

Here is the caller graph for this function:

---

The documentation for this class was generated from the following files:

• /home/runner/work/OrcaSlicer/OrcaSlicer/src/libslic3r/Geometry/VoronoiUtilsCgal.hpp
• /home/runner/work/OrcaSlicer/OrcaSlicer/src/libslic3r/Geometry/VoronoiUtilsCgal.cpp