NodingIntersectionFinder.h

/**********************************************************************
 *
 * GEOS - Geometry Engine Open Source
 * http://geos.osgeo.org
 *
 * Copyright (C) 2006      Refractions Research Inc.
 *
 * This is free software; you can redistribute and/or modify it under
 * the terms of the GNU Lesser General Public Licence as published
 * by the Free Software Foundation.
 * See the COPYING file for more information.
 *
 **********************************************************************/
 
#pragma once
 
#include <geos/noding/SegmentIntersector.h> // for inheritance
#include <geos/geom/Coordinate.h> // for composition
#include <geos/noding/SegmentString.h>
 
#include <vector>
 
// Forward declarations
namespace geos {
namespace algorithm {
class LineIntersector;
}
namespace noding {
class SegmentString;
}
}
 
namespace geos {
namespace noding { // geos.noding
 
class NodingIntersectionFinder: public SegmentIntersector {
 
public:
 
    NodingIntersectionFinder(algorithm::LineIntersector& newLi)
        :
        li(newLi),
        interiorIntersection(geom::Coordinate::getNull()),
        intersectionCount(0),
        isCheckEndSegmentsOnly(false),
        findAllIntersections(false)
    {
    }
 
    bool
    hasIntersection() const
    {
        return !interiorIntersection.isNull();
    }
 
    const geom::Coordinate&
    getInteriorIntersection() const
    {
        return interiorIntersection;
    }
 
    size_t
    count() const
    {
        return intersectionCount;
    }
 
    void
    setCheckEndSegmentsOnly(bool isCESO)
    {
        isCheckEndSegmentsOnly = isCESO;
    }
 
 
    void
    setFindAllIntersections(bool fAI)
    {
        findAllIntersections = fAI;
    }
 
    const std::vector<geom::Coordinate>&
    getIntersectionSegments() const
    {
        return intSegments;
    }
 
    void processIntersections(
        SegmentString* e0,  std::size_t segIndex0,
        SegmentString* e1,  std::size_t segIndex1) override;
 
    bool
    isDone() const override
    {
        return !interiorIntersection.isNull();
    }
 
private:
    algorithm::LineIntersector& li;
    geom::Coordinate interiorIntersection;
    std::size_t intersectionCount;
    bool isCheckEndSegmentsOnly;
    bool findAllIntersections;
    std::vector<geom::Coordinate> intSegments;
 
    // Declare type as noncopyable
    NodingIntersectionFinder(const NodingIntersectionFinder& other) = delete;
    NodingIntersectionFinder& operator=(const NodingIntersectionFinder& rhs) = delete;
 
    static bool isInteriorVertexIntersection(
        const geom::Coordinate& p0, const geom::Coordinate& p1,
        bool isEnd0, bool isEnd1)
    {
        // Intersections between endpoints are valid nodes, so not reported
        if (isEnd0 && isEnd1) {
            return false;
        }
 
        if (p0.equals2D(p1)) {
            return true;
        }
 
        return false;
    };
 
    static bool isInteriorVertexIntersection(
        const geom::Coordinate& p00, const geom::Coordinate& p01,
        const geom::Coordinate& p10, const geom::Coordinate& p11,
        bool isEnd00, bool isEnd01, bool isEnd10, bool isEnd11)
    {
        if (isInteriorVertexIntersection(p00, p10, isEnd00, isEnd10)) {
            return true;
        }
        if (isInteriorVertexIntersection(p00, p11, isEnd00, isEnd11)) {
            return true;
        }
        if (isInteriorVertexIntersection(p01, p10, isEnd01, isEnd10)) {
            return true;
        }
        if (isInteriorVertexIntersection(p01, p11, isEnd01, isEnd11)) {
            return true;
        }
        return false;
    };
 
    static bool isEndSegment(const SegmentString* segStr, std::size_t index)
    {
        if (index == 0) {
            return true;
        }
        if (index >= segStr->size() - 2) {
            return true;
        }
        return false;
    };
 
};
 
} // namespace geos.noding
} // namespace geos