Slic3r::ClosestPointInRadiusLookup< ValueType, PointAccessor > Class Template Reference

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

Collaboration diagram for Slic3r::ClosestPointInRadiusLookup< ValueType, PointAccessor >:

Public Member Functions
	ClosestPointInRadiusLookup (coord_t search_radius, PointAccessor point_accessor=PointAccessor())
void	insert (const ValueType &value)
void	insert (ValueType &&value)
bool	erase (const ValueType &value)
std::pair< const ValueType *, double >	find (const Vec2crd &pt)
std::vector< std::pair< const ValueType *, double > >	find_all (const Vec2crd &pt)

Private Types
using	map_type = typename std::unordered_multimap<Vec2crd, ValueType, PointHash>

Private Attributes
PointAccessor	m_point_accessor
map_type	m_map
coord_t	m_search_radius
coord_t	m_grid_resolution
coord_t	m_grid_log2

Detailed Description

template<typename ValueType, typename PointAccessor>
class Slic3r::ClosestPointInRadiusLookup< ValueType, PointAccessor >

Member Typedef Documentation

map_type

template<typename ValueType, typename PointAccessor>

using Slic3r::ClosestPointInRadiusLookup< ValueType, PointAccessor >::map_type = typename std::unordered_multimap<Vec2crd, ValueType, PointHash>

private

Constructor & Destructor Documentation

ClosestPointInRadiusLookup()

template<typename ValueType, typename PointAccessor>

Slic3r::ClosestPointInRadiusLookup< ValueType, PointAccessor >::ClosestPointInRadiusLookup ( coord_t search_radius, PointAccessor point_accessor = PointAccessor() )

inline

                                                                                                      : 
    m_search_radius(search_radius), m_point_accessor(point_accessor), m_grid_log2(0)
    {
        // Resolution of a grid, twice the search radius + some epsilon.
    coord_t gridres = 2 * m_search_radius + 4;
        m_grid_resolution = gridres;
        assert(m_grid_resolution > 0);
        assert(m_grid_resolution < (coord_t(1) << 30));
    // Compute m_grid_log2 = log2(m_grid_resolution)
    if (m_grid_resolution > 32767) {
      m_grid_resolution >>= 16;
      m_grid_log2 += 16;
    }
    if (m_grid_resolution > 127) {
      m_grid_resolution >>= 8;
      m_grid_log2 += 8;
    }
    if (m_grid_resolution > 7) {
      m_grid_resolution >>= 4;
      m_grid_log2 += 4;
    }
    if (m_grid_resolution > 1) {
      m_grid_resolution >>= 2;
      m_grid_log2 += 2;
    }
    if (m_grid_resolution > 0)
      ++ m_grid_log2;
    m_grid_resolution = 1 << m_grid_log2;
    assert(m_grid_resolution >= gridres);
    assert(gridres >= m_grid_resolution / 2);
    }

References m_grid_log2, m_grid_resolution, m_point_accessor, and m_search_radius.

Member Function Documentation

erase()

template<typename ValueType, typename PointAccessor>

bool Slic3r::ClosestPointInRadiusLookup< ValueType, PointAccessor >::erase ( const ValueType & value )

inline

                                       {
        const Point *pt = m_point_accessor(value);
        if (pt != nullptr) {
            // Range of fragment starts around grid_corner, close to pt.
            auto range = m_map.equal_range(Point((*pt).x()>>m_grid_log2, (*pt).y()>>m_grid_log2));
            // Remove the first item.
            for (auto it = range.first; it != range.second; ++ it) {
                if (it->second == value) {
                    m_map.erase(it);
                    return true;
                }
            }
        }
        return false;
    }

References m_grid_log2, m_map, m_point_accessor, and Slic3r::range().

Here is the call graph for this function:

find()

template<typename ValueType, typename PointAccessor>

std::pair< const ValueType *, double > Slic3r::ClosestPointInRadiusLookup< ValueType, PointAccessor >::find ( const Vec2crd & pt )

inline

                                                              {
        // Iterate over 4 closest grid cells around pt,
        // find the closest start point inside these cells to pt.
        const ValueType *value_min = nullptr;
        double           dist_min = std::numeric_limits<double>::max();
        // Round pt to a closest grid_cell corner.
        Vec2crd            grid_corner((pt.x()+(m_grid_resolution>>1))>>m_grid_log2, (pt.y()+(m_grid_resolution>>1))>>m_grid_log2);
        // For four neighbors of grid_corner:
        for (coord_t neighbor_y = -1; neighbor_y < 1; ++ neighbor_y) {
            for (coord_t neighbor_x = -1; neighbor_x < 1; ++ neighbor_x) {
                // Range of fragment starts around grid_corner, close to pt.
                auto range = m_map.equal_range(Vec2crd(grid_corner.x() + neighbor_x, grid_corner.y() + neighbor_y));
                // Find the map entry closest to pt.
                for (auto it = range.first; it != range.second; ++it) {
                    const ValueType &value = it->second;
                    const Vec2crd *pt2 = m_point_accessor(value);
                    if (pt2 != nullptr) {
                        const double d2 = (pt - *pt2).cast<double>().squaredNorm();
                        if (d2 < dist_min) {
                            dist_min = d2;
                            value_min = &value;
                        }
                    }
                }
            }
        }
        return (value_min != nullptr && dist_min < coordf_t(m_search_radius) * coordf_t(m_search_radius)) ? 
            std::make_pair(value_min, dist_min) : 
            std::make_pair(nullptr, std::numeric_limits<double>::max());
    }

References Slic3r::cast(), m_grid_log2, m_grid_resolution, m_map, m_point_accessor, m_search_radius, and Slic3r::range().

Referenced by Slic3r::modulate_extrusion_by_overlapping_layers().

Here is the call graph for this function:

Here is the caller graph for this function:

find_all()

template<typename ValueType, typename PointAccessor>

std::vector< std::pair< const ValueType *, double > > Slic3r::ClosestPointInRadiusLookup< ValueType, PointAccessor >::find_all ( const Vec2crd & pt )

inline

                                                                             {
        // Iterate over 4 closest grid cells around pt,
        // Round pt to a closest grid_cell corner.
        Vec2crd      grid_corner((pt.x()+(m_grid_resolution>>1))>>m_grid_log2, (pt.y()+(m_grid_resolution>>1))>>m_grid_log2);
        // For four neighbors of grid_corner:
        std::vector<std::pair<const ValueType*, double>> out;
        const double r2 = double(m_search_radius) * m_search_radius;
        for (coord_t neighbor_y = -1; neighbor_y < 1; ++ neighbor_y) {
            for (coord_t neighbor_x = -1; neighbor_x < 1; ++ neighbor_x) {
                // Range of fragment starts around grid_corner, close to pt.
                auto range = m_map.equal_range(Vec2crd(grid_corner.x() + neighbor_x, grid_corner.y() + neighbor_y));
                // Find the map entry closest to pt.
                for (auto it = range.first; it != range.second; ++it) {
                    const ValueType &value = it->second;
                    const Vec2crd *pt2 = m_point_accessor(value);
                    if (pt2 != nullptr) {
                        const double d2 = (pt - *pt2).cast<double>().squaredNorm();
                        if (d2 <= r2)
                            out.emplace_back(&value, d2);
                    }
                }
            }
        }
        return out;
    }

References Slic3r::cast(), m_grid_log2, m_grid_resolution, m_map, m_point_accessor, m_search_radius, and Slic3r::range().

Here is the call graph for this function:

insert() [1/2]

template<typename ValueType, typename PointAccessor>

void Slic3r::ClosestPointInRadiusLookup< ValueType, PointAccessor >::insert ( const ValueType & value )

inline

                                        {
        const Vec2crd *pt = m_point_accessor(value);
        if (pt != nullptr)
            m_map.emplace(std::make_pair(Vec2crd(pt->x()>>m_grid_log2, pt->y()>>m_grid_log2), value));
    }

References m_grid_log2, m_map, and m_point_accessor.

Referenced by Slic3r::modulate_extrusion_by_overlapping_layers().

Here is the caller graph for this function:

insert() [2/2]

template<typename ValueType, typename PointAccessor>

void Slic3r::ClosestPointInRadiusLookup< ValueType, PointAccessor >::insert ( ValueType && value )

inline

                                   {
        const Vec2crd *pt = m_point_accessor(value);
        if (pt != nullptr)
            m_map.emplace(std::make_pair(Vec2crd(pt->x()>>m_grid_log2, pt->y()>>m_grid_log2), std::move(value)));
    }

References m_grid_log2, m_map, and m_point_accessor.

Member Data Documentation

m_grid_log2

template<typename ValueType, typename PointAccessor>

coord_t Slic3r::ClosestPointInRadiusLookup< ValueType, PointAccessor >::m_grid_log2

private

Referenced by ClosestPointInRadiusLookup(), erase(), find(), find_all(), insert(), and insert().

m_grid_resolution

template<typename ValueType, typename PointAccessor>

coord_t Slic3r::ClosestPointInRadiusLookup< ValueType, PointAccessor >::m_grid_resolution

private

Referenced by ClosestPointInRadiusLookup(), find(), and find_all().

m_map

template<typename ValueType, typename PointAccessor>

map_type Slic3r::ClosestPointInRadiusLookup< ValueType, PointAccessor >::m_map

private

Referenced by erase(), find(), find_all(), insert(), and insert().

m_point_accessor

template<typename ValueType, typename PointAccessor>

PointAccessor Slic3r::ClosestPointInRadiusLookup< ValueType, PointAccessor >::m_point_accessor

private

Referenced by ClosestPointInRadiusLookup(), erase(), find(), find_all(), insert(), and insert().

m_search_radius

template<typename ValueType, typename PointAccessor>

coord_t Slic3r::ClosestPointInRadiusLookup< ValueType, PointAccessor >::m_search_radius

private

Referenced by ClosestPointInRadiusLookup(), find(), and find_all().

---

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

• /home/runner/work/OrcaSlicer/OrcaSlicer/src/libslic3r/Point.hpp