Method filter

filters/FaceRasterFilter.cpp:83–182

void FaceRasterFilter::filter(PointView& v)
{
    double halfEdge = m_limits->edgeLength / 2;
    double edgeBit = m_limits->edgeLength * .000001;

    // If the user hasn't set bounds, set them based on the data.
    if (m_computeLimits)
    {
        BOX2D bounds;
        v.calculateBounds(bounds);
        m_limits->xOrigin = bounds.minx - halfEdge;
        m_limits->yOrigin = bounds.miny - halfEdge;
        m_limits->width = (int)(((bounds.maxx - m_limits->xOrigin) / m_limits->edgeLength) + 1);
        m_limits->height = (int)(((bounds.maxy - m_limits->yOrigin) / m_limits->edgeLength) + 1);
    }
    Rasterd *raster = v.createRaster("faceraster", *m_limits, m_noData);
    if (!raster)
        throwError("Raster already exists");

    TriangularMesh *m = v.mesh(m_meshName);
    if (!m)
        throwError("Mesh '" + m_meshName + "' does not exist.");

    for (const Triangle& t : *m)
    {
        double x1 = v.getFieldAs<double>(Dimension::Id::X, t.m_a);
        double y1 = v.getFieldAs<double>(Dimension::Id::Y, t.m_a);
        double z1 = v.getFieldAs<double>(Dimension::Id::Z, t.m_a);

        double x2 = v.getFieldAs<double>(Dimension::Id::X, t.m_b);
        double y2 = v.getFieldAs<double>(Dimension::Id::Y, t.m_b);
        double z2 = v.getFieldAs<double>(Dimension::Id::Z, t.m_b);

        if (!std::isinf(m_maxTriangleEdgeLength) &&
            std::hypot(x2 - x1, y2 - y1) > m_maxTriangleEdgeLength)
            continue;

        double x3 = v.getFieldAs<double>(Dimension::Id::X, t.m_c);
        double y3 = v.getFieldAs<double>(Dimension::Id::Y, t.m_c);
        double z3 = v.getFieldAs<double>(Dimension::Id::Z, t.m_c);

        if (!std::isinf(m_maxTriangleEdgeLength) &&
            (std::hypot(x2 - x3, y2 - y3) > m_maxTriangleEdgeLength ||
             std::hypot(x1 - x3, y1 - y3) > m_maxTriangleEdgeLength))
            continue;

        double xmax = (std::max)((std::max)(x1, x2), x3);
        double xmin = (std::min)((std::min)(x1, x2), x3);
        double ymax = (std::max)((std::max)(y1, y2), y3);
        double ymin = (std::min)((std::min)(y1, y2), y3);

        // Since we're checking cell centers, we add 1/2 the edge length to avoid testing cells
        // where we know the limiting position can't intersect the cell center.  The
        // subtraction of edgeBit for the lower bound is to allow for the case where the
        // minimum position is exactly aligned with a cell center (we could simply start one cell
        // lower and to the left, but this small adjustment eliminates that extra row/col in most
        // cases).
        bool okX, okY;