libnest2d::__nfp Namespace Reference

Functions
template<class RawShape , class Unit = TCompute<RawShape>>
bool	_vsort (const TPoint< RawShape > &v1, const TPoint< RawShape > &v2)
template<class EdgeList , class RawShape , class Vertex = TPoint<RawShape>>
void	buildPolygon (const EdgeList &edgelist, RawShape &rpoly, Vertex &top_nfp)
template<class Container , class Iterator = typename Container::iterator>
void	advance (Iterator &it, Container &cont, bool direction)

Function Documentation

_vsort()

template<class RawShape , class Unit = TCompute<RawShape>>

bool libnest2d::__nfp::_vsort ( const TPoint< RawShape > &  v1, const TPoint< RawShape > &  v2  )

inline

{
    Unit x1 = getX(v1), x2 = getX(v2), y1 = getY(v1), y2 = getY(v2);
    return y1 == y2 ? x1 < x2 : y1 < y2;
}

References libnest2d::getX(), and libnest2d::getY().

Here is the call graph for this function:

advance()

template<class Container , class Iterator = typename Container::iterator>

void libnest2d::__nfp::advance	(	Iterator &	it,
		Container &	cont,
		bool	direction
	)

{
    int dir = direction ? 1 : -1;
    if(dir < 0 && it == cont.begin()) it = std::prev(cont.end());
    else it += dir;
    if(dir > 0 && it == cont.end()) it = cont.begin();
}

buildPolygon()

template<class EdgeList , class RawShape , class Vertex = TPoint<RawShape>>

void libnest2d::__nfp::buildPolygon ( const EdgeList &  edgelist, RawShape &  rpoly, Vertex &  top_nfp  )

inline

{
    namespace sl = shapelike;
 
    auto& rsh = sl::contour(rpoly);
 
    sl::reserve(rsh, 2 * edgelist.size());
 
    // Add the two vertices from the first edge into the final polygon.
    sl::addVertex(rsh, edgelist.front().first());
    sl::addVertex(rsh, edgelist.front().second());
 
    // Sorting function for the nfp reference vertex search
    auto& cmp = _vsort<RawShape>;
 
    // the reference (rightmost top) vertex so far
    top_nfp = *std::max_element(sl::cbegin(rsh), sl::cend(rsh), cmp );
 
    auto tmp = std::next(sl::begin(rsh));
 
    // Construct final nfp by placing each edge to the end of the previous
    for(auto eit = std::next(edgelist.begin());
        eit != edgelist.end();
        ++eit)
    {
        auto d = *tmp - eit->first();
        Vertex p = eit->second() + d;
 
        sl::addVertex(rsh, p);
 
        // Set the new reference vertex
        if(cmp(top_nfp, p)) top_nfp = p;
 
        tmp = std::next(tmp);
    }
}

References libnest2d::shapelike::addVertex(), libnest2d::shapelike::begin(), libnest2d::shapelike::cbegin(), libnest2d::shapelike::cend(), libnest2d::shapelike::contour(), and libnest2d::shapelike::reserve().

Here is the call graph for this function: